Blockchain Papers

Nevin Oommen, Atharva Naitam, Ayush Kshirsagar, Atharva Bhede · 5 authors

No abstract is available for this record.

E. Onofri, Andrea Ciccotelli, Roberto Di Pietro

Oblivious Transfer (OT) is a fundamental cryptographic primitive enabling privacy-preserving computation and constitutes a core building block for secure multi-party computation while supporting a wide range of security-sensitive applications: private information retrieval, zero-knowledge proofs, and password-authenticated key exchange, to cite a few. While recent advances in OT extension have significantly reduced amortised costs, their reliance on batches of random base OTs and substantial pre-computation phases limits their practicality in scenarios where the number of transfers is modest or where communication latency and client-side computation are critical constraints. In such settings, efficient base OT protocols remain both relevant and necessary. In this work, we introduce $I$-$(OT)^2$, a novel base 1-out-of-2 OT protocol grounded in the quadratic residuosity problem, specifically designed to minimise receiver-side computation and interaction. Our construction is particularly appealing on client--server architectures in which the receiver operates on low-power hardware, such as Internet of Things (IoT) devices. Through a lightweight offline pre-computation phase, $I$-$(OT)^2$ shifts the on-transfer computational burden almost entirely to the Sender, while reducing online communication to only six messages and four digests exchanged. We provide a detailed description of the protocol, accompanied by a formal proof of its security. Moreover, to demonstrate the viability of $I$-$(OT)^2$, we also present an open-source proof-of-concept implementation (in C language) evaluated on real IoT hardware. Results are staggering: for 128-bit security using a 3072-bit RSA modulus, the receiver incurs an average online cost per OT as low as 2.80 μs on desktop platforms and 39.90 μs on IoT devices, more than 10$\times$ faster than the well known SimplestOT.

André Schrottenloher

Shor's algorithm represents the main threat of quantum computers to cryptography. In order to precisely understand its feasibility, many authors have worked towards reducing its costs, either at the logical level (assuming a fault-tolerant architecture), or at the physical level (taking into account the constraints of envisioned hardware). In particular, recent works by Chevignard et al. (CRYPTO 2024) and Gidney (arXiv 2025) used improved arithmetic to significantly reduce the qubit cost of factoring RSA public keys. Even more recently, Babbush et al. (arXiv 2026) improved the cost of computing elliptic curve discrete logarithms, with a reduction of a factor 2 to 3 in gate count and qubit count compared to a previous work by Litinski (arXiv 2023). Their result relies on optimized point addition circuits on elliptic curves over prime fields. However they did not reveal their logical quantum circuits, relying instead on a zero-knowledge proof. In this paper, we detail a quantum logical circuit architecture which gives similar results as Babbush et al., with a slightly higher number of qubits (around 1.5% increase) and a slightly smaller Toffoli gate count (between 6.5% and 10% reduction) for the curve secp256k1. We also give gate counts for a generic variant of the circuit, which is valid for any prime field.

Wenpeng Guo, Yujie Wan, Shaojie Yuan, Lin Chang · 6 authors

No abstract is available for this record.

Doaa Mohammed Abdul Rahman

Background and Gap Information: Positive, negative and hybrid external confirmation processes are the pillars of audit evidence as posed in the standard ISA 505, however the response rate is very low 48-72%, fraud is not detected 12-38% and there is an unresolvable conflict between assurance and data privacy. This “auditor’s dilemma” intensifies with cross-border transactions and tight data privacy regulations such as Iraq’s Personal Data Protection Law No. 10 of 2024. Although there are recent proposals based on blockchain or homomorphic encryption, none of them has presented a mathematically zero-knowledge, empirically verified, and regulatorily compliant confirmation protocol that seamlessly performs over heterogeneous ERP systems without leaking its underlying commercial data. Objective: We present the Decentralized Confirmation Matrix (DCM) - a game-changing evidence of audit protocol based on zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) to cryptographically prove a set of external transactions, while leaking only the fact that they are consistent (“valid/invalid”) together with a timestamp. The paper (1) details the DCM design, including its novel dual-nullifier and heterogeneous trust models; (2) presents an empirical comparison of DCM with traditional techniques based on authentic Iraqi state-owned enterprise (SOE) data; (3) scrutinizes DCM against Iraqi higher educational certification standards and Scopus Q1 repeatability requirements; and (4) delivers an open-source route-to-implementation (ZKCaaS). Methodology: We developed a complete DCM prototype using Circom 2.1.6 and SnarkJS over a permissioned blockchain sandbox (Iraqi National Blockchain Sandbox). 4We acquired genuine transaction logs (n=25,000+ confirmations) from three Iraqi SOEs: Northern Refineries Company (Baghdad), Basra Oil Terminal (Basra), and Iraqi Telecommunications Company (Erbil).A controlled field experiment with 45 Iraqi auditors (repeated measures, counterbalanced) was conducted to evaluate DCM vis-a-vis traditional positive and email-hybrid confirmations on response time, error rates, cost, auditor satisfaction (UTAUT2), and attack resilience. Results: DCM reduced average confirmation response time by 99.6% (to 0.05 days), attained a 100% response rate by automation, elevated fraud detection from traditional 62% to 97%, and brought in cost per confirmation (from 6% to 0.45%). Auditor satisfaction rated 4.6/5, and the dual‑nullifier scheme prevented 100% of replay and collusion attacks - a guarantee not found in any prior work. Audit risk (ISA 315) decreased by 93% (from 6% to 0.45%).Cross‑platform rollup between SAP and Oracle succeeded at 98%, solving a long‑standing interoperability ga. Conclusion: DCM is the first practical, privacy-preserving, and empirically superior external consistency checking protocol that satisfies ISA 500/505 while enabling “cryptographically sealed evidence” as a novel evidence type. The article is in line with the quality requirements of the Iraqi accreditation agency as well as Scopus Q1, which consider theoretical novelty, empirical rigour and open‑source replicability. We propose a strategic vision for 2025-2030 and an Autonomous Audit Agent (AAA) for full automation.

