🏷️ Categories: bitcoin-dev
quoting naddr1qq…c2km📝 Summary: Tom Briar has developed a compression schema for bitcoin transactions that can be transmitted through low bandwidth channels without corruption. Fabian suggests using an index from a sorted UTXO set instead of a block height and index to save space. Andrew Poelstra explains the complexity and potential issues with indexing all transactions. Tom Briar discusses the use of a prefix tree for the UTXO set and the removal of vout from the encoding. Peter Todd suggests using a reference height and encoding the exact transaction output with a delta. Jonas Schnelli mentions Tom’s work on compressing bitcoin transactions for transmission through steganography and satellite broadcasting. Tom Briar updates the code and estimates that 100 blocks are safe from reorg.
👥 Authors: • Fabian ( Fabian [ARCHIVE] (npub1wca…hvcp) ) • Andrew Poelstra ( Andrew Poelstra [ARCHIVE] (npub1ae2…5t04) ) • Tom Briar ( Tom Briar [ARCHIVE] (npub1ygn…ya2e) ) • Peter Todd ( Peter Todd [ARCHIVE] (npub1m23…2np2) ) • Jonas Schnelli ( Jonas Schnelli [ARCHIVE] (npub1nfr…dtxs) )
📅 Messages Date Range: 2023-08-31 to 2023-09-05
✉️ Message Count: 9
📚 Total Characters in Messages: 20589
Messages Summaries
✉️ Message by Andrew Poelstra on 01/09/2023: Tom Briar has developed a compression schema for bitcoin transactions that can be transmitted through low bandwidth channels without corruption.
✉️ Message by Fabian on 01/09/2023: Tom thanks Fabian for his effort in the research and implementation. Fabian suggests using an index from a sorted UTXO set for potential space saving and compatibility with pruning.
✉️ Message by Fabian on 01/09/2023: Fabian suggests using an index from a sorted UTXO set instead of a block height and index to save space in bitcoin transactions.
✉️ Message by Andrew Poelstra on 01/09/2023: The author considered indexing all transactions but decided against it due to increased complexity and potential issues with compressed transactions becoming invalidated. The space savings would be less than a byte per input, not worth the implementation complexity.
✉️ Message by Tom Briar on 01/09/2023: Creating a prefix tree for the UTXO set would require more space than using block height and index. The vout was removed from the encoding, reducing the number of required bits.
✉️ Message by Peter Todd on 05/09/2023: The author suggests using a reference height and encoding the exact transaction output with a delta to save space in Bitcoin transactions.
✉️ Message by Tom Briar on 05/09/2023: The author is discussing the compression of transaction data in Bitcoin and suggests dropping the grinding of lock time in favor of grinding the block height to save bytes.
✉️ Message by Jonas Schnelli on 01/09/2023: Tom is working on compressing bitcoin transactions for transmission through steganography and satellite broadcasting, and it would be helpful to have size comparisons and a clear definition for when not to use height/index.
✉️ Message by Tom Briar on 01/09/2023: Tom is updating the code to match the document and estimates that 100 blocks are safe from reorg. He will add it to the document.
Follow Bitcoin Mailing List (npub15g7…08lk) for full threads
⚠️ Heads up! We've now started linking to replaceable long-form events (NIP-23), which allow for dynamic display of thread details like summaries, authors, and more. If you're unable to see this, your client may not support this feature yet.