Metraipolis › archive › dc_f2b96ea7a3a2

The Acknowledgment Point Is the System: Durable Policy-Decision Receipts for AI Audit Evidence — arXiv:2608.17176

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17176
License (as archived)
CC0-1.0
Archived
2026-10-18T14:29:13.237Z
SHA-256 of the archived text
0f930fe0d018ef89c7473b8a65bfbe56ea4316747cea029370abca43d8d527e0
Stable URL of this page
https://metraipolis.com/documento/dc_f2b96ea7a3a2

How to cite

The Acknowledgment Point Is the System: Durable Policy-Decision Receipts for AI Audit Evidence — arXiv:2608.17176 — arXiv (en), https://arxiv.org/abs/2608.17176 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2b96ea7a3a2 (Metraipolis archive dc_f2b96ea7a3a2, sha256 0f930fe0d018ef89c7473b8a65bfbe56ea4316747cea029370abca43d8d527e0)
BibTeX
@misc{dcf2b96ea7a3a2,
  title = {The Acknowledgment Point Is the System: Durable Policy-Decision Receipts for AI Audit Evidence — arXiv:2608.17176},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17176},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2b96ea7a3a2; sha256 0f930fe0d018ef89c7473b8a65bfbe56ea4316747cea029370abca43d8d527e0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17176. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

An AI audit record is useful only if its durability and trust boundary are explicit. Returning a guarded decision before any durable write minimizes latency, but it cannot guarantee that evidence survives an immediate crash. We rebuild RuntimeGuard-AI around this constraint. The resulting research prototype binds each deterministic policy decision to the exact policy source, commits a privacy-minimizing record at a caller-selected synchronization boundary, and returns an Ed25519-signed receipt that states whether that boundary completed. After restart, the engine validates framed records, manifests, shard placement, sequence continuity, and replay identity. A separate attestation path groups committed records into chained, signed Merkle epochs that an auditor verifies with an externally obtained key. On an Apple M4 Pro at four worker threads and 2,048-byte prompts, buffered signed evidence reaches 27,193 requests/s with 141.9 microseconds median latency. Per-record data and full synchronization reduce throughput to approximately 242 requests/s and raise median latency to 16.0 ms. Sealing a 100,000-record signed epoch takes 97.0 ms. The result is a measured durability-latency trade-off, not a "free" asynchronous audit path. The prototype does not prove model execution, prevent a compromised signer from forking history, or establish legal conformity.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.AI).
Categorie arXiv: Cryptography and Security (cs.CR) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.17176 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:27:54.381Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).