On Improving the Merkle Trees: The n-Trees

Julien Riposo
Additional contact information
Julien Riposo: London Stock Exchange Group

Chapter Chapter 6 in Some Fundamentals of Mathematics of Blockchain, 2023, pp 89-104 from Springer

Abstract: Abstract In the context of Bitcoin Simplified Payment Verification (SPV) and Solvency, there are tree configurations where the path to the root is shorter than the one given by the usual binary tree, for the same computational memory – which is an essential strength. The n-trees have such properties, for n ≥ 2 (binary trees are for n = 2). We show that, for some values of number of transactions N ≥ 3, the system could be much faster, plus gain computational power, memory, and significantly reduce the computational time.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-31323-3_6

Ordering information: This item can be ordered from
http://www.springer.com/9783031313233

DOI: 10.1007/978-3-031-31323-3_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().