Blockchain Papers

Shiho Kim, Ho Suk, Roberto Di Pietro, Davor Svetinović · 7 authors

ZABAPAD (Zero-knowledge proof And Blockchain for WEB 4.0: Advancing the Post-quantum And Decentralized Era) is a workshop focusing on zero-knowledge technologies, blockchain infrastructure, and post-quantum readiness for the emerging Web 4.0 ecosystem. This workshop emphasizes real-world deployments, empirical measurements, and interoperability across Web and non-Web domains. In particular, ZABAPAD explores the convergence of AIoT and ZKP—redefining identity and trust models beyond SIM in mobile networks, IP in Web 2.0, and NFT in Web 3.0. As AIoT systems evolve toward decentralized, post-quantum infrastructures, ZKPbased authentication and AIoT SIM functionalities are emerging as key enablers of secure, privacy-preserving, and verifiable connectivity among intelligent devices, vehicles, and edge services. This theme extends to ZKML, Layer-2 proving/verification, TEE+ZK integration for verifiable compute, and post-quantum migration of identities, wallets, ledgers, and protocols. Expected outcomes include: (1) a practitioner-oriented adoption playbook, (2) an interoperability and standards checklist, (3) a curated set of reproducible benchmarks and datasets, and (4) a catalog of failure modes and mitigations for domains such as finance, mobility, healthcare, AIoT, public services, supply chain, and AI/ML. ZABAPAD complements the Web Conference and Web 4.0 communities by uniting global researchers and developers to chart actionable, trustworthy pathways toward the post-quantum, decentralized, and intelligent Internet.

Cheolwoo Ryu, Danyung Kyung, Shiho Kim

The proliferation of centralized carrier-based authentication systems has exposed critical vulnerabilities in the preservation of privacy and personal data protection. Current implementations in Korea, such as PASS and KakaoTalk identity services, rely on centralized architectures that create single points of failure and require excessive disclosure of personal information. The large-scale security breach of SK Telecom's USIM infrastructure in 2025, affecting 23 million subscribers, highlights the urgent need for a paradigm shift in identity authentication.?This paper proposes a decentralized identity authentication system leveraging W3C Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs), combined with Zero-Knowledge Proofs (ZKPs). Our framework integrates Schnorr signatures with Sigma-protocol-based ZKPs to enable privacy-preserving authentication without revealing private keys. A three-layer architecture—comprising cryptographic, identity, and credential layers—ensures strong cryptographic guarantees based on the discrete logarithm problem over the secp256k1 curve, while eliminating reliance on centralized infrastructure. Performance evaluation shows that signature generation occurs in under 10 ms and verification in under 15 ms, meeting real-time authentication requirements while delivering formal privacy guarantees that are absent in conventional systems.

Jihoon Oh, Junyong Lee, Jeihee Cho, Hyeonseong Jung · 7 authors

No abstract is available for this record.

Junyong Lee, Jeihee Cho, Hyeonseong Jung, Euimin Lee · 7 authors

As quantum computing moves to a cloud-based service model, a privacy–utility dilemma arises: effective Quantum Error Mitigation (QEM) requires circuit visibility, yet circuits and noise models are often proprietary. We propose Blind-QEM, a privacy-preserving framework that enables outsourced mitigation without revealing circuit topology. Using Zero-Knowledge Proofs (ZKPs) and a receipt-based binding mechanism anchored by QPU-signed execution logs, Blind-QEM verifies policy compliance and cryptographically links results to committed circuits. This allows Service Providers to perform global incoherent noise cancellation and readout mitigation using only verified aggregate statistics, ensuring mutual protection of user IP and SP models.

Ayush Nainwal, Atharva Kamble, Nitin Awathare

Zero-knowledge proofs (ZKPs) play a critical role in mitigating modern digital threats by enabling verification without disclosure, a key requirement for secure computation in adversarial environments. Among existing constructions, zk-SNARKs and zk-STARKs represent two dominant paradigms with contrasting security, trust, and performance characteristics. While their theoretical foundations are well studied, practical performance under real-world conditions remains less understood. In this work, we present a systematic, implementation-level comparison of zk-SNARKs (Groth16) and zk-STARKs using publicly available reference implementations on a consumer-grade ARM platform. Our empirical evaluation covers proof generation time, verification latency, proof size, and CPU profiling. Results show that zk-SNARKs generate proofs 68x faster with 123x smaller proof size, but verify slower and require trusted setup, whereas zk-STARKs, despite larger proofs and slower generation, verify faster and remain transparent and post-quantum secure. Profiling further identifies distinct computational bottlenecks across the two systems, underscoring how execution models and implementation details significantly affect real-world performance. These findings provide actionable insights for developers, protocol designers, and researchers in selecting and optimizing proof systems for applications such as privacy-preserving transactions, verifiable computation, and scalable rollups.

Minyong Eom, Danyung Kyung, Shiho Kim

No abstract is available for this record.

Eber Addí Quintana-Obregón

