Execution-Finality Under Test: A Reproducible Comparison of Five Payment Authorization Architectures with 96 Automated Tests - Das Architectures

Adversarial Payment Substitution, Sink-Side Verification, Conventional Security Controls, and Falsifiable Engineering Claims Authentication and upstream authorization do not necessarily prevent a consequential operation from being altered before execution. This research presents a reproducible, controlled comparison of five payment-authorization architectures: session-only authentication, upstream operation binding without final verification, an incorrectly positioned cryptographic candidate check, a conventional transactional resource server, and a DAS-inspired Finality Sink. The experiment evaluates 13 scenarios across five architectures, producing 65 recorded observations. The accompanying Python reference implementation successfully executes 96 automated tests. Deliberately incomplete authorization designs permit 32 unauthorized mock effects, including beneficiary substitution, transaction-parameter modification, stale authorization, and replay. Both the DAS-inspired Finality Sink and a strongly implemented conventional transactional resource server reject all 12 modeled unauthorized scenarios while permitting the valid transaction. The results demonstrate the importance of verifying the actual pending operation at the effective enforcement boundary. They do not establish that execution-time verification is exclusive to DAS or absent from existing technology. The study examines OAuth Rich Authorization Requests (RFC 9396), DPoP (RFC 9449), RATS (RFC 9334), policy-enforcement gateways, distributed authorization, and transactional enforcement as relevant existing mechanisms. It identifies open research questions concerning independently protected authority, trustworthy final-operation observation, non-bypassable enforcement, durable state, and cross-system consistency. All payment effects are simulated; no real financial transactions occur. The publication includes runnable source code, reproducibility instructions, adversarial findings, and a protocol for independent security evaluation. GitHub Reference Implementation: https://github.com/sangmdas/DAS-Execution-Finality-Controlled-Comparison

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-27
DOI
https://doi.org/10.5281/zenodo.23692786
Primary Topic
Access Control and Trust
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Execution-Finality Under Test: A Reproducible Comparison of Five Payment Authorization Architectures with 96 Automated Tests - Das Architectures

Sangam Das
2 links
Zenodo (CERN European Organization for Nuclear Research)
Access Control and Trust
article

Execution-Finality Under Test: A Reproducible Comparison of Five Payment Authorization Architectures with 96 Automated Tests - Das Architectures

Sangam Das
article en

Abstract

Adversarial Payment Substitution, Sink-Side Verification, Conventional Security Controls, and Falsifiable Engineering Claims Authentication and upstream authorization do not necessarily prevent a consequential operation from being altered before execution. This research presents a reproducible, controlled comparison of five payment-authorization architectures: session-only authentication, upstream operation binding without final verification, an incorrectly positioned cryptographic candidate check, a conventional transactional resource server, and a DAS-inspired Finality Sink. The experiment evaluates 13 scenarios across five architectures, producing 65 recorded observations. The accompanying Python reference implementation successfully executes 96 automated tests. Deliberately incomplete authorization designs permit 32 unauthorized mock effects, including beneficiary substitution, transaction-parameter modification, stale authorization, and replay. Both the DAS-inspired Finality Sink and a strongly implemented conventional transactional resource server reject all 12 modeled unauthorized scenarios while permitting the valid transaction. The results demonstrate the importance of verifying the actual pending operation at the effective enforcement boundary. They do not establish that execution-time verification is exclusive to DAS or absent from existing technology. The study examines OAuth Rich Authorization Requests (RFC 9396), DPoP (RFC 9449), RATS (RFC 9334), policy-enforcement gateways, distributed authorization, and transactional enforcement as relevant existing mechanisms. It identifies open research questions concerning independently protected authority, trustworthy final-operation observation, non-bypassable enforcement, durable state, and cross-system consistency. All payment effects are simulated; no real financial transactions occur. The publication includes runnable source code, reproducibility instructions, adversarial findings, and a protocol for independent security evaluation. GitHub Reference Implementation: https://github.com/sangmdas/DAS-Execution-Finality-Controlled-Comparison

Zenodo (CERN European Organization for Nuclear Research)
Peace, justice, and strong institutions
Openalex Percentile: Top 6%
Access Control and Trust
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