FRI in Twelve Cards — The Definitions to Memorise
Twelve flashcards for the FRI protocol: low-degree polynomials, Reed-Solomon codes, proximity, Merkle commitments, folding, the commit and query phases.
2026, Sep 14 — 10 minute read
Twelve flashcards for the FRI protocol: low-degree polynomials, Reed-Solomon codes, proximity, Merkle commitments, folding, the commit and query phases.
2026, Sep 14 — 10 minute read
A private Aztec function cannot read a public flag. DelayedPublicMutable allows it, at the price of a delay that also caps how long the transaction stays valid.
2026, Sep 14 — 21 minute read
The toolbox behind FRI: linear codes and the Johnson bound, IOPs and the BCS compiler, quotienting with a DEEP sample, proximity gaps and folding.
2026, Sep 11 — 33 minute read
A layered glossary of FRI and proximity proofs. Thirty terms, from Hamming distance and Reed-Solomon codes to IOPPs, quotienting, DEEP and folding.
2026, Sep 11 — 19 minute read
Aztec's ERC equivalents share one design: a private note balance and a public balance per account, transfers named by domain, authwits instead of approve.
2026, Sep 11 — 22 minute read
AIP-20 gives each account a private note balance and a public one, swaps approve for authwits and reverts on shortfall. ERC-7984 hides amounts, never reverts.
2026, Sep 11 — 32 minute read
How adversaries acquire credentials with Brute Force (T1110), Password Guessing (T1110.001) and Spraying (T1110.003), then abuse them as Valid Accounts (T1078).
2026, Sep 09 — 14 minute read