This document proposes integrative principles that articulate fully established and validated approaches—such as ethnobotany, One Health, circular bioeconomy, TRL, and Access and Benefit-Sharing—into an integrative model that shifts bioprospecting from a purely extractive model centered on the pharmaceutical industry to a more human-centered, circular, and biocultural paradigm. Through a historical analysis of the generations of bioprospecting (from 0.0 to 4.0), this work theorizes that technological advancement has paradoxically contributed to epistemic injustice. The proposed 5.0 framework integrates social validation tools and introduces the Epistemic Gap Score (EGS) as an exploratory heuristic tool that allows for visualizing the divergence or cohesion of bioprospecting a plant resource and the recognition of ancestral knowledge in a more humanistic manner. Through preliminary proof-of-concept, this study demonstrates the practical utility of the EGS for prioritizing plant species for bioprospecting, ensuring that the valorization of underutilized plant resources produces a tangible “epistemic return” and thereby promotes community autonomy and multisectoral benefits across the food, energy, and health systems. By focusing on zero-waste cycles and social reciprocity, Bioprospecting 5.0 reestablishes the role of plant resources as essential components of sustainable global development and ethical scientific practice.

Tolegen Aidynov, Дина Сатыбалдина, Gulsipat Abisheva, Eldor Egamberdiyev

Electronic voting requires the simultaneous admission of only legitimate participants, ballot uniqueness, vote confidentiality, storage integrity, and result verifiability. Blockchain alone does not solve these problems, since ledger immutability does not guarantee anonymity, ballot correctness, or reduced trust concentration. The purpose of this work is to develop a parameterizable research framework for electronic voting scenarios with enhanced cryptographic protection, allowing the security level to be varied according to the requirements of a voting scenario. The main contribution of the work is a parameterizable research architecture for composing and experimentally comparing electronic voting configurations with different security and computational profiles. The cryptographic and audit mechanisms integrated into this architecture include blind-signature-based anonymous authorization, encrypted ballot submission, blockchain-style audit, receipt verification, homomorphic tally publication, and threshold-supported tally artifacts. These mechanisms are not proposed as new cryptographic primitives; rather, they are integrated into a reproducible prototype to study how their combination affects verifiability, privacy support, auditability, and computational cost. Compared with basic blockchain-based voting prototypes, this architecture explicitly separates security, privacy, and verifiability profiles and makes their computational cost observable. The implemented prototype is used as an experimental platform for analyzing supported security properties, threat modeling, and computational cost estimation. The results show that authentication, anonymous token issuance, and receipt verification maintain an almost constant cost at the studied scale, while the main cryptographic burden is associated with encrypted ballot submission and threshold-supported tally publication. The scientific novelty of the work lies in constructing a parameterizable architecture that integrates several cryptographic mechanisms and a blockchain audit layer into one reproducible research prototype. At the same time, the proposed approach retains prototype-level limitations associated with the absence of a full zero-knowledge proof stack, independently deployed threshold authorities, and coercion-resistance mechanisms.

V Vijayalakshmi, S. Ismail Kalilulah, Kamal Natarajan

No abstract is available for this record.

Putri Anggia, Aisyah Ajeng Putri Riyanto, Muhammad Fathi

The rapid growth of cryptocurrencies is reshaping the global financial landscape, challenging traditional systems of taxation and regulation. This article examines the complex interplay between cryptocurrency anonymity, legal frameworks, and the pursuit of international tax justice. Using normative legal research with a descriptive approach, this article examined the challenges posed by cryptocurrency adoption in taxation policies. The findings revealed that while blockchain technology enhances transparency and decentralisation, the anonymity features of digital assets create risks of tax evasion and illicit financial flows. Addressing these issues requires integrated efforts among international regulatory frameworks, such as the OECD's CARF and FATF's Travel Rule alongside domestic reforms like Indonesia's HPP Law and the EU's DAC8. Inclusive governance that empowers developing countries and the constitutional grounding of tax justice principles are essential to strike a balance between individual privacy and collective fiscal responsibility. This multi-layered approach is critical to ensuring cryptocurrencies serve as instruments of innovation rather than tools for inequality. Future research should focus on empirical assessments of compliance costs, enforcement effectiveness across borders, and the development of privacy-preserving technologies, such as zero-knowledge proofs, to enable proportional and fair regulation globally.

Randika S.W.D.K.M.A., Lakshan W.D.D., Jayasena K.P.N.

Electronic voting systems are promised to be faster and have less operational overhead, but most implementations remain characterized by centralization, low auditability and user-paid transaction fees and lack of privacy. The software engineering framework to design, implement and validate a secure blockchain-based e-voting system that will overcome these practical constraints is presented in this paper. The system combines identity-based voter registration, guaranteed by smart contracts, election management, gasless voting route, and a privacy-conscious architecture that includes a direction of zero-knowledge proofs to cast confidential votes. It was tested on the Polygon Amoy test network with Solidity smart contracts, a wallet registry linked to a NIC, and a workflow voter and administrator web application. The analysis consisted of gas benchmarking, contract optimization as well as a usability test with 50 participants. Findings indicate that optimized election creation reduced average gas consumption from 726,422 to 653,344 and the paymaster path increased total gas per vote to 156897 per vote although this left the user with no gas cost. The results of usability suggest the overall moderate acceptance with the mean scores of 3.16 to 3.40 in understanding, easy to use, trust, and satisfaction, and worse results among those with zero blockchain familiarity. It demonstrates that gasless voting enhances access and that a systematic engineering system can inform the creation of secure and usable blockchain e-voting systems, and full production-quality zero-knowledge verification is also a task of the future.

Dmitry Zharnikov

