Venkatesh Rao et al. — The Unreasonable Sufficiency of Protocols (2023)
Summer of Protocols Research Series.
Rao and collaborators argue that protocols — shared conventions, rules, and procedures — achieve far more coordination than their apparent simplicity would predict. The title riffs on Wigner’s “unreasonable effectiveness of mathematics”: the puzzle is not why protocols work but why they work so well with so little.
The essay develops a theory of why protocols are powerful: they are legible (interpretable by many parties without specialized knowledge), generative (they produce emergent behavior not specified in their rules), interoperable (they stack and combine with other protocols), and self-enforcing (compliance is often individually rational without external enforcement). The most powerful protocols are those that exhibit all four properties simultaneously.
For OM: this essay provides direct theoretical support for the claim that minimal, memetic open protocols can scale underground values without requiring the organizational overhead of institutions. The “unreasonable sufficiency” is exactly what OM means by formalization without standardization — the protocol does more work than its formal specification would suggest, precisely because of its openness and memeticism.