Arweave’s Upgrade (v2.6) Boosts Storage Acquisition & Reduces Energy Waste
Key Points:
- Arweave upgraded to version 2.6, lowering storage acquisition cost, reducing energy wastage, and improving storage cost estimation.
- Miners are incentivized to pack unique replicas of data and store complete replicas, increasing their chances of winning mining competitions and improving data distribution.
Arweave has recently undergone an upgrade to version 2.6. This upgrade achieves several important objectives, including lowering the storage acquisition cost for the network, reducing energy wastage, incentivizing miners to self-organize into full replicas of the Arweave dataset, and allowing for better dynamic price per GB/hour storage cost estimation in the network.
One of the key features of Arweave is its use of a SHA-256 hash chain, which produces a mining hash once every second. Miners select an index of a partition they store to begin mining, and a recall range is generated in the miner’s partition and another at a random weave location. Chunks in the first recall range are checked as potential block solutions, with the second range potentially being checked as well.
To optimize mining strategies on Arweave, miners are incentivized to pack unique replicas and store complete replicas of the Arweave dataset. Packing involves providing a packing key to RandomX and generating a scratchpad of entropy over multiple iterations. The first 256KiB of the scratchpad are then used to encrypt the chunk, with the same process being used to decrypt/reveal the original chunk. In version 2.6, the packing key is extended to include the miner’s address, making each replica unique per mining address.
By storing complete replicas, miners can increase their chances of winning the mining competition and earning rewards. Additionally, storing complete replicas results in a more uniform data distribution across the network and reduces energy wastage. The recall ranges are contiguous blocks of memory, minimizing the amount of read head movement on hard disk drives and encouraging miners to use cheaper drives to store data.
The upgrade to version 2.6 also incentivizes miners to self-organize into full replicas of the Arweave dataset, allowing for faster routing to data and an even more ‘flat’ distribution of data replication. This results in a more efficient and cost-effective network, lowering the storage acquisition cost for the network and allowing for better dynamic price per GB/hour storage cost estimation.
DISCLAIMER: The Information on this website is provided as general market commentary and does not constitute investment advice. We encourage you to do your own research before investing.
Join us to keep track of news: https://linktr.ee/coincu
Thana
Coincu News
Author
News
Arweave’s Upgrade (v2.6) Boosts Storage Acquisition & Reduces Energy Waste
Key Points:
- Arweave upgraded to version 2.6, lowering storage acquisition cost, reducing energy wastage, and improving storage cost estimation.
- Miners are incentivized to pack unique replicas of data and store complete replicas, increasing their chances of winning mining competitions and improving data distribution.
Arweave has recently undergone an upgrade to version 2.6. This upgrade achieves several important objectives, including lowering the storage acquisition cost for the network, reducing energy wastage, incentivizing miners to self-organize into full replicas of the Arweave dataset, and allowing for better dynamic price per GB/hour storage cost estimation in the network.
One of the key features of Arweave is its use of a SHA-256 hash chain, which produces a mining hash once every second. Miners select an index of a partition they store to begin mining, and a recall range is generated in the miner’s partition and another at a random weave location. Chunks in the first recall range are checked as potential block solutions, with the second range potentially being checked as well.
To optimize mining strategies on Arweave, miners are incentivized to pack unique replicas and store complete replicas of the Arweave dataset. Packing involves providing a packing key to RandomX and generating a scratchpad of entropy over multiple iterations. The first 256KiB of the scratchpad are then used to encrypt the chunk, with the same process being used to decrypt/reveal the original chunk. In version 2.6, the packing key is extended to include the miner’s address, making each replica unique per mining address.
By storing complete replicas, miners can increase their chances of winning the mining competition and earning rewards. Additionally, storing complete replicas results in a more uniform data distribution across the network and reduces energy wastage. The recall ranges are contiguous blocks of memory, minimizing the amount of read head movement on hard disk drives and encouraging miners to use cheaper drives to store data.
The upgrade to version 2.6 also incentivizes miners to self-organize into full replicas of the Arweave dataset, allowing for faster routing to data and an even more ‘flat’ distribution of data replication. This results in a more efficient and cost-effective network, lowering the storage acquisition cost for the network and allowing for better dynamic price per GB/hour storage cost estimation.
DISCLAIMER: The Information on this website is provided as general market commentary and does not constitute investment advice. We encourage you to do your own research before investing.
Join us to keep track of news: https://linktr.ee/coincu
Thana
Coincu News
Other Posts
Related Posts
News
The Bitcoin Epic Satoshi Of The 4th Halving Was Auctioned For Over $2.1 Million
News
Hong Kong Crypto ETFs Of HashKey And Bosera Completed Subscription To Launch On April 30
News
