On the Foundations of Trustworthy Artificial Intelligence
arXiv SecurityArchived Mar 27, 2026✓ Full text saved
arXiv:2603.24904v1 Announce Type: cross Abstract: We prove that platform-deterministic inference is necessary and sufficient for trustworthy AI. We formalize this as the Determinism Thesis and introduce trust entropy to quantify the cost of non-determinism, proving that verification failure probability equals 1 - 2^{-H_T} exactly. We prove a Determinism-Verification Collapse: verification under determinism requires O(1) hash comparison; without it, the verifier faces an intractable membership pr
Full text archived locally
✦ AI Summary· Claude Sonnet
Computer Science > Artificial Intelligence
[Submitted on 26 Mar 2026]
On the Foundations of Trustworthy Artificial Intelligence
TJ Dunham
We prove that platform-deterministic inference is necessary and sufficient for
trustworthy AI. We formalize this as the Determinism Thesis and introduce trust
entropy to quantify the cost of non-determinism, proving that verification failure
probability equals 1 - 2^{-H_T} exactly. We prove a Determinism-Verification
Collapse: verification under determinism requires O(1) hash comparison; without it,
the verifier faces an intractable membership problem. IEEE 754 floating-point
arithmetic fundamentally violates the determinism requirement. We resolve this by
constructing a pure integer inference engine that achieves bitwise identical output
across ARM and x86. In 82 cross-architecture tests on models up to 6.7B parameters,
we observe zero hash mismatches. Four geographically distributed nodes produce
identical outputs, verified by 356 on-chain attestation transactions. Every major
trust property of AI systems (fairness, robustness, privacy, safety, alignment)
presupposes platform determinism. Our system, 99,000 lines of Rust deployed across
three continents, establishes that AI trust is a question of arithmetic.
Comments: 26 pages, 10 tables, 1 figure, 17 theorems/definitions/corollaries
Subjects: Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR)
Cite as: arXiv:2603.24904 [cs.AI]
(or arXiv:2603.24904v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2603.24904
Focus to learn more
Submission history
From: Theodore Dunham [view email]
[v1] Thu, 26 Mar 2026 00:37:14 UTC (535 KB)
Access Paper:
view license
Current browse context:
cs.AI
< prev | next >
new | recent | 2026-03
Change to browse by:
cs
cs.CR
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)