Bootstrapping full nodes post-pruning

Jun 11 - Jun 11, 2012

  • The discussion revolves around the use of BerkeleyDB (BDB) in Bitcoin and concerns regarding its inter-version compatibility and lack of space efficiency.

It is mentioned that BDB files are not deterministic, which poses a problem for read-only pruned indexes. There is a suggestion to swap out BDB for LevelDB, but uncertainty remains about how deterministic LevelDB is.In 2012, Mike Hearn expressed concerns about introducing unauditable single source material, as it would require users to trust developers without any means to audit the software. He suggests a deterministic process to produce archival chains and introducing commitments to them in the blockchain. This way, a client doing a reverse header sync would encounter a commitment for an archival chain they have and would stop syncing and use the archival chain for points before that. This approach allows for auditable software distribution.The discussion also addresses the issue of bootstrapping newly installed nodes for Bitcoin. Three options are suggested: having special archival nodes that never prune, shipping a post-pruning block chain and transaction index with client downloads, or a combination of both approaches. Some individuals, like Greg, are not in favor of shipping pre-indexed files due to the absence of indexing overhead, but it speeds up the startup process for new users. The goal is to find a solution that balances the benefits and drawbacks of each approach to ensure easy bootstrapping of new nodes.

Link to Raw Post

Thread Summary (0 replies)

Jun 11 - Jun 11, 2012

Message History

1 messages

Original Post
Jun 11, 2012/20:48 UTC
Bitcoin Logo

TLDR

Join Our Newsletter

We’ll email you summaries of the latest discussions from high signal bitcoin sources, like bitcoin-dev, lightning-dev, and Delving Bitcoin.

Explore all Products

ChatBTC imageBitcoin searchBitcoin TranscriptsSaving SatoshiDecoding BitcoinWarnet
Built with 🧡 by the Bitcoin Dev Project
View our public visitor count

We'd love to hear your feedback on this project.

Give Feedback