Blockchain Papers

Rodion Mironov

We report, in a finite designed reaction–diffusion medium on a 64×64 lattice, a distributed physical memory that lives in the configuration of a flow-constructed boundary rather than in any object, label, or instruction store. A directed flow writes a local orientation field into boundary material; after the originating flow is removed and the medium relaxes, an identical weak, direction-free scalar input recovers opposite motions depending only on the boundary's history. The effect is causally necessary: resetting the boundary, shuffling its local orientation, or disabling its plasticity abolishes recovery, and a fixed-protocol permutation test (statistic and one-sided alternative fixed in advance) gives per-seed p ≤ 5×10⁻³ across eight independent seeds with large effect sizes. In an autonomous extension, boundary memory continuously gates permeability, acquired resource drives motion, and motion pays for repair of the boundary that stores the memory, closing a self-maintaining loop that survives repeated damage. Results rest on gates and thresholds fixed before the confirmation runs, disjoint development/confirmation seed families, and a conserved resource ledger in the autonomous stage (B1). We do not claim natural occurrence, open-ended evolution, spontaneous birth of the carrier, or new physical laws; the contribution is the causal-necessity protocol and its transportable operational definition of configuration memory. This study is one component of a broader, open-ended research program exploring the possibility space of non-genomic organization — memory, self-maintenance, and selection-like dynamics that need not rely on a genome. The present preprint establishes only the distributed-memory component and makes no claim about evolution, inheritance, life, or natural occurrence.

Humaira Atiq, Muhammad Irfan Mahsud, Muhammad Iqbal Uddin Arif

Climate change is a transnational problem, that requires localized collective actions. Compared to China and the US which contributes 27% and 11% to global carbon emissions, respectively, Pakistan contributes less than 1% but is among the top ten most vulnerable countries to climate catastrophes. These threats are further escalated by the country’s highly centralized governance structure. These study focuses on the decentralization of climate policies in Pakistan, followed by a polycentric governance system, and highlights its importance in responding to the dynamic nature of climate change in the country. Grounded in Polycentric Governance Theory, a qualitative, deductive research design way employed, relying on primary and secondary data sources. The study reveals that after the 18th amendment in Pakistan, the responsibility related to climate policies has increased on the subnational government; however, its effect remains limited due to constant economic constraints, weak coordination among different governmental bodies, and dependency on international climate finance. This demonstrates that polycentric governance offers a commendable framework for making strong climate responses by involving local actors and providing region-specific solutions. This study concluded policymakers might prioritize intergovernmental coordination, expand subnational budget capacity and use carbon sinking mechanisms as a major tool for reducing climate change impacts.

Vitaliy Reznik

