Blockchains & Verifiable Computation
A Lumenary CS elective: how blockchains reach agreement without a central authority, and how cryptographic proofs let anyone check a computation without redoing it.
This elective of Lumenary CS teaches two connected ideas. A blockchain is a ledger kept by many parties who do not trust one another, and it raises hard questions in distributed systems, cryptography and economics. Verifiable computation asks how one party can prove to another that a computation was done correctly, with a proof far quicker to check than the computation itself; its zero-knowledge proofs and SNARKs began as theory and now run in production, in blockchains and beyond.
The course assumes Lumenary CS up to the Engineering level — above all applied cryptography and replication and consensus — and some comfort with modular arithmetic (Lumenary Math has it). Code is in Python, and every block with a Run in browser button runs there: you will build a Merkle tree, mine a toy chain, sign with Schnorr signatures and run the sumcheck protocol yourself. Smart-contract code in Solidity is shown and explained, not run.
It is written to inform, not to sell: nothing here is investment advice, and the lessons are as plain about fraud, failures, energy use and open problems as about what works. Every lesson was drafted with AI assistance and is awaiting review by a human expert. The text, exercises and code are original and licensed CC BY-SA 4.0 (code Apache-2.0); papers, specifications and projects' own documentation are linked, not retold.
- Chloe · The Computer Scientist
“What's the idea that makes it work?” - Margaret · The Experimenter
“What happens when we run it?” - Gideon · The Verifier
“Is it correct in every case?”
Foundations · 5 lessons
Trust, cryptography and consensus
Why anyone would want a blockchain, and the pieces it is built from: trust models, hash functions and Merkle trees, digital signatures, and the two families of consensus, proof of work and proof of stake.
- 1Why blockchains?A shared ledger kept by parties who do not trust one another — what problem that solves, what it costs, and when an ordinary database run by someone trustworthy is the better answer. 60 min
- 2Hash functions, commitments and Merkle treesThe fingerprints every blockchain is built from — what a cryptographic hash promises, how to commit to a secret, and how one 32-byte root vouches for a million records. 75 min
- 3Digital signatures, keys and walletsOn a blockchain your private key is your account — how Schnorr, ECDSA, EdDSA and BLS signatures work, how one repeated random number gives the key away, and what wallets, custody and quantum computers mean for the people holding keys. 80 min
- 4Proof of work and Nakamoto consensusHow a hash puzzle turns computing power into votes, why the chain with the most work wins, how safe "six confirmations" really is — and what it all costs in electricity. 80 min
- 5Proof of stake and BFT finalityReplacing work with deposits that can be destroyed — validators and slashing, the attacks unique to stake, classical BFT consensus, and how Ethereum combines a fork-choice rule with two-thirds-majority finality. 80 min
Practice · 5 lessons
Blockchains in practice
How real chains work and fail: Bitcoin's transactions, Ethereum and smart contracts, contract security and MEV, scaling with rollups and data availability, and an honest look at applications, limits and regulation.
- 6Bitcoin's transactions: UTXOs and ScriptCoins as unspent outputs, ownership as a small program, and the fees, upgrades, channels and chain analysis built on top. 75 min
- 7Ethereum and smart contractsA world computer with accounts, a stack machine metered by gas, contracts that cannot be changed, and the patterns and compromises built around them. 80 min
- 8Smart-contract securityPublic code holding public money: reentrancy, overflow, broken access control, oracle manipulation, MEV, bridge hacks, and the tools and habits that defend against them. 80 min
- 9Scaling: rollups and data availabilityWhy a base layer is slow on purpose, how rollups move execution off it while keeping its security, and why publishing data turns out to be the hard part. 80 min
- 10Applications, limits and regulationAn honest survey of what blockchains are used for, what has failed, what they cost, how the law treats them in 2026, and how to recognise a scam. 85 min
Verifiable · 6 lessons
Verifiable computation
Proofs that a computation was done correctly, checkable far faster than redoing it: interactive proofs and sumcheck, zero knowledge, arithmetisation and SNARKs, STARKs and folding, zkVMs and coprocessors, and the research frontier.
- 11Interactive proofs and the sumcheck protocolHow a weak verifier, armed with a few random numbers, can check a huge computation it never performs. 80 min
- 12Zero knowledgeConvincing someone that a statement is true while telling them nothing else, defined precisely, built from commitments, and made non-interactive. 80 min
- 13Arithmetisation and SNARKsTurning a computation into polynomial equations over a finite field, committing to polynomials, and the proof systems — Groth16 and PLONK — built from them. 90 min
- 14STARKs, FRI, lookups and foldingProof systems built from hashes and error-correcting codes, the small fields that make them fast, and the tricks — lookups, recursion and folding — that let them scale. 90 min
- 15zkVMs and ZK coprocessorsProving whole programs instead of hand-built circuits — execution traces, memory checking, RISC-V and EVM provers, coprocessors for chain data and databases, verifiable machine learning, and the hardware alternative. 85 min
- 16The frontier of verifiable computationA briefing as of late 2026 — real-time proving and its cost, provable security and the bugs that made it urgent, formal verification, post-quantum migration, hardware, standards, uses beyond blockchains, open problems, and how to start. 80 min
Further reading and resources
- Bitcoin: A Peer-to-Peer Electronic Cash System · Satoshi Nakamoto · 2008
- Ethereum documentationThe Ethereum community's own documentation of the protocol, the EVM and smart contracts.
- Proofs, Arguments, and Zero-Knowledge · Justin ThalerA free monograph on interactive proofs, SNARKs and their implementations.
- Bitcoin and Cryptocurrency Technologies · Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven GoldfederA textbook from Princeton, with a free draft.
- ZKProof Community ReferenceThe zero-knowledge proof community's standardisation effort and reference documents.