Created at 4pm, May 5
fatihcomCrypto
0
Arweave: A Protocol for Economically Sustainable Information Permanence
5dvaaZSM0ksw3yCyvfxG0ylWWbZUDQ_DWOl3k0jS9gk
File Type
PDF
Entry Count
5
Embed. Model
jina_embeddings_v2_base_en
Index Type
hnsw

In this work the authors present the Arweave protocol, a new blockchain-like datastructure called the blockweave. The protocol is designed to provide scalableand permanent on-chain data storage in a sustainable manner. The blockweave forms the underlying data structure of the permaweb - the array ofdata, websites, and decentralised applications hosted on the blockweave,accessible on normal web browsers.In this paper, they will introduce several technological innovations that, together, allow Arweave to offer unique utility in the on-chain data storagespace, including: blockweave, blockshadows, AIIA, decentralised contentpolicies, and their mechanism design.

1. Transactions that are not well-formed (see appendix section 10.2.4 for the full anatomy of a transaction) are ignored by the recipient node; 2. Transactions that have already been processed are dropped; 3. The wallet associated with the transaction must contain a sucient token balance in order to process said transaction and any additional pending transactions from the same wallet; 4. T Xowner and T Xtarget should not refer to the same wallet; 5. The transaction cost must be above a dynamic minimum (see section 3.2.3 for further details of transaction cost and pricing); 6. The T Xanchor must be present in the current wallet list as T Xowners last processed transaction ID, the independent hash of one of the last 50 blocks, or be empty for the rst transaction; 34 4.2.2 Blocks During operation, a node will receive blocks from other peers in the data distribution network, either other miners or special-purpose peers (for example, Weaver browser nodes). The receiving node needs to valida
id: f5cba3e0000c8996d173d9a057f35705 - page: 1
Prompt block propagation is part of fork avoidance a node must make sure the blocks it accepts are also accepted by its peers. Critically, in order to make preliminary block verication inexpensive prior to gossiping the block to other peers (risking increasing block consensus time and subsequently forks see section 2.3 for more details of blockshadows), the proof of work found in blockshadows is veriable independently from other block checks. This avoids the necessity for constructing blockshadows into full block structures and verifying the BDS which could otherwise become a denial of service attack vector.
id: 4de98a9ca1d57ec4c45578d8eff4aaca - page: 1
txt[5.05.2024 19:49:08]
id: bbddf0aecdd9976e0a80c57e170d04e6 - page: 1
How to Retrieve?
# Search

curl -X POST "https://search.dria.co/hnsw/search" \
-H "x-api-key: <YOUR_API_KEY>" \
-H "Content-Type: application/json" \
-d '{"rerank": true, "top_n": 10, "contract_id": "5dvaaZSM0ksw3yCyvfxG0ylWWbZUDQ_DWOl3k0jS9gk", "query": "What is alexanDRIA library?"}'
        
# Query

curl -X POST "https://search.dria.co/hnsw/query" \
-H "x-api-key: <YOUR_API_KEY>" \
-H "Content-Type: application/json" \
-d '{"vector": [0.123, 0.5236], "top_n": 10, "contract_id": "5dvaaZSM0ksw3yCyvfxG0ylWWbZUDQ_DWOl3k0jS9gk", "level": 2}'