Podcast cover for "Verifiable Off-Chain Governance" by Jake Hartnell & Eugenio Battaglia
Episode

Verifiable Off-Chain Governance

Dec 29, 20257:40
Computer Science and Game Theory
No ratings yet

Abstract

Current DAO governance praxis limits organizational expressivity and reduces complex organizational decisions to token-weighted voting due to on-chain computational limits. This paper proposes verifiable off-chain computation (leveraging Verifiable Services, TEEs, and ZK proofs) as a framework to transcend these constraints while maintaining cryptoeconomic security. This paper explores three novel governance mechanisms: (1) attestation-based systems that compute multi-dimensional stakeholder legitimacy, (2) collective intelligence through verifiable preference processing, and (3) autonomous policy execution via Policy-as-Code. The framework provides architectural specifications, security models, and implementation considerations for DAOs seeking higher-resolution expressivity and increased operational efficiency, with validation from pioneering implementations demonstrating practical viability.

Links & Resources

Authors

Cite This Paper

Year:2025
Category:cs.GT
APA

Hartnell, J., Battaglia, E. (2025). Verifiable Off-Chain Governance. arXiv preprint arXiv:2512.23618.

MLA

Jake Hartnell and Eugenio Battaglia. "Verifiable Off-Chain Governance." arXiv preprint arXiv:2512.23618 (2025).