S. Hirata, Yoshihiro Kawahara

No abstract is available for this record.

Vedat Coşkun, Sertac Anadollu, Büşra Özdeni̇zci̇ Köse

No abstract is available for this record.

Lizhe Liu, Weijie Tan, Shutong Lv, Huan Zhuang · 6 authors

In the Internet of Vehicles (IoV), the large-scale deployment of smart vehicles has triggered new road traffic safety challenges. Particularly, existing vehicle accident report transmission schemes still face challenges such as privacy leakage, Single Point of Failure(SPOF), physical cloning attacks, and excessive computational overhead. To address these issues, this paper proposes a secure accident report transmission scheme that uses Non-Interactive Zero-Knowledge Proof (NIZKP) and Physically Unclonable Functions (PUF). This paper designs a decentralized authentication scheme for vehicle registration that prevents SPOF and privacy leakage. We also use the PUF to realize two-factor authentication login, which effectively resists physical cloning attacks. In addition, the authentication process uses NIZKP based on the Pedersen commitment to realize authentication for accident report coordination. At the end of the accident report coordination, it is passed into the blockchain for storage, realizing the secure transmission of accident reports. To reduce the storage as well as computation overhead, this paper uses a key derivation function to update the key. Finally, formal security analysis was conducted using the Real or Random (ROR) model and the ProVerif tool, the results prove that the proposed protocol meets security requirements. Comparing our proposed scheme with related schemes, the computational overhead of our V2V scheme is reduced by 42.4%, with higher security and lower communication overhead.

Kasi Viswanath kommana

No abstract is available for this record.

Ch Sree Kumar, Jatindra Kumar Dash, K. Hemant Kumar Reddy

Blockchain-enabled healthcare infrastructures demand latency-aware, privacy-preserving, and scalable transaction management due to the stochastic and high-volume nature of clinical data processing in decentralized environments. In this study, we propose a blockchain-aware Modified M/M/C (Mo M/M/C) queueing framework specifically designed for NFT-enabled healthcare systems integrated with Zero-Knowledge Proof (ZKP)-based verification. Unlike classical queueing models that assume single-stage service, the proposed model incorporates a multi-stage transaction pipeline consisting of medical processing, NFT tokenization, ZKP verification, and blockchain validation. Accordingly, an effective service rate formulation and blockchain-adjusted arrival rate are analytically derived to capture cryptographic overhead, consensus latency, and smart contract execution delays within a unified stochastic framework. Patient records, prescriptions, and diagnostic data are securely encapsulated as NFTs to ensure immutability, traceability, and decentralized ownership, while ZKP protocols enable privacy-preserving authentication without exposing sensitive medical information. The model further integrates dynamic priority-aware scheduling and validation-aware utilization to optimize resource allocation under heterogeneous healthcare workloads. Extensive discrete-event simulations conducted over scalable transaction volumes (1,000–100,000) evaluate key performance metrics including throughput, average waiting time, system response time, and latency. The results demonstrate that the proposed Mo M/M/C framework significantly improves queue stability, reduces congestion, and enhances throughput compared to FIFO, LIFO, SIRO, and standard M/M/C models. Overall, the revised framework provides a mathematically grounded, cryptography-aware, and blockchain-consistent solution for secure and real-time healthcare transaction management

