← browse profiles
Andrew Poelstra MEMBER SINCE 2022

Andrew Poelstra

@apoelstra
2editions
2talks
0projects

2 editions attended.

On stage.

Full archive →
talk

CAT, Scripts and Lamport Sigs

In 2021, Jeremy Rubin showed that it is possible to do 32-bit Lamport signatures in Bitcoin Script, without any changes to the network. This development, while independently interesting for some oracle applications, has really shown its value by its use in BitVM, an aggressively ambitious project by Robin Linus to do arbitrary computations in Script by splitting them across dozens of transactions indexing billion-entry Merkle trees. The core idea is that we can think of Lamport signatures as indexing a sort of "global key-value store" supporting single writes and erasures, where each entry has an owner. We discuss this idea, as well as how it generalizes using OP_CAT beyond 32-bit values to "real" signatures, commitments to Merkle trees, and more.

Austin 2024
talk

Hand-Computed Checksums and Secret Sharing

Will work through a variant of "codex32", a volvelle (paper computer) based scheme for generating and verifying checksums; splitting and recovering secrets; encrypting and decrypting them. Throughout we will avoid the use of electronic computers, whose complexity and lack of transparency make them a liability for long-term cold storage. Codex32 is designed to work with 128-bit keys. Because of a current lack of wallet support, and time constraints, we will instead work through the processes for 32- or 48-bit keys. SETUP: Cutting out and assembling volvelles (paper computers) https://btcpp2022.sched.com/event/12P6Q/bitcoin-paper-computers-a-secret-sharing-workshop

Austin 2022