Why fuzzing over formal verification?
Summary: Trail of Bits compared fuzzing and formal verification, arguing that proving the absence of bugs is typically unattainable on complex codebases because code may need rewriting, custom summaries, manual loop constraints, or solvers that time out. The firm reproduced two bugs previously found with formal verification in MakerDAO and Compound using its Echidna fuzzer, which violated the invariants in under a minute and within minutes respectively on a typical development laptop.
Why it matters: A bug in MakerDAO's live DAI code went undetected for four years, and the fuzzer that found the same flaw ran in under a minute on an i5 machine with 12 GB of RAM - the barrier to catching it was never tooling cost, it was writing the right invariant.
Read the original at Trail of Bits Blog ↗