This paper empirically demonstrates Zharnikov's (2026ao) Proposition P4 – rendering-equivalence under spine-preservation – in management theory. The paper extends the companion theory's Heisenberg–Schrödinger historical existence proof into contemporary strategy research via structural extractions of two independently-authored pairs: a dynamic-capabilities pair (Eisenhardt and Martin 2000 + Zollo and Winter 2002) and a knowledge-based-view pair from the SMJ Winter 1996 Special Issue (Grant 1996 + Liebeskind 1996). The recombination metric Rec returns 4 linked propositions with preserved antecedents on each pair. A random-graph null baseline shows Pr(Rec ≥ 3 by chance) ≈ .000 across 1,000 size-matched shadows. Three additional renderings of substrates already in the corpus — a practitioner-register rendering of the paper's own structure, a third rendering of the focal-pair shared substrate, and a cross-paper rendering of the companion theory's full theoretical apparatus – preserve 11/14, 4/4, and 12/15 items strictly; 14/14, 4/4, and 15/15 semantically; zero contradictions. A bibliographic-hallucination audit of twelve AI-suggested anchors finds two verified and ten negative findings. Secondary β/δ estimates satisfy the cost-asymmetry ordering. Cross-language demonstrations span Russian renderings across multiple LLMs (including Russian-native GigaChat Rec = 12 and YandexGPT Rec = 11) and Chinese renderings across five LLMs from three training-corpus families including an open-weights model running locally on a single Mac mini (DeepSeek Rec = 12, Claude Opus Rec = 11, Qwen3.6:27b Rec = 12), with cross-extractor robustness (DeepSeek's Chinese rendering re-extracted by Qwen3.6 instead of GPT-4o: Rec = 12). Inter-coder reliability tests are pre-registered for a future release. The paper engages recombinant-search and knowledge-representation scholarship as theoretical antecedents. Includes paper.yaml (Paper Spec v0.1.0) – a machine-readable specification of the paper's claims, assumptions, and dependencies. See https://github.com/spectralbranding/paper-spec for the standard.

Naiheng Zhang

Abstract In the digital age, the reliance on network communication for information exchange has surged, making encrypted network traffic a linchpin of secure digital interactions. However, while encryption safeguards data, it creates hurdles for network management and security surveillance. Conventional deep packet inspection (DPI) falters when faced with encrypted traffic, and existing studies in this area have drawbacks like reliance on trusted third parties and limited detection capabilities. To address these issues, we present a novel zero knowledge proof based encrypted traffic management( $$\mathbb {ZKP}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ZKP</mml:mi> </mml:math> - $$\mathbb {PET}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>PET</mml:mi> </mml:math> ) scheme. By integrating a third-party verifier operating under the honest-but-curious (HBC) model, $$\mathbb {ZKP}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ZKP</mml:mi> </mml:math> - $$\mathbb {PET}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>PET</mml:mi> </mml:math> establishes a trustless verification system that effectively and efficiently curbs metadata leakage. $$\mathbb {ZKP}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ZKP</mml:mi> </mml:math> - $$\mathbb {PET}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>PET</mml:mi> </mml:math> is implemented with two applications: HTTP traffic blocking and blacklist management. For HTTP traffic blocking, the BTHP circuit is developed to extract version details from TLS traffic and verify compliance, enabling precise traffic control. In blacklist management, tailored extraction algorithms for DoT and DoH encrypted DNS traffic are implemented, and Merkle tree based membership proofs are utilized to decide whether to intercept traffic. Experimental evaluations demonstrate that $$\mathbb {ZKP}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ZKP</mml:mi> </mml:math> - $$\mathbb {PET}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>PET</mml:mi> </mml:math> can efficiently enforce diverse network policies on encrypted traffic. It not only safeguards security and privacy but also exhibits outstanding performance, offering a dependable, efficient, and privacy-centric solution for encrypted network traffic management.

José Ignacio Peinador Sala

Conditional Refutation of Erdős Problem #463 via Arithmetic Quantum Chaos Author: José Ignacio Peinador Sala Overview This repository contains the full manuscript, companion computational notebooks, and formal Lean 4 verification for the paper "Conditional Refutation of Erdős Problem #463 in Hyper‑Slow Growth Regimes via Arithmetic Quantum Chaos". We demonstrate that, under the hypothesis that the survival variance of rough numbers around primorials is controlled by the fractal dimension D2≈0.24338 of the Riemann‑GUE Hamiltonian (Bridge Conjecture), no function f(n)≤log⁡(log⁡n) satisfies Erdős' condition for all sufficiently large n. The proof is constructed by bridging Galois projection operators, power‑law random banded matrices (PRBM), the Altshuler‑Shklovskii effect, and optimal transport (Kantorovich–Rubinstein duality). The ultimate goal of this program is to elevate this conditional result to an unconditional proof by integrating the supersymmetric Non-Linear Sigma Model (NLσM) limit with the most recent 2025 sieve bounds on rough numbers in short intervals. Contents Article: Open pdf One‑Click Reproducibility This project is designed for frictionless, one‑click reproducibility. No compiler installation, no supercomputing cluster. All experiments run on Google Colab with zero local setup — you can audit the physics of the arithmetic vacuum from a browser on your laptop or even your phone. What the notebooks validate You can run the experiments directly in your browser: Notebook Contents What it certifies Main experiments: Open in Colab Experiments 1–4 + Chirikov map Collapse of Nₖ, monotonic decrease of D₂, massive suppression of Σ²(L), sub‑diffusive SFF ramp, classical chaos suppression Lean 4 verification: Open in Colab Lean 4 formal proofs Idempotence of the Galois projector, discrete variance floor lemma, modular classification of primes Experiments (Main Notebook) Collapse of the survival variable Nk – deterministic emptiness of the critical interval for primorials k≥10 (M=5,000 samples). Fractal dimension D2 of pruned Hamiltonians – monotonic decrease under Galois projection (Numba‑accelerated up to N=10,000). Number variance Σ2(L) and Thouless energy – massive spectral suppression (up to 96% below GUE) with the Thouless scale plunging below L=0.5 (M=10,000 realizations). Spectral Form Factor and Finite‑Size Scaling – robust sub‑diffusive ramp (γ→0.61) and convergent D2≈0.106 in the thermodynamic limit (M=100 realizations, N up to 6,000). Chirikov Map (Classical) – Galois projection completely strangulates chaotic transport (D≈0.00 vs D≈11.05), proving universal ergodicity suppression. Formal Verification in Lean 4 Erdős Problem #463 is actively tracked by the mathematical community, including Google DeepMind's formal-conjectures repository. Laying the formal groundwork to resolve this, the notebook Notebooks/erdos_refutation.ipynb compiles and mechanically verifies three foundational lemmas in Lean 4 (v4.29.1, Mathlib4): Discrete Variance Floor Lemma — ∀ x ∈ ℕ, x ≤ x² Galois Projector Idempotence — χ² = χ for the coprimality indicator Modular Classification of Primes — ∀ p > 3 prime, p ≡ 1 ∨ p ≡ 5 (mod 6) These lemmas form the unshakeable logical bedrock of the conditional refutation. 🔭 Philosophical Context "Mathematics is not about numbers, equations, computations, or algorithms: it is about understanding." — William Thurston For decades, the distribution of prime numbers and the behaviour of chaotic quantum systems were studied as separate continents of knowledge, occasionally glimpsing each other across a narrow strait —the Hilbert–Pólya conjecture, the Montgomery–Odlyzko law— but never truly merging. This work builds a bridge across that strait. The key insight is that the ring ℤ/6ℤ is not merely a convenient sieve for eliminating multiples of 2 and 3. It is a topological substrate —a discrete analogue of the KO‑dimension in noncommutative geometry— that partitions the integers into resonant channels (𝒞₁ and 𝒞₅) and sterile channels (𝒞₀, 𝒞₂, 𝒞₃, 𝒞₄). When this partition is imposed as a superselection rule on a quantum Hamiltonian, the system does not thermalise. It enters a Non‑Ergodic Extended (NEE) phase where fluctuations are systematically suppressed, variance collapses, and the arithmetic vacuum swallows the survivors. The philosophical lesson is profound: randomness is not the default state of complex systems. The apparent chaos of prime numbers, long regarded as the quintessence of unpredictability, harbours a rigid geometric order. That order can be harnessed —through Galois projection, through PRBM Hamiltonians, through the Altshuler–Shklovskii effect— to prove theorems that have resisted classical sieve methods for half a century. This project also embodies a conviction about how science should be done in the age of artificial intelligence. Every line of code, every formally verified lemma, and every numerical experiment was developed using freely accessible tools. The massive simulations of quantum chaos, which traditionally would demand exclusive access to institutional supercomputers, were executed entirely on Google Colab, democratizing high-performance computing. The formal verification of the mathematical bedrock was achieved using the open-source proof assistant Lean 4. Furthermore, the theoretical framework was built in a genuine symbiosis with DeepSeek, an open-weight AI freely provided to the world. No proprietary models, no paywalled platforms, no computational aristocracy. This work demonstrates that the absolute frontier of mathematical research is now accessible to anyone with a good idea, a standard laptop, and the willingness to engage in dialogue with tools that amplify, rather than replace, human creativity. "The universe is written in the language of mathematics." — Galileo Galilei Perhaps it is written, more precisely, in the language of modular arithmetic. Last Update: May 2026 | Status: Under Peer Review in IOP/LMS Nonlinearity (Ref: NON-110856) | Built with ❤️, 🐍 & 🤖

Paolo Antonelli, Pierangelo Marcati, Laura V. Spinolo

We study the zero-dispersion limit for a class of Korteweg--de Vries (KdV)-type initial-boundary value problems on the half-line, with Dirichlet boundary conditions assigned at \(x=0\). We focus on the outflow regime, where the solution of the limiting scalar conservation law does not attain the boundary condition imposed on the dispersive problem. We construct a boundary layer profile, depending on the fast variable, which is uniquely determined, through the associated stationary third-order boundary layer equation, by the mismatch between the boundary conditions, and by the exponential decay at infinity in the fast variable. Our main result shows that, under suitable regularity and compatibility assumptions on the data, the dispersive solution is well approximated by a WKB expansion given by the sum of the smooth solution of the conservation law and the boundary layer profile. In particular, we establish stability of the boundary layer profile by proving quantitative estimates for the remainder term in a weighted energy norm, and show that it converges to $0$ in $H^1$, uniformly in time and up to the lifespan of the smooth solution of the conservation law. The proof is based on the analysis of a linearized energy functional and does not rely on complete integrability or inverse scattering techniques. It applies to general fluxes and requires no smallness assumption on the amplitude of the boundary layer. To the best of our knowledge, this is the first stability result for boundary layers of KdV-type equation on the half line.

Jieran Cui, Zhengkai Wen, Haowen Fang, Yinan Zhu · 9 authors

Zero-knowledge virtual machines (zkVMs) are a key technology for driving the large-scale adoption of zero-knowledge proofs (ZKP), but their performance bottlenecks severely limit their practicality. While current hardware acceleration research has exclusively focused on backend proving, we identify that the frontend execution and trace generation phase is rapidly emerging as the new system bottleneck. To address this challenge, we propose ZK-Tracer, the first hardware accelerator architecture specifically designed for the zkVM frontend. ZK-Tracer features a novel heterogeneous design comprising a Main Trace Unit and parallel Permutation Trace Units. It exposes a fine-grained interface to the host software through a lightweight instruction set extension, enabling efficient task offloading. Our ASIC implementation results demonstrate that ZK-Tracer achieves up to 1829x speedup in trace generation over a high-performance multi-core CPU. When integrated with existing backend proving accelerators, it delivers a remarkable 963x end-to-end performance improvement for the entire ZKP system.

AKATERINH XENOPOULOU-TYROKOMOU, Epameinondas Xenopoulos

Xenopoulos’ Historical Genetic Logic: A New Framework and the XEPTQLRI Theorem DOI:10.5281/zenodo.20367121Date: May 2026 Aikaterini Xenopoulou TyrokomouIndependent ResearcherORCID: 0009 0004 9057 7432Email: katerinaxenopoulou@gmail.com Theoretical Foundation: Epameinondas Xenopoulos †Based on the Historical Genetic Logic of Epameinondas Xenopoulos, Epistemology of Logic: Logic Dialectic or Theory of Knowledge (posthumous 2nd ed., 2024) [1, 2]ORCID: 0009 0000 1736 8555† In memoriam (1920–1994) Methodological NoteThe present work simplifies and mathematizes central ideas of the formal-dialectical logic of E. Xenopoulos in order to create an applicable computational tool. It does not constitute a faithful rendering of his philosophical theory in its full depth, but a focused operationalization for the purpose of computational application. Statement of AuthorshipThe present work is founded on the logical system of Epameinondas Xenopoulos (1920–1994). The XEPTQLRI index does not constitute an independent theory, nor does it introduce a new autonomous logical framework. The theoretical background, the basic categories, the logical relations, the fundamental principles, and the dialectical operators belong to the work of Epameinondas Xenopoulos. The contribution of the present work consists in the formal mathematical operationalization of specific principles of this logical system through a computable index, capable of being applied to dynamic and historically evolving systems. Consequently, the theoretical authorship belongs entirely to Epameinondas Xenopoulos, while the present work belongs to the level of systematic formalization, proof, application, and methodological development of his framework. The XEPTQLRI index expresses in quantitative form the logic of Being, Non-Being, Becoming, historical memory, and dialectical sublation, while adapting these concepts for computational use. In this sense, the present work constitutes a continuation, clarification, and applicative deepening of the Xenopoulos system, not a displacement or replacement of it. ABSTRACT We present the Xenopoulos Pre-Transitional Qualitative Leap Risk Index (XEPTQLRI), a novel mathematical index grounded in the Historical-Genetic Logic of the Greek philosopher Epameinondas Xenopoulos [1, 2]. Unlike conventional statistical summaries, XEPTQLRI captures the dialectical interplay between Being (B), Non‑Being (N), historical memory (τ), and a historical paradox factor (Π). The index is defined as Ξ = [T · τ · (1 + Π)] / Θ₀ with Θ₀ = 0.85, where T = 2BN/(B+N) is the dialectical tension expressed through the harmonic mean. Its construction respects strict causality, min‑max or logistic normalization, and a negative feedback mechanism (∂σ/∂Ξ < 0) in its dynamical extensions, though the index itself remains exogenous and purely diagnostic. We prove five theorems establishing constructive computability, scale homogeneity, non‑preservation of dynamical structure, representation dependence, and linear‑time computability. Two additional theorems (non‑self‑inversion and logical phase transition) are proved within the extended framework of the 34 Principles. Numerical experiments with the Ferrari–Xenopoulos v4.0 stochastic model show reproducible and persistent exceedance of the Aufhebung threshold, with endogenous volatility remaining low (σ ≈ 0.058). An extreme parameter run (α₅ = 1.6, σ₁ = 1.0, Θ₀ = 0.0867) reaches Ξ = 16.1, demonstrating that the critical value is not a universal constant but a local, parameter‑dependent realization. A “Dialectical War” experiment (LSTM vs. Xenopoulos system under noise = 1.0) reveals a striking dissociation: technical performance (MAE = 0.1039, 67.1% improvement) coexists with universal dialectical risk (20/20 high‑risk steps, Ξ_max = 2.99, zero paradoxality and false stability). This dissociation is mathematically consistent, as MAE and Ξ are distinct functions measuring different aspects of system behavior (MAE ⇏ Ξ). A null model comparison confirms that this risk is structurally generated (AUC 0.949 vs. 0.501, p < 0.001), with ground truth defined by the condition Ξ(t) ≥ Θ₀ for at least three consecutive time steps and binary classification threshold optimized via the Youden index. A strictly endogenous application of the canonical XEPTQLRI index to 13 distinct COVID‑19 waves in Greece (JHU CSSE) yields early warnings 48–90 days in advance (mean 84.0 days) with a mean EWS Score of 0.785, successfully detecting 10 of 13 waves (76.9%). The system substantially outperforms a simple cases‑threshold baseline (mean EWS 0.42, 23.1% success) without any reliance on AUC or external classifiers. Beyond its diagnostic function, the XEPTQLRI framework demonstrates a transformative capacity: non‑dialectical codes exposed to the Xenopoulos environment undergo systematic improvement, with documented gains ranging from 52.3% to 95.65% across multiple independent experiments. A banking crisis application correctly identified Lehman Brothers (z=3.2, p<0.001) and Bear Stearns (z=2.9, p<0.01) two years before their collapse using only pre‑2006 data. A financial early warning application achieved statistically significant predictive correlations (r=0.29–0.44, p<0.001) with lead times of 10–77 days across S&P 500, VIX, Treasury yields, and Bitcoin. Two complete experimental protocols (XENO‑EXP‑2026‑002 and XENO‑EXP‑2026‑003) provide systematic, statistically significant evidence that the Xenopoulos System, when fully embedded in machine learning architectures, functions as an improvement catalyst with measurable economic value (ROI 63:1, break‑even 6 days). Thus, XEPTQLRI bridges formal dialectics with practical early warning systems, establishing a universal law of qualitative transition while keeping its numerical expression local and context‑dependent. The present system constitutes a proto‑formalized theoretical framework — a structured mathematical–dynamical system with axiomatic foundation (34 Principles), provable theorems (7 Theorems), and computational implementation (Ferrari–Xenopoulos v4.0, COVID‑19 application), whose applicative and transformative value has been verified on real data. The system is internally consistent under its stated principles, though its full formalization in the sense of a Hilbert‑style formal system remains a subject for future work. Keywords: XEPTQLRI, Historical‑Genetic Logic, dialectical logic, qualitative leap, Aufhebung, early warning systems, stochastic differential equations, LSTM, COVID‑19, proto‑formalized framework, non‑classical negation, harmonic mean, paradox factor, historical memory, dialectical transformation, financial crisis prediction, code optimization. Lead paragraph Complex dynamical systems often undergo sudden, qualitative transformations—critical transitions that are difficult to anticipate with conventional statistical tools. This paper introduces a new mathematical framework for detecting such transformations, grounded in the Historical‑Genetic Logic of the Greek philosopher Epameinondas Xenopoulos (1920–1994). The central contribution is the Xenopoulos Pre‑Transitional Qualitative Leap Risk Index (XEPTQLRI), defined as Ξ(t) = T(t) · τ(t) · (1 + Π(t)) / Θ₀, where T is the dialectical tension between Being and Non‑Being, τ captures historical memory, and Π encodes the accumulated paradox of extreme past states. The index is fully endogenous, requires no external training or classifiers, and is accompanied by a typology of ten dialectical stages (τ₀–τ₉). We prove five constructive theorems, validate the framework through stochastic simulations, and apply it to real COVID‑19 data from Greece. Across 13 epidemic waves, XEPTQLRI issued early warnings with an average lead time of 84.0 days and a mean Early Warning Score of 0.785, substantially outperforming a simple cases‑threshold baseline. The framework thus bridges formal dialectics with operational early warning capability, offering a new lens for the study of critical phenomena. Part I — Definition and Foundation of XEPTQLRI 1. Theoretical Foundation This section presents the fundamental principles underlying the Xenopoulos Pre-Transitional Qualitative Leap Risk Index (XEPTQLRI), as formulated in the Historical-Genetic Logic of the Greek philosopher Epameinondas Xenopoulos (1920–1994) [1, 2]. These principles constitute the axiomatic framework of the index and determine both its mathematical form and its interpretive function. XEPTQLRI is neither a simple numerical magnitude nor a mere statistical summary. Instead, it is defined as a complex historical-dialectical index that captures the relationship between Being, Non-Being, their dialectical tension, historical tendency, and the probability of transcending a critical threshold of transformation. The index is embedded within the broader system of 34 Principles as the 23rd Principle, expressed through the general dialectical operator: Ξ(t) = N[F₂₃(G₂₃)]. 1.1 Principle 5: Complementarity According to the theory [1, 2], Non-Being is not an independent quantity but the complement of Being. This relationship is expressed by Principle 5: N(t)=1−B(t)N(t)=1−B(t) This equation implies that: B(t)+N(t)=1B(t)+N(t)=1 Therefore, the two quantities B(t) and N(t) are complementary aspects of the same dynamic state. If B(t) expresses the degree of presence of Being, then N(t) expresses the degree of presence of Non-Being. From the same principle it immediately follows that it is impossible for both of the following to hold simultaneously: B(t)>0.8andN(t)>0.8B(t)>0.8andN(t)>0.8 because then we would have B(t) + N(t) > 1.6, in contradiction with B(t) + N(t) = 1. Important clarification: In Theorem 2 (Paradoxical Transcendence), the condition B > 0.8 ∧ N > 0.8 refers to a special paradoxical state where the usual complementarity is suspended due to the historical accumulation of contradictions. In this state, B and N are not understood as instantaneous values at

Anthony Coslett

The numerical receipt that allows independent verification of which AI model is serving a frontier API endpoint — the top-*K* log-probability vector computed on every forward pass — is being withdrawn across every major frontier lab, without announcement. xAI silently ignores the parameter on Grok 4.20 and newer. Google Vertex began returning errors on Gemini 3 Pro without notice. OpenAI excludes the entire reasoning-model class and the GPT-5 line. Anthropic has never exposed the field. The withdrawal is not universal: legacy and non-reasoning models at the same providers continue to return logprobs on the same infrastructure. The capability is not technically infeasible. It is a decision. This note documents the current state of logprob access across four frontier providers, establishes what the access enables and what it does not, and provides six operational contract clauses that preserve the enterprise's right to verify model identity at the API layer. The mathematics of establishing model identity from top-*K* logprob output is documented in the companion research [1, 2]; this note concerns whether the numbers will continue to be available at all. The Neural Network Identity Series — Mathematical foundations, empirical validation, and governance frameworks for verifying which model is running Paper 1: The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry (DOI: 10.5281/zenodo.18704275) Paper 2: Template-Based Endpoint Verification via Logprob Order-Statistic Geometry (DOI: 10.5281/zenodo.18776711) Paper 3: The Geometry of Model Theft: Distillation Forensics, Adversarial Erasure, and the Illusion of Spoofing (DOI: 10.5281/zenodo.18818608) Paper 4: Provenance Generalization and Verification Scaling for Neural Network Forensics (DOI: 10.5281/zenodo.18872071) Paper 5: Beneath the Character: The Structural Identity of Neural Networks — Mathematical Evidence for a Non-Narrative Layer of AI Identity (DOI: 10.5281/zenodo.18907292) Paper 6: Which Model Is Running?: Structural Identity as a Prerequisite for Trustworthy Zero-Knowledge Machine Learning (DOI: 10.5281/zenodo.19008116) Paper 7: The Deformation Laws of Neural Identity (DOI: 10.5281/zenodo.19055966) Paper 8: What Counts as Proof? — Admissible Evidence for Neural Network Identity Claims (DOI: 10.5281/zenodo.19058540) Paper 9: Composable Model Identity — Formal Hardening of Structural Attestations in the Enterprise Identity Stack (DOI: 10.5281/zenodo.19099911) Paper 10:Where Identity Comes From: Path Sensitivity and Endpoint Underdetermination in Neural Network Training (DOI: 10.5281/zenodo.19118807) Paper 11: Post-Hoc Disclosure Is Not Runtime Proof: Model Identity at Frontier Scale (DOI: 10.5281/zenodo.19216634) Paper 12: Family-Dependent Response to Reasoning Distillation Across Structural and Functional Identity Layers (DOI: 10.5281/zenodo.19298857) Paper 13: Safety-Alignment Removal as a Model-Identity Failure — Structural Evidence from Published Weight-Level Mutation Checkpoints (DOI: 10.5281/zenodo.19383019) Technical Note: Agent Identity Is Not Model Identity (DOI: 10.5281/zenodo.19240883) Technical Note: Gap Invariance: Why PPP Measurements Are Domain-Independent by Construction (DOI: 10.5281/zenodo.19275524) Technical Note: Measured Model Substitution Under Valid Agent Credentials (DOI: 10.5281/zenodo.19342848) Technical Note: Artifact Identity Is Not Runtime Identity — Trustfall Lite and the Boundary of File-Level Model Verification (DOI: 10.5281/zenodo.20019127) Technical Note: Artifact Identity Is Not Runtime Identity — Trustfall Lite and the Boundary of File-Level Model Verification (DOI: 10.5281/zenodo.20019127) Technical Note:: The Disappearing Window — AI Logprob Access Withdrawal and the Structural Verifiability of Frontier Model Contracts (DOI: 10.5281/zenodo.20362098) Formal Verification Stack for Neural Network Structural Identity (IT-PUF Coq Proofs) (DOI: 10.5281/zenodo.18930621) Copyright (c) 2026 Anthony Ray Coslett / Fall Risk AI, LLC. All Rights Reserved. Confidential and Proprietary. Patent Pending (Applications 63/982,893, 63/990,487, 63/996,680, 64/003,244).

Ilir Mehmetaj

Abstract This concept documents a complete physics-first authorisation architecture for the quantum-permanent era — applicable across AI cluster security, interbank settlement, space and interplanetary infrastructure, critical infrastructure protection, digital identity, supply chain integrity, and optional democratic participation tools. The architecture rests on a single physical principle: a cryptographic credential that no longer exists cannot be recovered by any computation, quantum or classical, regardless of future advances in hardware or algorithms. The concept extends the Temporal Rotation Security Protocol (TRSP v3, DOI: 10.5281/zenodo.20324081) and the TRSP Digital Coin (TDC v2, DOI: 10.5281/zenodo.20332811) with a unified Layered Temporal-Quantum Security (LTQS) framework. LTQS combines NIST FIPS 203/204-standardised Post-Quantum Cryptography (ML-KEM, ML-DSA) as Layer 0 — mathematical transit security — with TRSP temporal rotation as Layer 1 — physical credential elimination through hardware-enforced destructive readout within a configurable rotation window (10–500 ms). Layers 2 and 3 add geographically distributed hybrid dynamic quorum validation and LEO satellite orbital entropy anchoring with relativistic timestamp verification. An integrated adaptive AI management layer selects security profiles dynamically across High-Assurance, Standard, Degraded, and Emergency modes — guaranteeing graceful degradation to pure PQC fallback when physical infrastructure is unavailable. The hardware commitment module previously documented as CRATON is architecturally designated URDHR, after the Norse Norn of the irrecoverable past. The two complementary quorum layers are designated VERÐANDI (present-moment ground quorum) and SKULD (future-anchoring orbital quorum) — the three Norns mapped to the three temporal dimensions of cryptographic security. Prior art established under the CRATON designation in all previously published documents extends fully to the URDHR designation. Fifteen novel contributions are placed on the public record as defensive prior art: NC-TDC-21 (AI-to-AI Micropayment Architecture), NC-TDC-22 (Macroscopic Environmental Entropy as Optical Physical Unclonable Function), NC-TDC-23 and NC-TDC-23a (Macroscopic Polymorphic Cipher with Dynamic Dimensional Entropy — exploratory), NC-TDC-24 (TRSP Democratic Coercion Shield — exploratory, extending Juels-Catalano-Jakobsson coercion-resistant voting literature), NC-TDC-25 (Continuous Anonymous Democratic Pulse — exploratory), NC-TDC-26 (Physical Proof of Presence consensus mechanism operating at the Landauer thermodynamic minimum), NC-TDC-27 (Temporal Scarcity Value Architecture anchored in thermodynamic time-arrow irreversibility), NC-TDC-28 (AI Exchange Consortium Architecture), NC-TDC-29 (Biometric Supply Architecture), NC-TDC-30 (CRATON Chain Coin Identity Architecture without persistent private key), NC-TDC-31 (Three-Phase Value Architecture), and NC-TDC-32 (Cooperative Multi-Anchor Currency Architecture with Founder-Operator Equity-Plus-Operating-Margin Compensation Structure). NC-URDHR-1 and NC-TRSP-Hybrid-1 formalise the Three-Norn naming framework and the four-layer hybrid post-quantum/temporal architecture respectively. NC-TDC-32 is the central economic contribution of this version. It formalises a digital currency architecture in which multiple stakeholder classes — AI infrastructure operators, financial institutions, sovereign states, and individual participants — coexist as independent issuing classes within a single cooperative cryptographic framework. Each class mints its own coin contingent backed by its own economic activity rather than by shared monetary authority. Phase transitions admit new classes through supply expansion, not through re-pricing of existing coins. Coin denomination is calibrated from inception across micropayment to reserve-asset volume regimes via the monetary identity M·V = P·Q. The infrastructure operator class — the AI companies that build and continuously operate the adaptive security layer — is compensated through a two-component structure: bounded equity recognition at phase transitions (capped, independently audited) plus formula-bound operating margin on continuing services. This two-component compensation model is economically required to keep operating margins moderate and the architecture competitive against established settlement infrastructures. Monetary sovereignty remains exclusively with the issuing class for each contingent; the operator class operates the cryptographic issuance infrastructure but does not exercise monetary authority over any contingent. The architecture is the first formalised digital implementation of the cooperative multi-stakeholder economic model previously demonstrated at continental scale only by the Hanseatic League (twelfth to seventeenth century). All fifteen contributions are documented as conceptual frameworks. Production Concepts (NC-TDC-21, NC-TDC-22, NC-TDC-26 through NC-TDC-32, NC-URDHR-1, NC-TRSP-Hybrid-1) represent architecturally sound design patterns ready for implementation evaluation. Exploratory Concepts (NC-TDC-23, NC-TDC-23a, NC-TDC-24, NC-TDC-25) document underlying architectural ideas requiring further formal research. All specific implementation parameters — quantities, ranges, governance percentages, consortium composition — are illustrative starting points belonging to the institutions that choose to implement the architecture. A dedicated Part 9 — Engineering Considerations and Open Challenges — documents five anticipated technical reviewer questions with referenced solution pathways from current research literature: global consensus latency under M-of-N geographically distributed validation (Sliding Window Key Rotation with Dual-Key Buffers, TLS 1.3 RFC 8446); fuzzy extractor Helper Data leakage in optical entropy capture (Controlled PUF Finite State Machine architectures eliminating Helper Data transmission, addressing Becker 2015); orbital quorum availability under atmospheric and orbital dynamics constraints (Multi-Path Delivery with configurable Grace Periods and Layer 2 graceful degradation); post-quantum zero-knowledge proof latency for autonomous AI agent commerce (Off-Critical-Path ZKP architecture separating HMAC authorisation from asynchronous identity verification); and multi-anchor synchronisation between independent issuance classes (Key-ID and class-identification headers preserving structural separation between technical operation and monetary sovereignty). Part 9 introduces no additional Novel Contributions — it documents that the engineering challenges anticipated by reviewers have established research-backed pathways, demonstrating readiness for Proof-of-Concept implementation phases without modifying or weakening any architectural element documented in Parts 1 through 8. The concept is published as defensive prior art under CC BY-NC-ND 4.0 , preventing future patent claims on the documented conceptual architectures while preserving open non-commercial use for evaluation, research, citation, and standards consideration by IETF, ISO/IEC JTC 1/SC 27, NIST Post-Quantum Cryptography programme, or any institution choosing to adopt all or any independent component of the architecture.

Rohini Lakshané

This working paper is an output of the Community Privacy Residency held in Taipei in 2025. https://community-privacy.github.io/ Keywords: Image-based abuse; non-consensual intimate imagery; evidentiary privacy; protected identity; sexual autonomy; Global South; digital evidence; hash evidence; zero-knowledge proofs; privacy-enhancing cryptography; survivor-auditable governance.

tsenhsuan Chang, tsenhsuan Chang

Decentralized Federated Intelligence Protocol (DFIP) Engineering a Post-Cloud Autonomous Swarm Intelligence Architecture Integrating LEO Satellite Backbone, Edge Vectorized Compute,and Zero-Knowledge Proof Validation for Next-Generation Defense Applications

Muhammad Ali, Tariq Qayyum, Zouheir Trabelsi, Asadullah Tariq

No abstract is available for this record.

Zihang Guo, Q Liu, Ray C.C. Cheung, Zhaohui Guo

No abstract is available for this record.

Hanxiao Chen, Rui Zhang, Pengzhi Xing, Meng Hao · 6 authors

No abstract is available for this record.