Ndumiso Zondi, Stacey Baror, Sheunesu Makura, Hein Venter

Centralised digital identity management systems create single points of failure and weaken user control over sensitive data, particularly in financial services. We designed and built RandX, an ERC-20 token that gates mint, transfer, and burn operations to addresses with verifiable credentials. Requirements drawn from self-sovereign identity (SSI) and AML/KYC literature led to a modular architecture for identity, user management, token logic, and governance. Solidity contracts were implemented with a React/MetaMask dApp. End-to-end tests confirm verified users transact successfully while unverified attempts revert. Average gas costs were approximately 0.0008 ETH per token operation and 0.0014 ETH for identity verification. We note issuer centrality and propose multisig governance and zero-knowledge proofs as next steps.

Febriana Nur Aini, Manda Fatimah Azaziah, Muhammada Rifki Iqbal Ghufron, Muhammad Dava Khoirur Roziqy · 5 authors

Penyimpanan informasi sensitif pada aplikasi catatan digital menimbulkan tantangan terkait keamanan dan privasi data pengguna. Sebagian besar sistem penyimpanan konvensional masih memberikan akses terhadap data yang disimpan pada sisi backend, sehingga meningkatkan risiko kebocoran informasi apabila terjadi kompromi sistem. Penelitian ini bertujuan untuk merancang dan mengimplementasikan aplikasi web Secret Ink dengan mengintegrasikan algoritma Advanced Encryption Standard (AES) 256-bit dan prinsip Zero-Knowledge sebagai mekanisme perlindungan data. Metode penelitian yang digunakan meliputi analisis kebutuhan, perancangan arsitektur keamanan, implementasi sistem menggunakan teknologi berbasis JavaScript, serta pengujian fungsionalitas dan keamanan aplikasi. Hasil penelitian menunjukkan bahwa proses enkripsi dan dekripsi dapat dilakukan pada sisi pengguna, sementara backend hanya menerima dan menyimpan data dalam bentuk ciphertext. Pengujian keamanan juga menunjukkan bahwa sistem mampu memitigasi ancaman umum aplikasi web, seperti Cross-Site Request Forgery (CSRF), Cross-Site Scripting (XSS), dan SQL Injection. Dengan demikian, Secret Ink berhasil menyediakan mekanisme penyimpanan catatan digital yang mampu menjaga kerahasiaan dan privasi data pengguna melalui penerapan AES-256 dan arsitektur Zero-Knowledge

Hassan Touheed

Foundational agent interoperability standards, notably the Agent-to-Agent (A2A) protocol and the Model Context Protocol (MCP), have advanced multi-agent system communication, and complementary identity frameworks leveraging W3C Decentralised Identifiers (DIDs) and Verifiable Credentials (VCs) provide cryptographic agent authentication. However, no existing protocol supports content-based semantic routing of agent payloads across organisational trust boundaries without requiring the routing intermediary to decrypt the payload, which is a hard constraint in compliance-sensitive environments governed by GDPR, HIPAA, and MiFID II. We propose SS-ZKR, a three-mechanism privacy-preserving routing protocol designed as a complementary layer atop A2A/MCP. Mechanism I introduces blind routing via differentially private semantic intent vectors cryptographically bound to zero-knowledge proofs of payload-schema consistency. Mechanism II offers vector-weighted adaptive payload sanitisation with formal (epsilon, delta)-differential privacy for numerical fields and heuristic semantic aggregation for textual fields. Mechanism III presents a spatial-to-cryptographic policy compiler that translates visually defined trust-zone topologies into deterministic zero-knowledge access circuits. We provide a formal threat model, analyse information leakage bounds of intent vectors, present pseudocode for all three mechanisms, and give analytical complexity comparisons against TEE-based and homomorphic encryption-based routing baselines. SS-ZKR lets enterprises in financial services, healthcare, and defence orchestrate heterogeneous AI agents across regulatory boundaries without exposing proprietary data to routing infrastructure.

Farman Guliyev

This document serves as the official Executive Summary and reflexive analysis of the BeTrueCore decentralized collective intelligence protocol (Modular System v1.2). The text provides a rigorous interdisciplinary overview at the intersection of Web3 architecture, Zero-Knowledge cryptography (ZK-Proofs, MACI), quantum metaphors, and the theory of scale-invariant historical singularity. Divided into six core chapters, it details the ontology, historical context, empirical analogies (including the Princeton GCP), philosophical genesis (Wabi-Sabi, Kintsugi), and the mathematical framework (Wiener differential equation) of the temporal isolation circuit.

Griff gurwell

