Cryptology ePrint Archive: Report 2019/611

Utreexo: A dynamic hash-based accumulator optimized for the Bitcoin UTXO set

Thaddeus Dryja

Abstract: In the Bitcoin consensus network, all nodes come to agreement on the set of Unspent Transaction Outputs (The “UTXO” set). The size of this shared state is a scalability constraint for the network, as the size of the set expands as more users join the system, increasing resource requirements of all nodes. Decoupling the network’s state size from the storage requirements of individual machines would reduce hardware requirements of validating nodes. We introduce a hash based accumulator to locally represent the UTXO set, which is logarithmic in the size of the full set. Nodes attach and propagate inclusion proofs to the inputs of transactions, which along with the accumulator state, give all the information needed to validate a transaction. While the size of the inclusion proofs results in an increase in network traffic, these proofs can be discarded after verification, and aggregation methods can reduce their size to a manageable level of overhead. In our simulations of downloading Bitcoin’s blockchain up to early 2019 with 500MB of RAM allocated for caching, the proofs only add approximately 25% to the amount otherwise downloaded.

Category / Keywords: cryptographic protocols / accumulators, bitcoin, merkle proofs

Date: received 31 May 2019, last revised 5 Jun 2019

Contact author: tdryja at media mit edu

Available format(s): PDF | BibTeX Citation

Version: 20190605:153040 (All versions of this report)

Short URL: ia.cr/2019/611


[ Cryptology ePrint archive ]