Dynamic Merkle B-tree with Efficient Proofs · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2006.01994/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTDynamic Merkle B-tree with Efficient Proofs — mentioned by AR_1https://news.ycombinator.com/item?id=24594787urn:hackerpapers:mention:2006.01994:24594787Fri, 25 Sep 2020 22:32:33 GMT<p>@JJ big fan of yours and ideas behind Urkel. Now in C it’ll be very performant. Likewise, I’ve done testing with SMT and we were hitting the same bottlenecks. It will be interesting to test this implementation. We recently published a research paper where we propose a use of dynamic B+ Tree with efficient proof sizes. Dynamic Merkle B-Tree with Efficient Proofs: https://arxiv.org/abs/2006.01994</p><p><a href="https://hackerpaper.kaipfister.de/p/2006.01994/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CR