A General Methodology for AI-Assisted, Evidence-Based and Cryptographically Verifiable Conditional Payment Systems

Preprint (10 pages). A conditional payment releases money only if an agreed event occurred, but today a third party cannot check afterwards why the money moved. This paper presents a methodology that splits such a system into three planes of unequal authority: custody (holds the funds), a deterministic decision function evaluated over signed evidence and signed reception receipts, and an advisory plane (language model and risk scorer) with no write access to the decision. Each outcome is exported as a signed proof package that an independent program replays offline. We define the evidence model, a bounded condition language and the decision function, and prove release, termination and non-interference properties. A reference implementation (AURIX) runs over a payment provider’s authorise/capture/void operations and a BFT ledger. Testing it with random differential testing (20,000 orders, Python vs JavaScript) and exhaustive single-bit corruption of proof packages (192,880 trials) exposed three defects, which we describe and correct. On PaySim, under a time-ordered protocol, a calibrated logistic regression reaches a test PR-AUC of 0.973 (95% CI 0.967–0.978) and gradient boosting is rejected for instability across seeds. The method establishes who attested an event, not that the event happened. Code, experiment scripts and raw results: https://github.com/joeylukoji/Aurix (research/paper).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24162169
Primary Topic
Blockchain Technology Applications and Security
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A General Methodology for AI-Assisted, Evidence-Based and Cryptographically Verifiable Conditional Payment Systems

Jayasri Meiyanathan
Zenodo (CERN European Organization for Nuclear Research)
Blockchain Technology Applications and Security
preprint

A General Methodology for AI-Assisted, Evidence-Based and Cryptographically Verifiable Conditional Payment Systems

Jayasri Meiyanathan
preprint en

Abstract

Preprint (10 pages). A conditional payment releases money only if an agreed event occurred, but today a third party cannot check afterwards why the money moved. This paper presents a methodology that splits such a system into three planes of unequal authority: custody (holds the funds), a deterministic decision function evaluated over signed evidence and signed reception receipts, and an advisory plane (language model and risk scorer) with no write access to the decision. Each outcome is exported as a signed proof package that an independent program replays offline. We define the evidence model, a bounded condition language and the decision function, and prove release, termination and non-interference properties. A reference implementation (AURIX) runs over a payment provider’s authorise/capture/void operations and a BFT ledger. Testing it with random differential testing (20,000 orders, Python vs JavaScript) and exhaustive single-bit corruption of proof packages (192,880 trials) exposed three defects, which we describe and correct. On PaySim, under a time-ordered protocol, a calibrated logistic regression reaches a test PR-AUC of 0.973 (95% CI 0.967–0.978) and gradient boosting is rejected for instability across seeds. The method establishes who attested an event, not that the event happened. Code, experiment scripts and raw results: https://github.com/joeylukoji/Aurix (research/paper).

Zenodo (CERN European Organization for Nuclear Research)
Peace, justice, and strong institutions
Blockchain Technology Applications and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon