This talk presents Aegon, a self-auditable key transparency scheme designed for global-scale encrypted messaging. It builds on Iron Dict's polynomial commitment approach to remove per-epoch global work, shards the dictionary for horizontal scaling, and uses proof caching to bound storage. The result is constant-size audit proofs that a lightweight client can verify itself over an entire history, rather than relying on external auditors.
TruthTable is a verifiable database engine that produces succinct cryptographic proofs for SQL query execution. It supports a wide range of SQL queries by leveraging query plans, polynomial encoding, and operator-specific PIOPs. It features a query planner with proof-specific optimizations and a novel batch compilation engine (ARCPOP). Benchmarks on TPC-H show average proving times of 55 seconds, verification times of 32 milliseconds, and proof sizes of 24kB, significantly outperforming prior academic and industrial systems in speed and expressiveness.