{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T08:28:32Z","timestamp":1787300912086,"version":"build-2736575974"},"reference-count":51,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2026,8,16]],"date-time":"2026-08-16T00:00:00Z","timestamp":1786838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>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 grounds the architecture and evaluates three components on two platforms, with five independent executions each: local capability verification against a centralized policy decision point, enforcement on the x402 payment path, and accumulator-based revocation. What the article offers is therefore a survey, a conceptual architecture with a formal core, and a partial evaluation of three components, not a fully implemented system; a status table marks that boundary component by component. Eight open problems define the research agenda.<\/jats:p>","DOI":"10.3390\/fi18080437","type":"journal-article","created":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T11:00:05Z","timestamp":1786964405000},"page":"437","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational Jurisprudence: Verifiable Law for Machine Societies"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1551-419X","authenticated-orcid":false,"given":"Vladimir","family":"Stantchev","sequence":"first","affiliation":[{"name":"TEAC, SRH University Heidelberg, 69123 Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,8,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Rose, S., Borchert, O., Mitchell, S., and Connelly, S. (2020). Zero Trust Architecture, NIST Special Publication 800-207.","DOI":"10.6028\/NIST.SP.800-207-draft2"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/54289.871709","article-title":"The Confused Deputy (or why capabilities might have been invented)","volume":"22","author":"Hardy","year":"1988","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"ref_3","unstructured":"Miller, M.S. (2006). Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control. [Ph.D. Thesis, Johns Hopkins University]."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Stantchev, V. (2026). Computational Jurisprudence: Verifiable Law for Machine Societies. Zenodo.","DOI":"10.20944\/preprints202607.1528.v1"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Birgisson, A., Politz, J.G., Erlingsson, \u00da., Taly, A., Vrable, M., and Lentczner, M. (2014, January 23\u201326). Macaroons: Cookies with Contextual Caveats for Decentralized Authorization in the Cloud. Proceedings of the Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA.","DOI":"10.14722\/ndss.2014.23212"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., and Ylonen, T. (1999). SPKI Certificate Theory, IETF. Technical Report RFC 2693.","DOI":"10.17487\/rfc2693"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Richer, J., and Imbault, F. (2024). Grant Negotiation and Authorization Protocol (GNAP), Internet Engineering Task Force. RFC 9635.","DOI":"10.17487\/RFC9635"},{"key":"ref_8","unstructured":"Debenedetti, E., Shumailov, I., Fan, T., Hayes, J., Carlini, N., Fabian, D., Kern, C., Shi, C., Terzis, A., and Tram\u00e8r, F. (2025). Defeating Prompt Injections by Design. arXiv."},{"key":"ref_9","unstructured":"Costa, M., K\u00f6pf, B., Kolluri, A., Paverd, A., Russinovich, M., Salem, A., Tople, S., Wutschitz, L., and Zanella-B\u00e9guelin, S. (2025). Securing AI Agents with Information-Flow Control. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Necula, G.C. (1997). Proof-Carrying Code. Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM Digital Library.","DOI":"10.1145\/263699.263712"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Groth, J. (2016). On the Size of Pairing-Based Non-interactive Arguments. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2016, Springer.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., and Shacham, H. (2009). Randomizable Proofs and Delegatable Anonymous Credentials. Proceedings of the Advances in Cryptology (CRYPTO), Springer.","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Vitto, G., and Biryukov, A. (2022). Dynamic Universal Accumulator with Batch Update over Bilinear Groups. Proceedings of the Topics in Cryptology (CT-RSA), Springer International Publishing.","DOI":"10.1007\/978-3-030-95312-6_17"},{"key":"ref_14","unstructured":"Costan, V., and Devadas, S. (2026, August 13). Intel SGX Explained. IACR Cryptology ePrint Archive, Report 2016\/086. Available online: https:\/\/eprint.iacr.org\/2016\/086."},{"key":"ref_15","unstructured":"Open Policy Agent Authors (2024). Open Policy Agent: Policy-Based Control for Cloud Native Environments, Cloud Native Computing Foundation. Available online: https:\/\/www.openpolicyagent.org\/docs."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/3649835","article-title":"Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization","volume":"8","author":"Cutler","year":"2024","journal-title":"Proc. ACM Program. Lang."},{"key":"ref_17","unstructured":"Pang, R., C\u00e1ceres, R., Burrows, M., Chen, Z., Dave, P., Germer, N., Golynski, A., Graney, K., Kang, N., and Kissner, L. (2019). Zanzibar: Google\u2019s Consistent, Global Authorization System. Proceedings of the USENIX Annual Technical Conference, Renton, WA, USA, 10\u201312 July 2019, USENIX Association."},{"key":"ref_18","unstructured":"Genesereth, M. (2015). Computational Law: The Cop in the Backseat, CodeX: The Stanford Center for Legal Informatics, Stanford University. White paper."},{"key":"ref_19","unstructured":"South, T., Marro, S., Hardjono, T., Mahari, R., Whitney, C.D., Greenwood, D., Chan, A., and Pentland, A. (2025). Authenticated Delegation and Authorized AI Agents. arXiv."},{"key":"ref_20","unstructured":"Sporny, M., Thibodeau, T., Herman, I., Cohen, G., and Jones, M.B. (W3C Recommendation, 2025). Verifiable Credentials Data Model v2.0, W3C Recommendation."},{"key":"ref_21","unstructured":"Stantchev, V. (2026). Hardening x402: PII-Safe Agentic Payments via Pre-Execution Metadata Filtering. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Chan, A., Salganik, R., Markelius, A., Pang, C., Rajkumar, N., Krasheninnikov, D., Langosco, L., He, Z., Duan, Y., and Carroll, M. (2023). Harms from Increasingly Agentic Algorithmic Systems. Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency (FAccT \u201923), ACM Digital Library.","DOI":"10.1145\/3593013.3594033"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Appel, A.W., and Felten, E.W. (1999). Proof-Carrying Authentication. Proceedings of the ACM Conference on Computer and Communications Security (CCS), ACM Digital Library.","DOI":"10.1145\/319709.319718"},{"key":"ref_24","unstructured":"Kalodner, H., Goldfeder, S., Chen, X., Weinberg, S.M., and Felten, E.W. (2018). Arbitrum: Scalable, Private Smart Contracts. Proceedings of the USENIX Security Symposium, Baltimore, MD, USA, 15\u201317 August 2018, USENIX Association."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., and Virza, M. (2014). Scalable Zero Knowledge via Cycles of Elliptic Curves. Proceedings of the Advances in Cryptology (CRYPTO), Santa Barbara, CA, USA, 17\u201321 August 2014, Springer.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zhao, J., Setty, S., Cui, W., and Zaverucha, G. (2025). MicroNova: Folding-Based Arguments with Efficient (On-Chain) Verification. Proceedings of the IEEE Symposium on Security and Privacy (S&P), IEEE.","DOI":"10.1109\/SP61157.2025.00168"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rosenberg, M., White, J., Garman, C., and Miers, I. (2023). zk-creds: Flexible Anonymous Credentials from zkSNARKs and Existing Identity Infrastructure. Proceedings of the IEEE Symposium on Security and Privacy (S&P), IEEE.","DOI":"10.1109\/SP46215.2023.10179430"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Camenisch, J., Dubovitskaya, M., Lysyanskaya, A., Reyzin, L., Samelin, K., and Yakoubov, S. (2017). Accumulators with Applications to Anonymity-Preserving Revocation. Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P), IEEE.","DOI":"10.1109\/EuroSP.2017.13"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/365230.365252","article-title":"Programming Semantics for Multiprogrammed Computations","volume":"9","author":"Dennis","year":"1966","journal-title":"Commun. ACM"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/PROC.1975.9939","article-title":"The Protection of Information in Computer Systems","volume":"63","author":"Saltzer","year":"1975","journal-title":"Proc. IEEE"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The Knowledge Complexity of Interactive Proof Systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., and Parno, B. (2010). Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. Proceedings of the Advances in Cryptology\u2014CRYPTO 2010, Springer.","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"ref_33","first-page":"633","article-title":"Accountable Algorithms","volume":"165","author":"Kroll","year":"2017","journal-title":"Univ. Pa. Law Rev."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"7572","DOI":"10.1109\/TIFS.2025.3587182","article-title":"FDAAC-CR: Practical Delegatable Attribute-Based Anonymous Credentials with Fine-Grained Delegation Management and Chainable Revocation","volume":"20","author":"Xie","year":"2025","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_35","unstructured":"Levy, H.M. (1984). Capability-Based Computer Systems, Digital Press."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Blaze, M., Feigenbaum, J., and Lacy, J. (1996). Decentralized Trust Management. Proceedings of the IEEE Symposium on Security and Privacy, IEEE.","DOI":"10.1109\/SECPRI.1996.502679"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1145\/155183.155225","article-title":"A Calculus for Access Control in Distributed Systems","volume":"15","author":"Abadi","year":"1993","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Hardt, D. (2012). The OAuth 2.0 Authorization Framework, Internet Engineering Task Force. RFC 6749.","DOI":"10.17487\/rfc6749"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., and Raykova, M. (2013). Pinocchio: Nearly Practical Verifiable Computation. Proceedings of the 2013 IEEE Symposium on Security and Privacy, IEEE.","DOI":"10.1109\/SP.2013.47"},{"key":"ref_40","unstructured":"Bowe, S., Grigg, J., and Hopwood, D. (2026, August 13). Recursive Proof Composition without a Trusted Setup. IACR Cryptology ePrint Archive, Report 2019\/1021. Available online: https:\/\/eprint.iacr.org\/2019\/1021."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., and Shacham, H. (2004). Short Group Signatures. Proceedings of the Advances in Cryptology (CRYPTO), Springer.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Benaloh, J., and de Mare, M. (1993). One-Way Accumulators: A Decentralized Alternative to Digital Signatures. Proceedings of the Advances in Cryptology (EUROCRYPT), Springer.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Camenisch, J., and Lysyanskaya, A. (2002). Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. Proceedings of the Advances in Cryptology (CRYPTO), Springer.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Acar, T., and Nguyen, L. (2011). Revocation for Delegatable Anonymous Credentials. Proceedings of the Public Key Cryptography (PKC), Springer.","DOI":"10.1007\/978-3-642-19379-8_26"},{"key":"ref_45","unstructured":"Sahu, N., Gajera, M., and Chaudhary, A. (2023). zkFi: Privacy-Preserving and Regulation Compliant Transactions Using Zero Knowledge Proofs. arXiv."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"100176","DOI":"10.1016\/j.bcra.2023.100176","article-title":"Blockchain Privacy and Regulatory Compliance: Towards a Practical Equilibrium","volume":"5","author":"Buterin","year":"2024","journal-title":"Blockchain Res. Appl."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., and Carbone, M. (2008). Multiparty Asynchronous Session Types. Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM Digital Library.","DOI":"10.1145\/1328438.1328472"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., and Waters, B. (2013). Witness Encryption and Its Applications. Proceedings of the ACM Symposium on Theory of Computing (STOC), ACM Digital Library.","DOI":"10.1145\/2488608.2488667"},{"key":"ref_49","unstructured":"Dock Network (2026, August 13). vb_accumulator: Pairing-Based Universal (Non-)Membership Accumulator with Batch Witness Update. Rust Crate, 2023. Available online: https:\/\/crates.io\/crates\/vb_accumulator."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Choong, T.W., Hsieh, W.B., and Leu, J.S. (2026). CapChain: A Capability-Token Access Control Architecture with Verifiable Provenance for Multi-Agent LLM Systems. Appl. Sci., 16.","DOI":"10.3390\/app16157776"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","article-title":"Hyperproperties","volume":"18","author":"Clarkson","year":"2010","journal-title":"J. Comput. Secur."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/18\/8\/437\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T08:22:16Z","timestamp":1787300536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/18\/8\/437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,16]]},"references-count":51,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,8]]}},"alternative-id":["fi18080437"],"URL":"https:\/\/doi.org\/10.3390\/fi18080437","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,16]]}}}