Search papers, labs, and topics across Lattice.
This paper introduces a verifiable global event timeline for agentic commerce, addressing the lack of interoperable auditability and temporal ordering in existing protocols. By integrating canonical event schemas, deterministic batch formation, Merkle-based commitments, and blockchain anchoring, the authors create a robust framework that ensures tamper-evident and reproducible event verification. Empirical results from their prototype show significant performance improvements, including a 14.4x speedup in verification processes compared to traditional methods, highlighting the framework's efficiency and reliability.
A groundbreaking framework for agentic commerce achieves 14.4x faster event verification while ensuring tamper-evident auditability across diverse domains.
Agentic commerce protocols such as AP2 and ACP define mechanisms for secure agent-initiated transactions but do not provide interoperable, tamper-evident auditability or verifiable temporal ordering of events across heterogeneous domains. This paper addresses these gaps by proposing a verifiable global event timeline for agentic commerce, constructed from four core components: canonical event schemas that enforce deterministic serialization, deterministic batch formation ensuring reproducible ordering without reliance on synchronized clocks, Merkle-based append-only commitments providing logarithmic-cost inclusion proofs, and blockchain anchoring establishing a tamper-evident temporal backbone. Building on this infrastructure, we introduce a cryptographically signed fraud marker that binds risk labels to anchored evidence through an unforgeable provenance chain, and a dataset lineage model enabling reproducible, tamper-evident AI training pipelines. Empirical results from a prototype implementation demonstrate: Merkle tree construction processes 50,000 events in 47 milliseconds; end-to-end verification completes in under 0.013 milliseconds regardless of batch size; inclusion proof sizes grow logarithmically from 320 bytes at 1,000 events to 512 bytes at 50,000 events; and Merkle-based verification outperforms linear scan by 14.4x at 50,000 events.