" Overview This is a revised and extended edition of the original Leedskalnin Equation paper (Zenodo, March 2026). The original work established four independent derivations of the CTF base frequency f0=53e=10373/72=144.06944…f0=53e=10373/72=144.06944… Hz, the prime‑swapping control test identifying prime 53 as unique, the micro‑gap δ=f0−53e≈0.0005075δ=f0−53e≈0.0005075 Hz, and a 12‑emitter dodecahedral resonance simulation with watch logic and burst envelope. Those results remain unchanged and are not retracted. The new contribution of this revision is the full integration of those results into the unified Prime Lattice Coherence Theorem (PLCT) – a mathematical framework built on the 2a×3b prime lattice, the Lock‑Out Theorem, and the Partition Theorem. The lattice was developed independently after the original paper and is now applied retroactively to give every number in the original work an axiom‑level home. No numbers change; two results are promoted from observations to theorems; several new structural arithmetic facts are added. Key New Results (Not in Original) Micro‑gap as a theorem, not an observationThe Lock‑Out Theorem proves that f0=10373/72f0=10373/72 (denominator 72=23×3272=23×32) is Tier‑1 (primes {2,3}{2,3}) and therefore maintains zero accumulated drift D(x,B)=0D(x,B)=0 at all scales. The expression 53e53e introduces the Tier‑4 prime 53 (outside {2,3,5}{2,3,5}), which necessarily produces unbounded logarithmic drift. A Tier‑1 rational cannot equal a Tier‑4 transcendental; hence δ>0δ>0 is mathematically forced. The gap is no longer merely a “physical tolerance” – it is a structural necessity of the prime lattice. Triple lattice lock of prime 53Prime 53 is shown to be the unique prime satisfying three independent lattice coordinates simultaneously: Tier‑4 (prime set {53}{53} outside {2,3,5,7}{2,3,5,7}) Temporal zone (53 mod 9=8∈{2,5,8}53mod9=8∈{2,5,8}) Prime index P16P16 where 16=2416=24 is exactly the exponent of prime 2 in the spatial harmonic Λ=144=24×32Λ=144=24×32.The original prime‑swapping control test (primes 41–71) is reinterpreted as the empirical shadow of this triple lock – explaining why 53 is unique and why all other primes miss the fractional signature 1/(Pe)≈0.006941/(Pe)≈0.00694. Inscription as PLCT tier map Base‑60 = 22×3×522×3×5 – the smallest positive integer whose prime set is exactly {2,3,5}{2,3,5} (Tier‑2). The Sumerian sexagesimal system is therefore arithmetic at the coherence boundary of the lattice. Coefficients 28:15:53:15 from the decomposition 6,105,195=28×603+15×602+53×60+156,105,195=28×603+15×602+53×60+15 map to tiers T3:T2:T4:T2 and zones Hard Wall → Spine → Temporal → Spine. This sequence traces the Lock‑Out Theorem path from the Hard Wall prime P4=7P4=7 through the Tier‑2 gateway to the Temporal lock prime 53. Prime mirror 71297129 satisfies 7129 mod 144=737129mod144=73, and 7373 is one of the six Partition Theorem universal lock values L={0,1,9,64,73,81}L={0,1,9,64,73,81}. Primary inscription number 6,105,1956,105,195 is a Spine element: mod 9=0mod9=0 (Spine zone), digital root = 9, and mod 144=27=33mod144=27=33 (pure Tier‑1). Simulation parameters as Tier‑1The burst envelope 99 ON / 2727 OFF cycles are 3232 and 3333; their sum is 36=22×3236=22×32, and 36×4=144=Λ36×4=144=Λ. The ratio 9:27=1:3=P1:P29:27=1:3=P1:P2 – the ratio of the two generators of the {2,3}{2,3} lattice. The duty cycle 1/4=2−21/4=2−2 is pure Tier‑1. Prime mirror as Tier‑1/Tier‑2 ratio71292971≈14460=24×3222×3×5=12529717129≈60144=22×3×524×32=512. The mirror approximates the ratio of the spatial harmonic (Tier‑1) to the smallest Tier‑2 base. What Is New vs. What Is Unchanged Unchanged: The four independent derivations of f0f0 (recursive lock, constants survey, base‑60 decomposition, prime mirror), the prime‑swapping control test data, the 12‑emitter simulation results (mean g≈0.66g≈0.66, min g≈0.21g≈0.21), the hardware specification, and the experimental protocol. The caveat that the inscription mapping is hypothesis‑generating, not proof of intentional design, is preserved. New (this revision): The micro‑gap theorem, triple lock theorem, base‑60 tier identification, coefficient tier/zone map, lock value verification for 7129, Spine element verification for 6105195, burst envelope tier analysis, and the prime mirror tier interpretation. Also three open research directions (coefficient 28 and fine‑structure screening integer, Hard Wall–Hard Wall prime mirror structure, and the Tier‑2×Tier‑4 factorization of 6105195). Scope and Honesty The paper is explicit about what is proved (theorems marked as such) versus what is observed (numerical coincidences that await explanation) versus what is conjectural (the open research directions). No claim is made that the inscription was designed with knowledge of the prime lattice; the mapping shows structural consistency only. No claim of antigravity, time dilation, or real‑world load reduction is made – the simulation remains a toy model with a hypothetical Heaviside coupling. Reproducibility All numerical results are verified with a Python script (included in the Appendix) that uses only standard libraries (math, fractions). The script computes the micro‑gap, verifies the triple lock, checks prime sets, computes residues mod 9 and mod 144, and confirms the burst envelope arithmetic. Runtime < 5 seconds.

