#cryptographic-proofs News & Analysis

4 articles tagged with #cryptographic-proofs. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

4 articles

AI × CryptoBullisharXiv – CS AI · Jun 117/10

🤖

\texttt{Range-Arithmetic}: Verifiable Deep Learning Inference on an Untrusted Party

Researchers introduce Range-Arithmetic, a novel framework enabling efficient verification of deep neural network inference performed by untrusted parties without re-execution. The method converts non-arithmetic operations into verifiable arithmetic steps using sum-check protocols, reducing computational overhead for both verification and inference while maintaining compatibility with blockchain-based proof systems.

AI × CryptoNeutralarXiv – CS AI · Mar 127/10

🤖

Tool Receipts, Not Zero-Knowledge Proofs: Practical Hallucination Detection for AI Agents

Researchers propose NabaOS, a lightweight verification framework that detects AI agent hallucinations using HMAC-signed tool receipts instead of zero-knowledge proofs. The system achieves 94.2% detection accuracy with <15ms verification time, compared to cryptographic approaches that require 180+ seconds per query.

GeneralNeutralarXiv – CS AI · Jun 96/10

📰

Trustworthy Smart Fabs via Professional Proxies: Scaling Safe and Sustainable by Design (SSbD) through Industrial Data Spaces

Researchers propose a zero-trust framework using AI-powered 'Professional Proxies' and hardware-isolated trust zones to help semiconductor manufacturers comply with EU sustainability regulations while protecting proprietary data. The approach enables factories to generate cryptographically signed compliance tokens without exposing manufacturing secrets, addressing a growing governance bottleneck across advanced chip production.

AINeutralarXiv – CS AI · Mar 37/106

🧠

Verifier-Bound Communication for LLM Agents: Certified Bounds on Covert Signaling

Researchers present CLBC, a new protocol to prevent AI language model agents from hiding coordination in seemingly compliant messages. The system uses verifier-bound communication where messages must pass through a small verifier with proof-bound envelopes to be admitted to transcript state.