On the Foundations of Trustworthy Artificial Intelligence
arXiv cs.AI / 3/27/2026
💬 OpinionDeveloper Stack & InfrastructureIdeas & Deep AnalysisModels & Research
Key Points
- The paper argues that platform-deterministic inference is both necessary and sufficient to achieve trustworthy AI, formalizing this claim as the “Determinism Thesis.”
- It introduces “trust entropy” to measure the cost of non-determinism and derives an exact relationship between verification failure probability and entropy (verification failure probability = 1 − 2^{-H_T}).
- The authors claim a “Determinism-Verification Collapse,” stating that when determinism holds, verification can be reduced to O(1) hash comparisons, while non-determinism leads to an intractable membership problem for verifiers.
- They show that standard IEEE 754 floating-point arithmetic violates determinism, and propose a pure integer inference engine designed to produce bitwise-identical outputs across ARM and x86.
- In reported cross-architecture and geographically distributed tests (including on-chain attestations), the integer engine produced zero hash mismatches on models up to 6.7B parameters, concluding that AI trust ultimately depends on arithmetic-level determinism.
広告
Related Articles
![[Boost]](/_next/image?url=https%3A%2F%2Fmedia2.dev.to%2Fdynamic%2Fimage%2Fwidth%3D800%252Cheight%3D%252Cfit%3Dscale-down%252Cgravity%3Dauto%252Cformat%3Dauto%2Fhttps%253A%252F%252Fdev-to-uploads.s3.amazonaws.com%252Fuploads%252Fuser%252Fprofile_image%252F3618325%252F470cf6d0-e54c-4ddf-8d83-e3db9f829f2b.jpg&w=3840&q=75)
[Boost]
Dev.to

Managing LLM context in a real application
Dev.to

Got My 39-Agent System Audited Live. Here's What the Maturity Scorecard Revealed.
Dev.to

OpenAI Killed Sora — Here's Your 10-Minute Migration Guide (Free API)
Dev.to

Switching my AI voice agent from WebSocket to WebRTC — what broke and what I learned
Dev.to