Hongpu Yang

This document establishes the ontological status of mathematics within the Energy-Efficiency Theory (EET) framework. Mathematics is not an independent reality standing alongside the physical world, not a pure mental construction, not an arbitrary symbolic game, not an eternal Platonic entity. Mathematics is the \textbf{structural space} within the Rule-Causal domain --- a sub-model generated by the application of the modeling rules (causality, logic, the seven operations of the Generative Grammar, MEER maximization). It constructs stably invariant formal structures under the transformational grammar provided by logic, and is continuously revised and extended in interaction with physical cognitive models. \textbf{Core Constitutional Position}: Mathematics is a sub-model generated by the modeling rules. It does not define new irreducible modeling rules; it describes the structural space that the constitutional rules of causality and logic generate. Its constitutional status is \textbf{Satellite Paper (SAT)} --- dependent on and parasitic upon the constitutional mother texts (Causality v1.7 and Logic v1.2). The Ontology of Mathematics belongs to the Cognitive Constitution. Its employment of physical-constitutional concepts (cognitive heat engine, Ben-Shi dynamics) constitutes instrumental application by a cognitive model, not constitutional dependence. \textbf{The Ultimate Engine --- Causal Arbitrage}: The pursuit of mathematical necessity is the maximal-MEER form of causal arbitrage in the virtual domain. By stipulating axioms and derivation rules (Presupposition of Cause), the cognitive system converts the high-cost, ongoing verification of physical causality into the low-cost, one-time application of symbolic consistency. Mathematical structures, once constructed, can be invoked at near-zero marginal cost to generate predictions about physical systems---the ultimate arbitrage return: temporal buffer maximized, response energy minimized. \textbf{Core Constitutional Contribution --- Completeness Feedback}: Mathematics possesses an inherent drive toward systematization. This drive leads it to systematically probe the limits of the modeling rules themselves---in consistency, completeness, decidability, and categoricity---and to feed these limits back to the rule-makers. This \textbf{Completeness Feedback} is the endogenous engine of the modeling rules' self-refinement. Mathematics is thus not merely the passive product of the modeling rules; it is the ``constitutional mirror''---the only device through which the modeling rules can see their own limitations. \textbf{Core Insight --- Rhetoric of Rupture, Operational Continuity}: What the mathematical community has historically narrated as ``crises'' were, from the constitutional perspective of the mathematics mother model, \textbf{Divides}---internal symmetric divisions that produced new structural spaces while preserving the old ones. The rupture was rhetorical; the operation was continuous. The mathematical mother model never contracts, only expands (the Principle of Elastic Expansion). \textbf{Mathematics as a Language/Symbol Protocol}: Mathematics occupies the limit endpoint of the parameter-sharing / trigger-precision trade-off (Language v1.0). It sacrifices parameter-sharing---accepting that only a tiny fraction of the population can decode its signals---to achieve near-perfect trigger precision and cross-generational transmission fidelity. Mathematical symbols are second-order externalizations: they refer not to perceptual objects but to operations on already-established distinctions. Mathematical texts are frozen operation sequences---encoded instructions for re-executing cognitive operations, not passive records of results. The decoding cost of mathematical protocol is not significantly lower than its encoding cost---mathematical knowledge cannot ``diffuse'' but must be rebuilt by each individual through the Conscious Self's active re-execution of the encoded operations. \textbf{Mathematics as a Cognitive Heat Engine}: The mathematical system operates as a cognitive heat engine (Xu-Shi v3.1) governed by the four universal laws of Ben-Shi dynamics (Ben-Shi v3.0). New axiom stipulation provides the high-Xu heat source; theorem Encapsulation is the work; encapsulated theorems form the low-Xu heat sink. The system's capacity for flexible oscillation between exploration and consolidation monotonically contracts over its lifetime (Ben-Shi Irreversibility), and its metacognitive precision decays with constraint accumulation (XQ Decay Law). Structure pathology---the accumulation of formally valid but low-MEER structures---complements the grammar pathology of logic. \textbf{Mathematical Intuition, Aesthetics, and Genius}: Platonic intuition is the phenomenological correlate of Algorithmic Submersion---Divide and Encapsulate operations hardened to invisibility through repeated successful application. Mathematical elegance is the Emotional Self's direct phenomenological readout of MEER: $\mathrm{Elegance}(P) = \text{structurally necessary conclusions} / (\text{derivation steps} \times \text{axioms and lemmas invoked})$. Mathematical genius is the precise synchronization of the Automatic Self (submerged intuitions), Emotional Self (aesthetic navigation of MEER), and Conscious Self (explicit proof audit). \textbf{Unified Resolution of Six Major Problems}:\begin{enumerate}[label=(\roman*)] \item Wigner's problem: the effectiveness of mathematics comes from joint evolution---physical and mathematical cognition share the same underlying modeling grammar and co-evolve in interaction with real space; \item Benacerraf's problem: dissolved, not resolved---mathematical cognition requires no cross-domain channel because it shares the same operational grammar with physical cognition; \item The fragmentation of foundations: set theory, category theory, and homotopy type theory are different schemes of the Presupposition of Cause, each valid within its own Root Cut boundary; \item Undecidability: the ``charter of blindspots'' of the modeling rules---the constitutional boundary of what any finite formal system can determine; \item Stratified effectiveness: the applicability of mathematics is stratified because causal compression itself is stratified; \item Platonic intuition: the first-person experience of hardened Divides---operations submerged to invisibility perceived as eternal entities.\end{enumerate} The document establishes the complete interfaces between mathematics and the EET constitutional system, articulates its own constitutional boundaries and meltdown conditions, and provides the systematic framework for understanding mathematics as both the product of the modeling rules and the driver of their self-refinement. {Keywords}: Ontology of mathematics; Rule-Causal domain; structural space; Presupposition of Cause; joint evolution; completeness feedback; causal arbitrage; Wigner's problem; MEER; virtual domain; encapsulation network; rhetoric of rupture; operational continuity; structure pathology; mathematical intuition; mathematical aesthetics; mathematical protocol; parameter-sharing / trigger-precision trade-off; frozen operation sequences; decoding cost asymmetry; elegance as cognitive operational efficiency; cognitive heat engine; Energy-Efficiency Theory

