In Zebra, the bug was not a missing limit. It was a missing peer. Our new research traces how direct tx messages in @ZcashFoundation's Zebra became anonymous mempool work, skipping per-peer accounting and turning shared relay capacity into bounded DoS.

Formal Methods get sharper when they move from toy models to production chains. Our new research starts with a @provenancefdn liveness property, then follows a counterexample into a cross-module namespace bug that escalated from deterministic chain halt to infinite mint.

Formal Verification gets clearer when it moves from textbook examples to real bugs. Our new Dafny walkthrough starts with Bubble Sort, Quick Sort, and Merge Sort, then shows how specifications, invariants, and proof obligations uncover a stage-accounting vulnerability.

Formal Verification sounds intimidating, but proving your first program with SMT Solver is way more approachable than you think. We just released an incredibly clear intro article that walks you through SMT basics, loop invariants, and verification conditions step by step.