zkARc: Succinctly Verifiable Proofs for Neurosymbolic Natural Language Formalization and Verification
Today, the only evidence that a policy was enforced on an agent action is a log written by the same system that ran the agent, so a counterparty must trust the operator, re-run the check, or read the confidential policy. zkARc specifies a receipt that removes all three. Each stage of the check, from translating a plain-English policy into formal logic to the solver verdict, gets its own zero-knowledge proof, bound together so none can be swapped. A verifier confirms the check ran on the exact action received, against the authorized policy, before release, while the policy, model weights, and inputs stay hidden. Co-authored with the Amazon Web Services team behind Automated Reasoning checks. Preprint available on request.