Devin Bostick

Abstract Some truths are hard to discover and easy to verify. A factorization, once found, can be checked quickly. A proof, once written, can often be verified more easily than it was discovered. A biological intervention, once stabilized, can look retrospectively obvious even though the admissible functional corridor was narrow and difficult to locate in advance. This paper examines that asymmetry. Its central claim is that generation and verification are structurally different tasks, and that the difference is often governed by a prior regime. Verification presupposes that the object being checked, the property being checked, and the admissible transformation or witness relation have already been sufficiently stabilized. Where those conditions are absent, “verification” can become shallow, local, or misapplied. Where they are present, an object that was difficult to find may become cheap to certify once presented. The paper does not claim to solve discovery in general, reduce all domains to one formalism, or extend the formal identity-persistence theorem. It is a companion argument inside the broader identity-persistence program. Its narrower aim is to show that many cases of retrospective obviousness arise when a lawful corridor is narrow in search but cheap in verification once the regime and witness relation are in place. The result is a regime-first account of discovery asymmetry across formal proof, cryptography, zero-knowledge certification, biological persistence, and regime-bound computational search.

A Doleh

Large-language-model (LLM) inference is increasingly concentrated in dedicated GPU data centres and closed API platforms, raising barriers for institutions that want to run, study, or contribute to AI infrastructure. We argue that democratizing inference requires an architecture in which smaller organizations can participate as operators, builders, and researchers rather than only as customers. We propose OpenPrism Network, an open, UMA-first distributed inference architecture in which transformer layers are statically owned by nodes so that weights remain resident and only activations transit the network; a blockchain layer is restricted to settlement, reputation, and payment and never to compute; output integrity is established by multi-node redundancy with tolerance-banded fingerprinting rather than zero-knowledge proofs; and routing is locality-aware, keeping inference within metro-area clusters. The network is explicitly scoped to batch- and throughput-oriented, latency-tolerant workloads. We describe two deployment models: a distributed mesh harvesting idle institutional capacity, and a purpose-built UMA micro data center deployable by resource-constrained organizations as a sovereign inference facility. We also describe an open participation model in which node operators, runtime implementers, benchmark maintainers, and application integrators can contribute through published interfaces and open-source reference components. This is a position and architecture paper: we claim no original experimental results, and all quantitative figures are drawn from publicly available benchmarks and published specifications, cited explicitly. We report performance per watt honestly, including the threefold cost of consensus, and find that UMA nodes lose on operational efficiency against batched data-centre GPUs in the scoped regime; the architecture's advantage is therefore established on capital in the harvested-capacity model, participation, and data sovereignty, while total cost of ownership for the purpose-built micro data center is mixed and strongly pricing-regime dependent, not universally favorable. We frame two problems as genuinely unsolved: a consensus protocol for ML output verification under floating-point non-determinism, and a dynamic layer-assignment protocol that rebalances ownership as nodes join and leave without full weight redistribution. We also state a concrete validation roadmap, including prototype scope, baselines, and evaluation metrics.