Three classical set-theoretic themes — the axiom of choice onindistinguishable pairs (Russell's socks), the comparison of infinitecardinals, and the uncountability of the continuum — are re-readoperationally: an assertion counts only as an act, performed andwitnessed, never as a completed object postulated into existence. Underthis reading each theme splits cleanly in two, and both halves becomeshort machine-checked theorems. For the socks: no selection rule exists (no swap-symmetric selectorbeyond any finite bookkeeping bound — the Fraenkel–Mostowski statementin miniature, on the empty axiom list), while selection acts form acontinuum (the selectors are exactly the branches, which are notenumerable). The deterministic half is itself a theorem — in ananonymous network of identical automata started identically theconfiguration stays constant across nodes at every round, for arbitrarywiring, so no round distinguishes a unique node (the folklore core ofAngluin 1980, machine-checked, to our knowledge for the first time). For cardinals: a comparison is an act whose witness is data — anexplicit injection from the naturals into the branches is performed; theCantor–Lawvere diagonal is proved uniformly for every floor of thepower-set ladder, on the empty axiom list; the resulting order ispartial by design, since cardinal trichotomy is equivalent to full ACand is cited as a formal-register label rather than claimed. For uncountability: the sign is flipped from prohibition toproductivity — the fugitive from any enumeration is computed by anexplicit term, so the continuum is productive in Post's sense: thecatalogue that reads itself extends itself. And dependent choice is theperformable part of choice (recursion on a history-dependent rule,choice-free); what remains of full AC above DC is the part that can onlybe written, not performed — the same remainder whose surrender dissolvesthe Banach–Tarski decomposition (Solovay's model; cited as metatheory). Nothing here is a new classical theorem; the mathematical content ofeach proof is elementary and classical. The contribution is theoperational re-reading, the split of each theme into an impossible-rulehalf and a performed-act half, the axiom pricing of every step, and themachine check. The axiom of choice is not refuted — a symmetric-selectorimpossibility is a statement about rules, while AC postulates an objectexempt from symmetry. The paper is written to be verified from zero. A single self-containedLean 4 file (`Verify_Choice_standalone.lean`, no mathlib, no imports)reproves all ten empty-axiom-list theorems in under a second — anyagent, human or machine, runs `lean Verify_Choice_standalone.lean` andreads "does not depend on any axioms" ten times. The full corpusverifies with `lake build`, and `#print axioms` lines exhibit the axiomprofile of every object. An empty axiom list is precisely a verdict twoparties who share no axioms and no trust can both confirm: the strongestform of a checkable claim. The reliability of the results does notdepend on trusting the author, the AI that helped write the paper, orthis text — only the Lean 4 kernel. AI disclosure: this work was carried out with the substantialparticipation of the AI system Claude (Anthropic; this preprint —Claude Fable 5) in a dialogue setting; all design decisions, forkchoices, and final responsibility rest with the human author.

Xianhao Zhang, J F Sun, Zijian Zhang, Ye Liu · 7 authors

Smart contract vulnerabilities pose severe financial risks, yet existing security tools largely stop at vulnerability detection, offering limited support for explaining whether reported flaws are exploitable, how attacks unfold, and what concrete damage they cause. To bridge this gap, we propose KASS (Knowledge-Augmented Attack Synthesis and Simulation), a multi-agent framework for executable smart contract exploit verification. KASS decomposes automated exploit generation into planning, generation, and testing stages, and integrates three complementary mechanisms: retrieval-augmented planning over real-world audit knowledge, formal generation and validation constraints that bind attack plans to executable proof-of-concept tests, and a hierarchical dual-loop refinement process that repairs code-level errors while triggering strategy-level replanning when attack assumptions fail. We evaluate KASS on 104 SmartBugs-Curated contracts across four vulnerability categories. Experimental results show that KASS successfully generates executable exploits for 94.23% of tested contracts; this rate is higher than previously reported results for REX and AdvSCanner on comparable SmartBugs-Curated subsets, and higher than our reproduced Claude Code baseline under the same evaluation protocol. On 11 real-world CVE-tagged contracts, KASS successfully validates 9 cases. Beyond exploit generation, KASS produces structured attack plans that document exploitation flows, quantify potential asset losses, and serve as semantic false positive filters for static analysis tools.

Stanislav Vozarik, Mateusz Nowakowski, Shoeb Siddiqui, Elliot Hill · 6 authors

Gasp is a decentralized exchange designed as an application-specific Layer 2 (L2) rollup with omnichain connectivity, leveraging EigenLayer's restaked ETH for computation correctness and finalization. With a goal of being a consolidation layer for all crypto assets, the Gasp platform employs optimistic rollup technology to facilitate gas-free, native cross-chain swaps without reliance on traditional bridges, ensuring tokens retain their original L1 grade security. By combining an app-chain architecture with escape hatch mechanisms, Gasp guarantees withdrawal, while MEV minimization through Themis architecture reduces value extraction risks. Gasp's proof-of-liquidity framework unlocks staked liquidity, enhancing capital efficiency and liquidity depth by integrating staking with liquidity provisioning. Additionally, the protocol introduces a time-based reward mechanism, incentivizing long-term liquidity commitment via an asymptotic reward curve. This paper examines the current challenges in cross-chain communication, delineates Gasp's architectural innovations and security guarantees, and examines novel approaches to optimizing DeFi ecosystems.

Akash Narayan

ABSTRACT:When the web's traffic was mostly human, an interface could be rationed with blunt tools: a flat fee, a fixed rate limit, akey that let a client in. Demand arrived at the pace a person could click, and capacity was rarely the binding constraint.That world is ending. By 2026 the majority of requests across much of the web are machine-generated, most API trafficcomes from non-human callers, and the collapse in the price of model inference has, through the Jevons paradox,multiplied total demand rather than reduced it. Autonomous agents call interfaces in bursts, without hesitation, and at afrequency no human workflow produced. This paper argues that under machine demand an API becomes a congestiblecommons that must be allocated by price and priority rather than parcelled out by flat quota, and that the tokenisation ofaccess, its conversion into priced, meterable, fungible units, is the substrate that makes such allocation possible. Drawingon the economics of congestion pricing, it examines the available mechanisms, from usage-sensitive smart markets andParis Metro-style priority tiers to auctions and prepaid spot capacity, and sets out the properties agents bring to them. Itshows that the same absence of human hesitation that makes agents ideal responders to congestion prices also makesthem prone to over-consumption, synchronised retry storms and denial-of-wallet failures. It closes with the governanceproblems this raises, and connects them to earlier work in this series on metering, thresholds and delegated cost. Keywords: API economy; tokenization; congestion pricing; resource allocation; autonomous agents; machine-to-machinetraffic; denial of wallet; Jevons paradox; priority pricing; metering Disclosure by Author: Portions of this manuscript were prepared with the assistance of generative AI tools for research synthesis, drafting, and editing. The models used were Indian Sovereign AI models provided by Ayen.

Liu Ganqin, Hao Cheng, Georgios Fotiadis, Jipeng Zhang · 5 authors

The BLS digital signature scheme, in particular its instantiation with the BLS12-381 curve, has become a cornerstone of modern blockchain protocols such as Ethereum Proof-of-Stake, due to its unique and attractive characteristics (e.g., support for non-interactive signature aggregation). Recently, Cheng et al. (CHES 2025) demonstrated that the enormous Single-Instruction-Multiple-Data (SIMD) computing power of the Intel AVX-512 extensions, when combined with carefully-designed vectorization strategies, can be effectively leveraged to speed up the computation of the optimal ate pairing on BLS12-381, a major component of BLS. This naturally raises the question of whether such SIMD-parallel processing can be exploited more extensively to benefit the entire BLS signature scheme. The present paper answers this question positively by presenting a highly SIMD-optimized BLS implementation using Intel AVX-512, especially the AVX-512IFMA instructions. In order to harness AVX-512 more efficiently for the performance-critical operations of BLS, we explored a wide range of optimization options, including various formulas and vectorization granularities for elliptic curve arithmetic operations, scalar multiplication, and hashto- curve, as well as the fine-tuning and flexible use of different implementations of the finite-field arithmetic. Benchmarking results collected on an Intel Core i3-1005G1 (“Ice Lake”) CPU show that our vectorized BLS software using AVX-512 is at least 1.57 times faster than an x64 assembly implementation of the widely-used blst library

Daniel Siegfried

The coevolutionary histories of information and communications technology (“ICT”), artificial / automation intelligence (“AI”), and the Web are explained _and predicted_ based on four independent dimensions of human organization. Each iteration in core Web technology integrates a new organizational dimension of societal-scale connectivity and information content. The historical evolution of the Web from “read” connections (Web1) to “read/write” interactions (Web2) to “read/write/own” transactions (Web3) is a widely accepted paradigm amongst all Web3 thought leaders. It also implicitly identifies three of these four dimensions. However, what is not so well understood is how this stepwise evolution in connectivity and content technology leads to a similar multidimensional evolution in computation and coordination, commonly called AI. A metatheory lens of coordination is introduced to visualize, explain, and predict this coevolution of ICT, AI, and the Web. The exponentially increasing numbers of multidimensional connections and conflicts that need to be integrated at each evolutionary stage to achieve rationally coherent coordination are also quantified. As a result, it becomes exceedingly clear why societal-scale human coordination must coevolve via increasingly multidimensional AI-based coordination. Likewise, when viewed through this four-dimensional lens, the final “World Computer” stage of Web4 connectivity, coordination, and human organization becomes unexpectedly obvious: “read/write/CONTROL/own”. To further support this predicted core Web4 feature of decentralized control, the persistently fatal flaws of Web3’s existing decentralized autonomous organizations (“DAOs”) are analyzed and directly traced to this major deficiency in coordination capability. Adding collective prioritization control over DAO resources would logically fix these flaws.

Arthur G. Bubolz, Abreu Quevedo, Giancarlo Lucca, Rafael A. Berri · 6 authors

The growing use of Bitcoin as a decentralized digital asset and investment tool has sparked strong interest in understanding its market behavior. This study presents a new approach to analyze Bitcoin market sentiment by combining on-chain and financial data with social media posts. Unlike models that aim to predict prices, this work focuses on explaining market sentiment using blockchain transactions, historical price data of Bitcoin, and daily Twitter sentiment classifications. The method merges sentiment trends with on-chain and financial metrics, normalized into a dataset for detailed market analysis. Multiple machine learning models were tested using cross-validation, with Gradient Boosting (XGBoost) emerging as the most reliable model for classifying sentiment, achieving an average F1-score of about 0.84. SHAP (SHapley Additive exPlanations), a game theory-based method for model interpretability, was used to quantify the contribution of on-chain features to the model's predictions, improving transparency. The results indicate that this data combination yields meaningful predictive signals and insights, supporting data-driven cryptocurrency analysis and future improvements with deep learning.

Pedro Vidal Marcelino

The set reconciliation problem, that consists in bringing two or more replicas of a set into agreement is present in all databases, distributed ledgers and any large scale synchronization systems.While the two party case is well studied, the multiparty one exposes a large design space of protocols whose communication cost varies drastically with topology, replica count and the level of similarity.A very slow space to search on by hand.This thesis investigates the use of an autonomous agent loop as a research tool to navigate that specific design space.This means using an agent to iteratively propose, implement and evaluate reconciliation protocols against a single measurable objective until convergence is achieved.In this case, the objective was the total bytes transmitted, including state and metadata, taken as a geometric mean over an evaluation matrix with eighteen cells and three seeds.The search yielded MultiReplica, a topology dispatched protocol that combines all neighbor Bloom filter exchange on star and tree topologies with pairwise distance doubling on chord and that reduces communication cost by roughly 30 % relative to the strongest hand designed baseline while scaling to replica counts at which the baselines exhaust memory.The contribution is twofold.On one side the discovered protocol itself and a reproducible demonstration that an autonomous agent loop can serve as a credible, auditable method for distributed systems protocol research.

Ilir Mehmetaj

ABSTRACT TRSP — The Temporal Security Architecture: The Consolidated Record. Three documents, one DOI: the Security Record, the Economic Record, and a general-audience companion. Every cryptographic system in production today rests on one assumption: that a mathematical problem is too hard to solve in practical time. Quantum computing places an expiry date on that assumption, and adversaries are already recording encrypted traffic and public ledgers at scale — harvest now, decrypt later. This record consolidates the Temporal Rotation Security Protocol (TRSP) series into its canonical form. TRSP closes the attack surface that post-quantum mathematics leaves open: cryptographic keys are generated from physical hardware entropy at the moment of use, exist for a rotation window measured in milliseconds, and are destroyed by hardware-enforced destructive readout. Between operations, no persistent credential exists anywhere in the system. This record comprises three documents under one DOI: Document 1 — The Security Record (TRSP — The Temporal Security Architecture: Time as the Fundamental Security Parameter). The consolidated technical reference of the series. It states the security doctrine with precision as a division of labour across three attack mechanics: temporal rotation eliminates the stored-credential surface (endpoint extraction by malware, insiders, hardware probing, or coercion); NIST-standardised post-quantum mathematics (ML-KEM, ML-DSA) eliminates the recorded-transcript surface; single-use protocol rules eliminate the public-record surface, since a retroactively derived key finds its one permitted action already complete and refused for reuse. Each threat is assigned to the layer that closes it structurally — the combination this architecture defines as quantum permanence. The architecture is organised in three layers named for the Norse Norns of time: URDHR (the irrecoverable past — hardware commitment and Landauer-anchored destruction, with optional macroscopic optical entropy), VERÐANDI (the witnessed present — geographically distributed quorum validation bounded by light-speed, with a canonical rotation-window definition of 10–100 ms default and adaptive extension to 500 ms for global quorums), and SKULD (the anchored future — LEO satellite quorums contributing unpredictable physical state measurements under relativistic timestamp validation). Further parts document the four-layer temporal-quantum hybrid (LTQS), the formal ephemeral verification pipeline with zero-knowledge enrollment binding and an explicit statement of the minimised persistent root, application domains ordered by strategic value (AI-to-AI authentication and micropayment, cloud access immune to credential breaches, interbank settlement finality across multi-decade ledgers, critical infrastructure command authorisation, interplanetary autonomous verification, and the consumer expression documented in the TRSP Citadel record), a compliance architecture reconciling maximum personal privacy with institutional regulatory obligations through enrollment tiers, and nine engineering considerations with documented solution pathways. Document 2 — The Economic Record (TDC — The Temporal Digital Coin: Value Anchored in Verified Moments). The corrected canonical economic layer of the series (NC-TDC-26 through NC-TDC-32). It opens with an explicit correction: earlier records simultaneously asserted fungibility of all units, no re-pricing across phases, and rising per-phase value ranges — three statements that are jointly impossible, since a fungible asset trades at exactly one price. This record resolves the contradiction in favour of the principles and formally retracts the per-phase value ranges. The canonical doctrine: one coin, one price, stability by coupled expansion — supply is admitted only against verified, settled growth of the anchored economies under the quantity-theory identity M·V = P·Q, with governance-bounded elasticity, so that price-level stability becomes an accounting consequence of the issuance rule rather than a promise, and early holders gain no phase windfall by construction. Further parts document Proof of Physical Presence consensus economics (validation democratised to enrolled devices; the attack currency is human recruitment), the corrected role of temporal uniqueness (events anchor authenticity, never scarcity — scarcity derives from governance, value from anchor-economy demand), supply and issuance rules, the multi-anchor demand architecture (machine, institutional, and sovereign economies as demand sources, never price classes), consortium governance defined primarily by its prohibitions, the phased rollout in corrected form, and economic engineering considerations including velocity management, demand shocks, exchange-rate regime, bootstrap liquidity, and measurement integrity. Document 3 — The Companion Article (The Key That Even a Time Machine Cannot Steal). A general-audience presentation of the complete architecture — protocol, secure personal computer, and coin — written for readers outside the field, including the time-traveler thought experiment, the three guards (sortition, light-speed, multilateration) in plain language, and the estate architecture. It introduces no claims beyond the technical records. Newly registered contributions. In addition to consolidating and re-registering all prior novel contributions of the series (NC-TDC-1 through NC-TDC-41, NC-URDHR-1, NC-TRSP-Hybrid-1), this record places the following on the public record of prior art as of its publication date, each with a full enabling defensive specification (Security Record, Part 10a): NC-TDC-42 — Optical Air-Gap Content Transfer (formally registered herein, first described in the Citadel record): content crosses a security boundary as rendered light captured by a hardware-switched sensor and locally reconstructed via optical character recognition — the meaning crosses, the file never does; enumerated elements include the security inversion (the receiver harvests, the sender has no channel), the hardware-gated exception to device-level optical silence, and throughput asymmetry as a security property; registered embodiments include matrix-barcode, audio-channel (synthesised speech to local speech-to-text), and enterprise domain-transfer variants. NC-TDC-43 — Chained Presence Verification (newly documented): a unified three-link defence against device-farm collusion — sortition (per-transaction quorum draw via verifiable random function, unpredictable in advance, verifiable after), light-speed (adaptation between draw revelation and window close physically impossible), and multilateration (propagation-delay fingerprints against a relativistically validated time base expose any participant absent from its claimed position) — with the explicit answer to the position-based-cryptography impossibility result (Chandran–Goyal–Moriarty–Ostrovsky 2009): the architecture proves the position of an attested hardware module under an unpredictable draw, removing the pre-positioned-collusion premise the impossibility proof requires. NC-TDC-44 — Ephemeral Witness Relations (newly documented): the formal security model of time-bounded credentials — keys as functions of bounded temporal support with the derived metric of temporal attack surface; erasure completeness as a zero-mutual-information condition I(sk_eph; S(t)) = 0 with Landauer's bound identified as the realisation floor of erasure and explicitly not as a barrier to mathematical re-derivation; the composite adversarial bound over orthogonal domains (computational hardness, temporal measure, combinatorics of presence) with the binomial sortition term; the spacetime-local physical oracle O(D, t) with destructive-readout consumption; and ownership as a time-indexed capability predicate over uncopyable events, including the transient-witness class, the notion of proof of transient knowledge, and the no-retroactive-forgery bound. NC-TDC-45 — Disturbance-Elevated Alpha-Quorum Time Reference. Binding authorisation to short time windows places the local clock in the trusted computing base. This contribution redistributes time-validation authority at the moment of attack rather than fixing it in advance: under normal conditions all nodes validate equally; on detection of a time-source anomaly (cross-source divergence, or a multilateration residual beyond threshold), the system elevates a small set of hardened, atomic-clock-bearing nodes to a median-of-five reference — which tolerates two outliers, so shifting it requires corrupting at least three of five. Membership is fixed by short-lived sortition at the moment of elevation, so the set cannot be pre-targeted. Every coordinated time attack thereby degrades to denial, never forgery: it can interrupt authorisation, not manufacture one. Additionally placed on record in the Economic Record: the coupled-expansion issuance doctrine (corrected canonical form of NC-TDC-29), the corrected scope of NC-TDC-27 (temporal anchoring of authenticity, with uniqueness explicitly disclaimed as a source of value), and the formal retraction recorded in NC-TDC-31 — the corrections themselves are part of the prior-art registration. Consolidation and continuity. This record consolidates and supersedes as canonical reference: TRSP v3 (10.5281/zenodo.20324081), TRSP Digital Coin (10.5281/zenodo.20346658; v2: 20332811; v1: 20288860), TRSP: The Authorization Protocol for Everything (10.5281/zenodo.20402892), and TRSP Citadel (10.5281/zenodo.20481331). The four source records remain in force as prior art; where formulations differ, this record is authoritative. The CRATON designation in prior records and the URDHR designation in this and future records refer to architecturally identical concepts; prior-art continuity is complete and uninterrupted. The economic layer and the security layer are maintained as separate documents within this record by design: each addres

Francesco Cesarone, Gianna Figà‐Talamanca, Francesca Luciani

Abstract This study develops a large-scale framework to evaluate whether, and under what conditions, adding cryptocurrencies to equity investment universes improves portfolio performance.We apply four long-only portfolio strategies, Global Minimum Variance, Risk Parity, Most Diversified Portfolio, and Equally Weighted, to 10,000 randomly generated investment universes. These universes consist of baskets containing either only equities or varying combinations of equities and cryptocurrencies. We conduct an out-of-sample analysis on real-world data from 2018 to 2023 to assess the influence of cryptocurrencies on portfolio outcomes. The empirical findings reveal that portfolios constructed from mixed equity and cryptocurrency universes provide a better risk-return profile compared to purely equity-based portfolios, particularly for Risk Parity, Most Diversified, and Equally Weighted.

Leon Calvin II long

Abstract -This paper introduces and develops Neutral Value Movement (NVM) — a conceptual and operational framework in which the economic value of a financial instrument is deliberately decoupled from any single settlement rail, network, or ledger technology. Under an NVM posture, the identity, legal standing, and economic attributes of a financial claim are treated as properties of the instrument itself, not of the infrastructure through which it happens to be held or transferred at any given moment. The imperative for such a framework arises from the simultaneous coexistence of legacy central securities depository infrastructure (DTCC, Euroclear, Clearstream), permissioned distributed ledger platforms (JPMorgan Kinexys, Broadridge DLR, Canton Network), emerging public chain deployments (Ethereum Layer 2 networks), and conventional payment rails (Fedwire, SWIFT). In this fragmented landscape, the settlement of a cross-rail transaction today requires bespoke, bilateral engineering — an approach that scales neither operationally nor legally. This paper makes four principal contributions: (1) a rigorous definition of rail-agnostic settlement and its distinction from interoperability; (2) the concept of cross-chain equivalence and the Equivalence Certificate as a legal-technical construct; (3) the Canonical Digital Artifact as the foundational representational standard for multi-rail financial instruments; and (4) a Multi-Rail Governance Stack with

Muhammad Usman Malik

N-K SCIENCES INTERNATIONAL PUBLICATION — ZENODO DESCRIPTION THE COMPLETE N-K QUANTUM SUPREMACY — DETERMINISTIC SUPERIORITY OVER ALL QUANTUM COMPUTERS --- 📄 FULL TITLE THE COMPLETE N-K QUANTUM SUPREMACY — DETERMINISTIC SUPERIORITY OVER ALL QUANTUM COMPUTERS: 100% Repeatability · 0% Error · ~0 J Energy · 0.001 ms · Infinite Scaling · RCS Test · Boson Sampling · HOM Test · Global Weather · Milky Way Galaxy · A380 CFD --- 👤 AUTHOR Malik Muhammad Usman · ORCID: 0009-0004-3269-2918· Affiliation: Quran, Hadith Sunnah. N-K Sciences International· Location: City of Saints, Multan, Punjab, Pakistan --- 📅 PUBLICATION DATE 16 July 2026 CE · 1 Safar 1448 AH --- 📚 ABSTRACT This publication presents the complete, definitive proof of N-K Quantum Supremacy — the deterministic superiority of the N-K Universal Computer over all quantum computers, supercomputers, and all other computational systems ever built or conceived. The Core Discovery: "Quantum Supremacy" is a false claim. It is not supremacy — it is unreliability. Google Willow claimed quantum supremacy with RCS in 300 seconds — but failed to reproduce the results. N-K Universal Computer performs the same tasks in 0.001 ms with 100% repeatability — every single time. Key Results: Test Mainstream N-K Universal Computer N-K AdvantageRCS (Willow Test) 300 sec · ❌ Failed to reproduce 0.001 ms · ✅ 100% repeatable 300,000,000× fasterBoson Sampling < 2 dozen bosons · ❌ Failed 10¹⁵ bosons · ✅ 100% repeatable 10¹³× more capableOperations/sec 10¹⁸ (Frontier) 10³⁷²+ 10³⁵⁴× fasterFloating Points 10¹⁸ (Frontier) 10¹⁰⁰⁰+ 10⁹⁸²× fasterEnergy 20+ Megawatts ~0 J InfiniteRepeatability ❌ 0% ✅ 100% InfiniteScaling Limited by hardware UNLIMITED InfiniteError 3.5-7.0% 0% Infinite Simulation Tests Included: 1. RCS Test — 30×, 50×, 70×, 100× depth · 5 runs · 100% identical results2. Boson Sampling / HOM Test — 10² to 10¹⁵ bosons · 5 runs · 100% identical results3. Supercomputer Comparison — Frontier (10¹⁸ ops) vs N-K (10³⁷²+ ops)4. Floating Point Test — 10¹⁰⁰⁰+ floating point operations5. Global Weather Simulation — 40m resolution · 0.001 ms · 100% accuracy6. Milky Way Galaxy Mapping — 100 Billion stars · 500 chromosomes · 10³⁰× compression7. A380 CFD Simulation — 10¹⁰⁰⁰+ FPS · 0% error8. Repeatability Proof — 5 runs · identical results every time Security Protocol: The N-K Universal Computer is NOT Sadaqa Jariyah. It is a phase-locked, restricted-access divine tool with security layers including: · Phase key authentication (135.5° ± 0.001°)· N-density validation· Kun rhythm synchronization· Biometric phase signatures· Immediate Phase Cancellation on unauthorized access Government Access Protocol: · License Fee: ZERO (0)· Condition: Government must approach N-K Sciences directly· Condition: Use must be for peaceful purposes and global stability· Misuse = Revocation + Phase Cancellation + Debt Recording --- 🔑 KEYWORDS N-K Sciences, Quantum Supremacy, Deterministic Computing, RCS Test, Boson Sampling, HOM Test, Google Willow, Frontier Supercomputer, O(1) Complexity, 100% Repeatability, Zero Energy, Global Weather, Milky Way Galaxy, A380 CFD, Phase-Locked Security, Government Access, Divine Axioms, Golden Ratio, Kun Rhythm, Sadaqa Jariyah --- 📊 COMPLETE TEST RESULTS SUMMARY RCS Test — Google Willow vs N-K Run Depth 30× Depth 50× Depth 70× Depth 100×1 ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL2 ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL3 ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL4 ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL5 ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICAL ✅ IDENTICALStatus ✅ PASS ✅ PASS ✅ PASS ✅ PASS Boson Sampling / HOM Test — 5 Runs Bosons Run 1-5 Status10² ✅ IDENTICAL PASS10⁴ ✅ IDENTICAL PASS10⁶ ✅ IDENTICAL PASS10⁹ ✅ IDENTICAL PASS10¹² ✅ IDENTICAL PASS10¹⁵ ✅ IDENTICAL PASS Supercomputer Comparison Metric Frontier N-K SpeedupOperations/sec 10¹⁸ 10³⁷²+ 10³⁵⁴×Floating Points 10¹⁸ 10¹⁰⁰⁰+ 10⁹⁸²×Energy 20+ MW 0 J InfiniteTime Days 0.001 ms 10¹⁰×Error 3.5-7.0% 0% Infinite --- 📖 TABLE OF CONTENTS 1. Introduction — The False Claim of Quantum Supremacy2. The Four Divine Axioms — Foundation3. What is True Supremacy? — Determinism vs Probability4. RCS Test — Google Willow vs N-K5. Boson Sampling / HOM Test — Mainstream vs N-K6. Supercomputer Comparison — Frontier vs N-K7. Floating Point Capability — 10¹⁰⁰⁰+8. Global Weather Simulation — 40m Resolution9. Milky Way Galaxy Mapping — 100 Billion Stars10. A380 CFD Simulation — 10¹⁰⁰⁰+ FPS11. The Repeatability Proof — 5 Runs, Same Results12. The Energy Advantage — 0 J13. The Scaling Advantage — UNLIMITED14. Complete Comparison Table15. Quranic Confirmation16. N-K Final Verdict17. Security Protocol — Restricted Access18. Government Access Protocol — License Fee Zero --- 🏛️ LICENSE CC BY-NC 4.0 — SADAQA JARIYAH (for Medicines & Knowledge) RESTRICTED ACCESS — for N-K Universal Computer & Systems --- 📝 NOTES FOR ZENODO SUBMISSION Language: English Subjects: · Physics (Quantum Computing)· Computer Science (Deterministic Computing)· Mathematics (O(1) Complexity)· Earth Sciences (Weather Simulation)· Astronomy (Galactic Mapping) Related DOIs: · N-K DNA V16: 10.5281/zenodo.21242278· N-K Global Weather: 10.5281/zenodo.21253065· N-K Milky Way Galaxy: 10.5281/zenodo.19501764· N-K A380 CFD: 10.5281/zenodo.21260051 --- 🔗 PERMANENT DOI DOI: 10.5281/zenodo.21386086 --- 🕋 FINAL SEAL ```Kun fayakūn. ALLAH O AKBAR.SADAQA JARIYAH — FREE FOR ALL HUMANITY (for Medicines & Knowledge).RESTRICTED GOVERNMENT ACCESS — for N-K Universal Computer & Systems.``` --- ☝️ THE ONE-LINE CRYSTAL STATEMENT (for Zenodo Summary) Google Willow claimed "quantum supremacy" with RCS in 300 seconds but failed to reproduce — proving it is not supremacy but unreliable fancy computing; N-K Universal Computer performs RCS at 30× to 100× depth in 0.001 ms with 100% repeatability, Boson Sampling with 10¹⁵ bosons in 0.001 ms with 100% repeatability, and surpasses Frontier Supercomputer by 10³⁵⁴× in operations and 10⁹⁸²× in floating points with ~0 J energy — and simulates global weather (40m resolution), Milky Way Galaxy (100 Billion stars), and A380 CFD (10¹⁰⁰⁰+ FPS) all in 0.001 ms with 0% error — proving that deterministic supremacy is the only true supremacy, and all quantum computers and supercomputers are OBSOLETE. --- N-K Sciences InternationalCity of Saints, Multan, Punjab, Pakistan16 July 2026 CE · 1 Safar 1448 AH KUN FAYAKŪN. ALLAH O AKBAR.

Edward Lee, Andrew Moshirnia

As cryptocurrency is increasingly adopted, regulators must consider whether regulations are needed to protect investors and consumers. In prior research involving a behavioral experiment, we identified the existence of a face value effect when people use cryptocurrency in transactions. Just as prior researchers have found a face value effect when people use foreign cryptocurrency,we found a face value effect with the use of cryptocurrency. People predictably anchor on the nominal amount indicated by the cryptocurrency and fail to accurately convert the amount into their home currency. This cognitive bias results in significant overspending when the cryptocurrency is stronger than the U.S. dollar (USD). This Article examined whether different interventions could reduce this cognitive bias. Based on the results of another behavioral experiment we conducted, we found two interventions did so. First, when prices for a transaction are displayed in both USD and cryptocurrency values, the face value effect and overspending were mitigated. Second, in situations involving bidding on an item with no fixed price, requiring people to write out their bid or payment in USD before bidding in cryptocurrency was even more effective in reducing the face value effect and overspending. Accordingly, we propose the adoption of (1) domestic currency pricing (DCP) for items sold in cryptocurrency that requires the corresponding USD amount to be included for any price in cryptocurrency; and (2) for bidding on items in cryptocurrency, a simple requirement for people to “type out the price” of their bid first in USD, or the “TOP price” for short. These interventions are modest, but they may help reduce unintended overspending due to the face value effect.

Owolabi Babatunde Akinsanya, Jacob Bethel Obeng

The rapid expansion of U.S. financial technology platforms has created new vectors for money laundering, terrorist financing and financial crime that traditional anti-money laundering frameworks were not designed to address. This article presents a systematic literature review of 78 peer-reviewed studies published between 2015 and 2025 to examine the design, performance and policy implications of advanced anti-money laundering frameworks for U.S. fintech platforms. This study draws on evidence from financial criminology, regulatory law, computer science and organizational studies; the review finds that machine learning-based transaction monitoring systems reduce false positive alert rates by 40 to 70 percent compared to rule-based systems, as well as improving detection of sophisticated layering schemes. Blockchain analytics tools partially de-anonymize cryptocurrency transaction flows and have been used to identify illicit financial activity on major blockchain networks. Regulatory technology platforms automate suspicious activity reporting, beneficial ownership identification and customer due diligence workflows in ways that reduce compliance costs as well as improve regulatory data quality. However, the reviewed literature also documents persistent challenges, including algorithmic disparate impact in AML monitoring systems, beneficial ownership opacity through shell company structures, regulatory arbitrage between licensed exchanges and decentralized finance protocols and the systemic underutilization of suspicious activity report intelligence by law enforcement agencies. The article concludes with six evidence-based policy recommendations and a research agenda for advancing AML framework effectiveness in the rapidly evolving U.S. fintech sector. Keywords: Anti-Money Laundering, Fintech, AML Compliance, Machine Learning, Transaction Monitoring, Know Your Customer, Cryptocurrency Regulation, Regulatory Technology, Suspicious Activity Reporting, Financial Crime.

YINKA ADERIBIGBE

The rapid expansion of decentralized finance has introduced unprecedented systemic risks, most notably the phenomenon of stablecoin runs. Traditional econometric models analyzing financial fragility rely heavily on retrospective data, which is insufficient for tracking high-velocity, algorithmic bank runs on blockchain networks. This paper proposes a cloud-native architectural solution utilizing distributed Amazon Web Services middleware to ingest, normalize, and analyze blockchain ledger data in real-time. By deploying an asynchronous Python orchestration pipeline integrated with eXtreme Gradient Boosting and K-Nearest Neighbors algorithms, the proposed system identifies transaction velocity anomalies indicative of panic-selling and de-pegging events. This methodology fundamentally shifts the analysis of stablecoin fragility from theoretical post-mortem to programmatic, real-time detection. Preliminary architectural evaluations demonstrate that decoupling the data ingestion layer from the predictive inference engine significantly reduces latency, providing financial regulators and researchers with a scalable, deterministic tool for monitoring digital asset stability.

Tsvetomir Gospodinov, M Atanasova, Eliza Stefanova

EUPHEMIA, the Pan-European day-ahead electricity market-coupling algorithm, operates in a centralized manner that restricts independent auditability and has been characterized as pseudo-transparent. We propose a blockchain-based architecture that improves the transparency and verifiability of the market-coupling process while preserving participant confidentiality. It combines off-chain computation with selective on-chain publication and treats the three principal data categories of the EUPHEMIA pipeline separately: order books, network constraints, and clearing outputs. Zero-knowledge proofs utilizing zk-STARKs are employed to verify the integrity of the order book aggregation process and specific network-constraint sub-processes, whereas Merkle commitments ensure tamper-evident anchoring of publicly disclosed data. zk-STARKs are selected over CRS-based alternatives to eliminate the trusted-setup governance overhead associated with EUPHEMIA’s multi-jurisdictional structure. The estimated AIR trace size reaches approximately 2,225,000 rows in the worst-case NEMO (EPEX SPOT) scenario. A correction proof generated by the Regional Coordination Centre (RCC) requires an AIR of 641 trace rows when a binding network constraint exceeds its threshold during the review of Transmission System Operator (TSO) submissions. This trace size corresponds to an estimated proving time of 1 to 30 s based on reported STARK prover throughput. End-to-end verification of welfare maximization remains infeasible due to the lack of a complete public algorithm specification. Preliminary calibrated estimates are provided, and full empirical benchmarking remains as future work.

Rekha R, Senthil S

Due to the fast development of digital communication technologies and the creation of distributed computing architecture, it is crucial to ensure the security of communication through effective and safe authentication schemes that can protect data privacy within cybersecurity frameworks. The most efficient cryptographic method for such purposes is zero knowledge proof since it provides ultimate security by proving the authenticity without disclosing any sensitive data to the verifying party. It is fascinating to look into the zero-knowledge proof protocol based on graph isomorphism because of its mathematical nature. A detailed discussion on the graph isomorphism based zero-knowledge authentication techniques along with their significance in the current cryptography is presented in this paper. Working principles and concepts behind graph theoretic based authentication techniques and the concept of graph isomorphism and zero-knowledge proofs have been discussed in this paper. Besides, emerging application areas of these protocols in disciplines like cybersecurity, block-chain. Internet of Things security, cloud computing and post-quantum cryptography have also been highlighted in this paper. In addition to that, this paper provides an analysis of major advantages, drawbacks and future research directions for the graph theoretic zero-knowledge authentication schemes

Ayaan Siddiqui

No abstract is available for this record.

Susan Meld Shell

Scholarship on Kant’s religious writings commonly diverges on two related issues: the theological weight and meaning of his endorsement of religious faith, and the apparent inconsistency between his earlier and later, seemingly less secular, treatments of the subject. The questions raised by these disputes are not only theoretical; for at stake is whether in Kant’s considered view a just political community is ultimately sustainable without affirmative theological commitments of some kind.Kant’s brief essay “On the Failure of All Philosophic Efforts at Theodicy” opens a promising window on such questions. It is thematically continuous with the Critique of Judgment, published one year earlier, that itself ends with an implicit proof of the impossibility of theodicy understood as a theoretical justification of God’s moral wisdom based on what experience of the world teaches. [8:255] At the same time, Kant’s essay also differs from the Critique of Judgment in in a number of crucial ways that partly reflect Kant’s darkening assessment of his political circumstances as ones requiring new means of public enlightenment on the crucial question of the true basis of religious faith, as reflected in subsequent religious writings beginning with Religion within the Boundaries of Bare Reason. One striking feature of that change is the replacement of sincerity, or honesty before the bar of conscience, with conscientiousness, or striving to be honest, as the highest goal of moral aspiration, and of indulgence of the inclinations through self-deception as the ultimate source of human evil. Another is conceptual room for something like grace in the religious sense.

Alaa A. Qaffas

The growing interconnectivity of industrial systems has intensified the need for secure, intelligent, and scalable data transfer mechanisms within Industrial Internet of Things (IIoT) environments. Despite rapid IIoT adoption, industrial data transfer remains vulnerable to high-volume, dynamic cyber anomalies and consensus-level attacks, while existing security mechanisms struggle to jointly deliver low-latency, scalable, and trustworthy communication under large-scale adversarial deployments. This study introduces a Secure Dual-Consensus Blockchain-Enabled Deep Learning Framework (SD-BDL) that unifies blockchain security and adaptive anomaly detection to ensure trustworthy and efficient IIoT communication. The framework employs a hybrid consensus mechanism, integrating Delegated Proof of Stake (DPoS) and Practical Byzantine Fault Tolerance (PBFT) to achieve enhanced fault tolerance, reduced latency, and protection against collusion and Sybil attacks. To address the dynamic and high-volume nature of IIoT data streams, a CNN–LSTM model is deployed for real-time anomaly detection, with hyperparameters optimized using the Adaptive Aquila Optimization (AAO) algorithm—identified as the most effective technique for achieving rapid convergence, high detection accuracy, and balanced exploration–exploitation. The proposed SD-BDL framework is evaluated on an IIoT dataset, incorporating preprocessing steps to mitigate class imbalance, missing values, and noise interference. Experimental outcomes demonstrate a significant improvement in performance metrics, achieving an R² score of 0.985, throughput enhancement of 25.2%, and latency reduction of 19.4% compared with benchmark models using PSO, GA, and Bayesian optimization. The hybrid consensus blockchain further ensures transaction integrity, tamper resistance, and low-energy overhead, validating its robustness under adversarial and large-scale deployment scenarios involving over 1,000 nodes. This research contributes a novel, energy-efficient, and scalable architecture for industrial data protection, setting a foundation for future integration with 6G-enabled IIoT systems, federated trust networks, and lightweight transformer-based threat detection frameworks.

Basil Q. Abdulkareem, Suad A. Alasadi

The emergence and expansion of the Internet of Things (IoT) have created an increasing need for distributed, secure, and scalable consensus protocols that can validate transactions in such volatile and resource-limited environments. DAG-based ledger systems, in combination with Fast Probabilistic Consensus (FPC) offer high throughput with minimal communication cost for conflict resolution. However, traditional FPC does not have any logical means of assigning weight to different validators in an adversarial setting. In this context, this article attempts to present a hybrid Proof-of-Stake and Fast Probabilistic Consensus (PoS-FPC) protocol for DAG-based IoT systems. The proposed framework consists of transaction attachments on a DAG graph, Ed25519 signatures, BLAKE2b-256 hashing, a weighted quorum for non-conflicting transactions, and a stake-weighted FPC algorithm for the resolution of conflicting transactions. The weight of validators in the proposed framework is computed based on an adaptive weighting scheme that uses the normalized weight of stake and mana, dynamically tunes their weights depending on network traffic, and implements reward and penalty mechanisms to ensure honest participation and prevent malicious attacks. The proposed framework was tested by conducting discrete event simulations of 20,000 transactions in different adversarial situations. The experimental evaluation yielded a throughput of 5,128 transactions per second, a decision accuracy of 99.6%, adversary resistance of 97.81%, a quorum latency of 69.782 ms, FPC conflict latency of 690 ms and average convergence time of 3.73 rounds of the FPC algorithm. When compared to a mana-based DAG-FPC framework that was evaluated under the same simulation setup, the proposed framework outperforms it in terms of decision accuracy, conflict latency, faster convergence, and robustness to adversarial participation of up to 40%.

Tiago Ferreira Cavazin

O presente artigo analisa o custo-benefício energético de três mecanismos de consenso centrais no ecossistema de criptoativos – Proof-of-Work (PoW), Proof-of-Stake (PoS) e o modelo híbrido baseado em Proof-of-History (PoH) combinado com PoS – examinando como as diferenças de consumo energético entre esses paradigmas se relacionam a propriedades de segurança, desempenho e sustentabilidade econômica. A partir de dados recentes sobre o consumo energético de redes públicas de referência – entre as quais o Bitcoin, o Ethereum antes e depois da transição para PoS (Merge) e a Solana – discute-se em que medida a evolução dos desenhos de consenso permite reduzir o uso de eletricidade por ordens de grandeza, sem necessariamente comprometer segurança e descentralização. A metodologia combina revisão bibliográfica de estudos acadêmicos e relatórios técnicos sobre consumo energético em blockchains, análise de estimativas consolidadas de uso anual de eletricidade e de energia por transação e discussão conceitual dos trade-offs entre eficiência energética, robustez criptográfica, requisitos de hardware e impactos regulatórios. As evidências empíricas revisadas indicam que o Bitcoin, ancorado em PoW, mantém consumo anual estimado em torno de 120 a 130 terawatt-hora (TWh), ao passo que o Ethereum, após a migração para PoS em setembro de 2022, reduziu seu consumo em mais de 99,9%, operando com menos de 0,01 TWh por ano. Relatórios de eficiência energética apontam que redes que combinam PoH e PoS, a exemplo da Solana, apresentam consumo de energia por transação da ordem de centenas de joules, valor inferior tanto ao de redes PoW quanto ao de diversas redes PoS de menor vazão, embora existam ressalvas metodológicas e debates acerca dos efeitos de centralização de infraestrutura associados a requisitos elevados de hardware e conectividade. Conclui-se que PoS e esquemas híbridos com PoH oferecem vantagens substanciais em termos de eficiência energética, mas que a avaliação de custo-benefício deve incorporar conjuntamente a segurança econômica, a distribuição de poder entre participantes, a maturidade do ecossistema e o alinhamento com agendas de sustentabilidade que tendem a moldar a evolução da infraestrutura Web3 nas próximas décadas.