This workshop aims to provide an introduction to algorithms which can be done by non-experts without electronics computers in a reasonable amount of time. In particular, our goal will be to cut out and assemble a paper computer, and then with the assistance of worksheets, validate the checksum on a bech32 address.
What would an attendee learn from this workshop?
That it is possible to verify checksums by hand; and that by straightforward but tedious extensions of this idea, it is possible to generate checksums, split and recover data using Shamir's Secret Sharing Scheme, and maybe some unrelated patter about random number generation.
Is there anything attendees should read up on before they attend this talk?
I have a [UA-cam talk about this project here](ua-cam.com/video/kf48oPoiHX0/v-deo.html). See also the main [codex32 website](secretcodex32.com/).
None of this is essential reading.
Is there anything attendees should set up before the workshop?
They may want to download the full [codex32 booklet](secretcodex32.com/) and print out/assemble the addition volvelle (page 21/22). It is best to print it on cardstock. We will provide printouts and time to do assembly, but it takes 20-30 minutes and will not teach you anything you didn't learn as a child.
Level of difficulty
Intermediate. Nothing is technically hard or requiring prerequisites but it's frustrating and tedious work.
About the Speaker
Social Links
Github github.com/apoelstra
Website www.wpsoftware.net/andrew
TABConf 6 GitHub link
github.com/TABConf/6.tabconf.com/issues/95