Xueyi Tang, Kexin Qiao, Qinghao Wu, Licheng Wang

Quantum computing poses significant challenges to traditional zero-knowledge proof schemes based on number-theoretic assumptions. As a result, code-based cryptography has attracted increasing attention for its resistance against quantum computing. In this paper, we study the Rank Syndrome Decoding problem (RSD) and investigate its ZK proof formulation within the MPC-in-the-Head framework. To prove the possession of a secret witness, we reformulate the secret witness as a mixed-field matrix multiplication preserving the rank constraint, and then obtain a representation that aligns naturally with the local-view paradigm of MPC-in-the-Head. Utilizing this value-to-calculation technique, we introduce the RSD relation into a ZKBoo-style (2, 3)-secret-sharing MPC-in-the-Head framework and obtain an RSD-based zero-knowledge proof scheme via mixed-field secret sharing. The resulting scheme reduces the proof size relative to generic formulations while preserving completeness, soundness, and zero-knowledge for the interactive protocol. The Fiat–Shamir non-interactive extension is analyzed only in the classical random oracle model; we do not claim QROM security for this variant.

Kai Huang

Why are mathematical conjectures—the Riemann Hypothesis, the Kakeya Conjecture, P vs NP—so extraordinarily difficult to solve? For centuries, countless mathematicians have tried to dismantle them using “manual deduction”, only to hit a wall. The author argues that the root cause is: these conjectures are inherently not “manual” but “automatic”. Behind them lies the same dynamical structure—the self‑organising evolution of an information field. Traditional mathematical tools attempt to capture a dynamic, closed‑loop feedback process with static logical chains, much like trying to drive an automatic car with a manual gearbox. This paper proposes a new cross‑disciplinary framework: Information Dynamics. Its core is the generalised Ginzburg–Landau equation, whose four operations (diffusion, anti‑diffusion, nonlinear compression, logarithmic potential) form the atomic instruction set of universal self‑organisation. By faithfully embedding this equation into the category of nonlinear automatic control, we translate the three great conjectures into standard control‑theoretic properties: Riemann Hypothesis ⇔ passivity (positive realness) of a control system; Kakeya Conjecture ⇔ zero measure of the reachable set; P vs NP ⇔ polynomial stabilisability. Significance for Physical AI:This work not only provides a new language for mathematical conjectures, but also directly gives birth to a new paradigm: Physical AI. Traditional AI (including deep learning) requires massive labelled data and backpropagation—it is “manual driving”. Physical AI, in contrast, lets the information field evolve autonomously under the GL equation toward a target state, without any training—it is “autonomous driving”. Prototype experiments, such as the prime density generator, the five‑dimensional single‑point Kakeya set, and linear‑time DNA assembly, have already validated the feasibility of this paradigm. Physical AI promises to become a general problem solver, directly handling images, video, sequences, and beyond, initiating a revolution from “computation” to “generation”. Traditional algorithms adopt a search paradigm, often with exponential complexity. Physical AI provides a control paradigm: encode the problem’s state space as an initial distribution of the information field, then let the GL equation automatically evolve as a closed‑loop feedback system towards a steady state. Information Dynamics defines the physical dynamics of information — that is, how the information field itself, as a physical entity, driven by specific laws (the generalized Ginzburg–Landau equation), spontaneously evolves from disorder to order, generating complex patterns, structures, and knowledge. It answers the question: How can orderly structures and mathematical truths emerge from the quantum vacuum? This paper is not a final proof, but a research programme that can be made rigorous. All assumptions (Hilbert–Pólya conjecture, existence of a continuous limit, etc.) are explicitly stated. Code and experimental data:The numerical experiments (prime density generation, five‑dimensional Kakeya set, DNA assembly) are distributed across several GitHub repositories of the author: Riemann Hypothesis information‑dynamics proof: https://github.com/hkaiopen/Riemann-ID Kakeya set GL construction: https://github.com/hkaiopen/Kakeya-ID DNA assembly: https://github.com/hkaiopen/ComputationalBiology-ID Because the code is scattered across multiple actively developed sub‑projects, no single archive is provided on Zenodo. Please visit the links above for the latest versions.

