Journal DOI 10.68956/journal.legal-engineering-technology

Creative Commons source reading · Rules as code

Computational Jurisprudence: Verifiable Law for Machine Societies

Vladimir Stantchev

Originally published in Future Internet · 2026-08-16

From the article

Selected source text. JournalOS removes markup and shortens excerpts where indicated. The full article provides the complete context.

Abstract

Autonomous AI agents now hold funds, delegate authority to other agents, and transact at machine speed, while the governance apparatus meant to constrain them (policies, audits, compliance) remains documentation-based and limited by human latency. Better monitoring or filtering cannot close this mismatch: compliance must become a runtime, compositional, proof-carrying property of computation itself. We call the resulting discipline computational jurisprudence. This article is an integrative review of the four literatures the discipline must synthesize, namely, object-capability security; verifiable, proof-carrying, and zero-knowledge computation; policy-as-code and computational law; and agentic AI with its emerging payment protocols. Each supplies a mature mechanism the others lack, and none supplies a complete normative substrate. The synthesis is organized into three pillars: (i) a delegation calculus, under which authority can only attenuate as it propagates between agents, for which we prove monotone attenuation in the conjunctive caveat fragment and exhibit a counterexample outside it; (ii) runtime compliance proofs, a three-tier evidence regime (attested, optimistic, and zero-knowledge); and (iii) sealed delegation chains with graduated attribution, reconciling capability-based privacy with the accountability adjudication requires. A case study on agentic payments ground

Editorial reading guide

  • Which legal requirement is represented, and which assumptions does that representation introduce?
  • How could a practitioner test the result against an ambiguous or exceptional case?