Presentation
VaultX Merge: Breaking Memory Barriers in Proof-of-Space Plot Generation
DescriptionProof-of-work blockchains, like Bitcoin, consume substantial energy, motivating greener alternatives such as proof-of-space (PoSp), which relies on storage rather than computation. Existing PoSp implementations face scalability challenges due to high memory and I/O requirements, especially when generating large plots needed for fast lookups.
We present VaultX Merge, a novel out-of-memory PoSp plot generation method. VaultX Merge first creates multiple small in-memory subplots and then merges them into large plots, reducing redundant storage I/O, minimizing data size, and improving lookup latency. Our approach enables efficient operation across a range of devices, from small nodes like Raspberry Pis to high-end servers.
In our poster, we will demonstrate VaultX Merge’s performance across different hardware and storage configurations, showing up to 50% faster plot generation compared to previous out-of-RAM implementations, and highlight how this approach facilitates scalable, energy-efficient blockchain participation.
We present VaultX Merge, a novel out-of-memory PoSp plot generation method. VaultX Merge first creates multiple small in-memory subplots and then merges them into large plots, reducing redundant storage I/O, minimizing data size, and improving lookup latency. Our approach enables efficient operation across a range of devices, from small nodes like Raspberry Pis to high-end servers.
In our poster, we will demonstrate VaultX Merge’s performance across different hardware and storage configurations, showing up to 50% faster plot generation compared to previous out-of-RAM implementations, and highlight how this approach facilitates scalable, energy-efficient blockchain participation.
Event Type
Research and ACM SRC Posters
TimeThursday, 20 November 20258:00am - 5:00pm CST
LocationSecond Floor Atrium
Archive
view