ethereum-magicians.orgthread

Formalization of the Invariant Duality Theorem

An Ethereum Magicians forum post formalizes an "Invariant Duality Theorem": in a permissionless network, a protocol cannot simultaneously achieve Perfect Indistinguishability (traffic statistically indistinguishable from white noise under DPI) and Resource Exhaustion Resistance (O(1) early rejection of junk packets). The proof sketch argues that indistinguishable traffic forces receivers to run expensive deobfuscation on all packets including attacker-generated noise (enabling DoS), while any cheap early-filter function, by Kerckhoffs's principle, becomes a public signature a censor can hardware-implement to block the protocol. This is a theoretical tradeoff relevant to designing or attacking covert/anti-censorship transport protocols.