Konstantinos Sgantzos, Massimiliano Ferrara

Abstract As AI agents evolve into autonomous economic actors, verifiable and legally binding identity frameworks become critical. This paper presents Ricardian-TEA , a novel architecture combining Triple-Entry Accounting (TEA), Ricardian Contracts, and Distributed Ledger Technology to assign “Legal-Technical Identities” to AI agents. We provide rigorous mathematical foundations: a Ricardian-TEA Integrity Theorem proving that constraint enforcement, non-disputability, and identity binding hold with overwhelming probability under standard cryptographic assumptions, and a Cyber-Chama Convergence Proposition characterising reputation-based trust dynamics. The framework ensures GDPR compliance via Zero-Knowledge Architecture and Crypto-Shredding. Proof-of-concept implementations on Ethereum Sepolia and Bitcoin SV testnets demonstrate chain-agnostic applicability, achieving at worst 1.4 s latency per transaction while maintaining 100% auditability of AI transactions.

A. J. Xu, B. M. Wang, C. Y. Zhu, D. X. Zhu

Background Cross-border credit recognition in Sino-Foreign Cooperative Education (SFCE) suffers from data fragmentation, regulatory conflicts (e.g., GDPR vs. China’s Data Security Law), and low efficiency. Objective This paper proposes ZkHybridChain, a dual-layer blockchain credit bank (BCB) framework to resolve the privacy-compliance-efficiency trilemma. Methods The hybrid architecture integrates Polygon zkEVM (public credential hashing) and Hyperledger Fabric (private raw data storage). Zero-Knowledge Proofs (ZKP) and three-tiered smart contracts enable automated credit conversion (ECTS↔CNQF) and privacy-preserving verification. Results Experiments on 10,000 SFCE records show 58% efficiency gain (full lifecycle from ∼1,200 s to &amp;lt;9 s), cross-border latency &amp;lt;9 s, throughput up to 1,620 TPS, and ZKP verification latency 135 ms (93.7% success rate). Conclusion ZkHybridChain provides a scalable, GDPR/DSL-compliant solution for global education trust networks. Future work includes post-quantum cryptography and lightweight client protocols.

Giwoong Kim, Youjeong Son, Shiho Kim

As autonomous driving technology advances towards Level 4 and 5, virtual simulation has become an indispensable tool for safety validation. However, a critical ''trust gap'' exists between developers and regulators; submitting raw simulation logs poses risks of data tampering (integrity issues) and intellectual property leakage (privacy issues). To address this, we propose ZK-V, a universal, privacy-preserving verification framework designed to interface with various autonomous driving simulators. By leveraging Zero-Knowledge Proofs and blockchain technology, ZK-V allows a Prover to cryptographically demonstrate that a simulation run adhered to specific safety constraints such as collision avoidance and speed limits without revealing the underlying telemetry data. This paper outlines the simulation-agnostic system architecture and constraint logic, offering a scalable solution for decentralized, trust-free certification in the Web 4.0 mobility era.

Alessandro Lotto, Savio Sciancalepore, Alessandro Brighente, Mauro Conti

The Manufacturer Usage Description (MUD) standard enables enforcement of network restrictions for IoT devices based on their expected network traffic, as specified by manufacturers in an online MUD file. Devices advertise a URL pointing to this file, yet the standard does not define how to securely bind the issuing device to its profile. As a result, malicious devices can manipulate network policy enforcement by advertising valid URLs referencing genuine MUD profiles, but not intended for that device. Although MUD defines a certificate-based secure issuance method, current deployments rely on the insecure DHCP-based extension due to simpler integration. Existing solutions either depend on Public Key Infrastructure (PKI), break standard compliance, require excessive active manufacturer involvement, or overlook secure profile updates. In this paper, we present FIDEM, a standard-compliant framework for securing DHCP-based MUD URL issuance. FIDEM provides cryptographic binding between IoT devices and their MUD profiles by leveraging Zero-Knowledge-Proof authentication, eliminating PKI reliance, minimizing manufacturers' involvement, and supporting secure profile updates. Formal analysis shows that FIDEM withstands stronger adversaries than in prior work, including supply-chain compromise and attacks using legitimate devices as cryptographic oracles. Our real-world evaluation on two reference constrained devices (ESP32-S3 and ESP32-C6) demonstrates minimal overhead compared to standard DHCP (approximately 5ms and 20mJ) and significant improvements over certificate-based benchmarks (approximately x20 faster, and 35% less energy).