Blockchain Papers

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.

Sachin Kumar, Manish Kumar

This article aims to examine how the metaverse is reshaping business and management by providing a review of existing literature, identifying critical research gaps, and proposing a novel conceptual framework—the Metaverse Ecosystem Model—that integrates technological, human, and sustainability dimensions with strategic business outcomes in the Web3 era. The article will embrace a conceptual knowledge and literature review that articulates conceptual underpinnings, marketing and consumer behaviour, sectoral uses, and sustainability/workforce/boundaryless futures. This was synthesised directly into the creation of the Metaverse Ecosystem Model that connects three pillars (technological infrastructure, workforce skills, and energy and sustainability) to the business opportunities, challenges, and quantifiable results. The review shows that, although the metaverse can be used to conduct immersive marketing, operational efficiency via digital twins, sustainable industrial use, and inclusive development in emerging economies, the studies are disjointed and siloed. Among the critical areas of gaps, there are the lack of integrated frameworks between the foundational enablers and outcomes and the scarcity of empirical focus on long-term sustainability and workforce readiness. The suggested Metaverse Ecosystem Model fills these gaps by showing causal relationships between the three pillars via opportunities and constraints to innovation, new business models, and high customer engagement. It represents the first comprehensive framework of the ecosystem, specific to business and management, which provides managers and policymakers with a useful roadmap to responsible adoption.

Yuhao Li, Elaine Shi, Mengqian Zhang

Blockchains have popularized the Automated Market Makers (AMMs), where users trade crypto-assets directly with a smart contract, governed by a pricing function embedded in the contract's code. Today, users of AMMs are often forced to accept unfavorable prices due to widespread front-running and back-running attacks, commonly known as Miner Extractable Value (MEV). Several earlier works show impossibility results suggesting that completely removing MEV at the consensus layer is impossible, partly because the consensus layer is agnostic of application-level semantics. For this reason, more recent works have advocated mechanism design approaches at the application (i.e., smart contract) level. We study a natural two-asset AMM mechanism design problem recently initiated and explored in prior work by Chan, Wu, and Shi, in which they proposed a mechanism that satisfies a surprisingly strong notion of incentive compatibility (IC), under the consensus assumption that the underlying blockchain provides sequencing fairness. In this paper, we investigate the (in)feasibility of simultaneously achieving IC and other desirable properties such as weak local efficiency (wLE) and uniform pricing (UP). At a high level, wLE requires that the mechanism should not leave any unfulfilled demand from users whose asking prices are not overly restrictive, and whose orders could have been executed directly against the pool. UP requires that all orders that get (partially) executed must trade at the same exchange rate. We unveil the underlying mathematical structure of AMM mechanism design, and our main results can be summarized as a trilemma-style theorem: among the desirable properties IC, wLE, and UP, any two out of three are possible, but no mechanism can satisfy all three.

Onur Eren Arpaci, Florian Kerschbaum, Sujaya Maiyya

Encrypted cloud storage can hide data contents but still leak sensitive information through access patterns. ORAM addresses this by hiding access patterns, but existing ORAM systems are too inefficient to deploy in practice. We present Cloak, an oblivious storage system that dramatically improves performance by leveraging a simple, widely observed property of real workloads: temporal locality, where recently accessed items are more likely to be accessed again soon. Instead of trying to make server accesses look perfectly uniform, Cloak makes server traffic follow a fixed, "recentness-biased" pattern and then uses real queries to fill as much of that traffic as possible. When the workload exhibits temporal locality, Cloak achieves overheads as low as $1.1\times$ over a non-oblivious and unencrypted baseline. Importantly, this heuristic affects only performance, not security. We evaluate Cloak on Netflix click-stream and Ethereum transaction traces, achieving 165,000 and 157,000 operations per second, respectively, on a single machine.

Deep Nath, Paolo Tasca, Nikhil Vadgama, Marco Alberto Javarone

Quantifying structural stress in transaction networks requires metrics that capture structural organization beyond transaction volume alone. In this work, we introduce the Inefficiency Metric, a deterministic indicator designed to characterize the routing structure of capital flows in decentralized systems. Using Principal Component Analysis and Pearson correlation matrices computed from a six-year Hedera transaction dataset, we identify two dominant and largely independent structural dimensions: the effective diameter, related to the spatial extension of transaction propagation, and the closeness centrality, associated with the efficiency of network-level flow processing. The proposed metric reveals significant topological fluctuations associated with major macroeconomic and ecosystem-level events. Increased inefficiency is observed during periods marked by intermediary fragmentation or rapid smart-contract expansion, whereas lower inefficiency corresponds to phases of network compaction during market stress or institutional concentration. Comparison with a seven-dimensional Isolation Forest approach shows that the metric effectively captures severe multidimensional anomalies while preserving a clear structural interpretation. Overall, these results provide a physics-inspired framework for relating the large-scale organization of decentralized transaction networks to observable economic dynamics.

CHRISTINE MWENDE KIMUYA

This study presents a comparative analysis of the devolution of education governance between Makueni County in Kenya and Ontario, Canada, focusing on governance structures, funding mechanisms, and educational outcomes. The paper analyzes the various challenges and opportunities posed by decentralization in both regions, with a focus on differences in administrative resources, the distribution of central funds, and local government performance; Others are more systemic within the childhood education environment, for example Makueni County is still quite a long way behind Ontario in terms of fully (for the most part) functioning decentralized education systems, check out the comparative in terms of sustainable or reliable governance models, funding mechanisms and local autonomy, the other perhaps is regional segregation as certainly Makueni County has some overarching larger issues beyond just early childhood development e.g. the funding issues and deployment issues of teachers, but these perhaps can be attributed to the ongoing issues with devolution within Kenya and indeed with human capital in this region more broadly. Employing a mixed-methods research design including policy analysis, interviews and analysis of secondary data, the study examines the impact of devolution on educational outcomes. Results suggest that Makueni promotes more local participation but faces challenges with institutional functionality and fair financing, contrary to the Model of Ontario, which shows a much higher levels of efficiently, equity and accountability. The paper then ends with policy recommendations for Makueni, and suggesting to implement ones from Ontario´s decentralized system that could be a solution for Makueni missing in governance, financial, and education standards.

Benjamin P. Duncan

PARALLAX-5 is a transition-level obligation interface for value-bearing decentralized systems. The interface consists of five primitive obligations: value conservation, authorization closure, signature integrity, temporal distinctness, and external-attestation trust. Under an explicit security-interface adequacy condition, every trust-base-respecting loss-inducing transition has a non-empty violation signature; the claim is falsifiable by basis counterexamples that are precisely defined. The substrate composes with a production EVM semantics via a typeclass-based refinement: nineteen abstract theorems lift to compiled Lean 4 proof terms over EvmYulLean's EvmYul.EVM.State (Cancun fork). The Lean 4 module compiles to 95 theorems with zero sorry; 129 Python fire tests pass across three suites; a 53-incident empirical catalog (2016–2026, $5.97 billion aggregate losses) classifies each entry by minimum observability set. The package also defines a step-secure execution-time shield, an AI-Agent Containment Theorem, a five-component PARALLAX-CROPS trust-surface vector, a 19-field machine-checkable certificate schema with seven-state lifecycle, an onchain certificate registry (Solidity 0.8.24, live on Sepolia at 0x8015A98dF9037Cd79a03B291a6fF3C2841992D5b), and three worked examples covering value conservation, bridge attestation, and AI-agent runtime gating. The standard text is dedicated under CC0 with structurally irrevocable non-capturability commitments; code artifacts are released under Apache-2.0; this paper is licensed under CC-BY 4.0. v1.0.1 changes (vs v1.0.0, doi:10.5281/zenodo.20400525): repository-hygiene release. Removed four non-substrate subsystems (hse, product, economics, chronos) that were not paper-aligned. Standardized fire-test count from 134 to 129 to reflect the cleaned codebase. Restructured standalone specifications under docs/ directory with canonical names (CHARTER.md, FORK_PROTOCOL.md, CERTIFICATE_SCHEMA.md, etc.). Converted forge-std to a proper git submodule. Added CITATION.cff, CHANGELOG.md, CONTRIBUTING.md, SECURITY.md. The substrate's mathematical content, theorems, and verification gates are unchanged from v1.0.0.

Inseong Jeon, Sundeuk Kim, Hyunwoo Kim, Hoh Peter In

<title>Abstract</title> As Solidity becomes the dominant language for blockchain smart contracts, efficient debugging grows increasingly critical. However, current Solidity debugging remains inefficient: developers must compile, deploy, set up transactions, and step through execution line-by-line to examine each variable. This process is too slow for practical use. To address this challenge, this paper presented SolQDebug, the first interactive source-level debugger for Solidity that delivered millisecond feedback directly on source code. Developers specify input value ranges through annotations and compare them against abstract interpretation results, thereby enabling exploration of contract behavior across multiple execution paths. SolQDebug was evaluated on 30 real-world functions from DAppSCAN, achieving 350$\times$ faster debugging (0.15s vs. 53s per function) than Remix IDE. The evaluation provided debugging insights: overlapping annotation patterns improved precision in most Solidity debugging scenarios, while analysis of diverse loop patterns demonstrated improved convergence while preserving soundness guarantees. These results demonstrated that SolQDebug enabled interactive debugging for Solidity development.

Satoshi Kawauchi

This paper proposes a next-generation edge measurement and control system that integrates physical sensors, virtual sensors, generative AI, high-precision simulation, stochastic resonance, dynamic reconfigurable hardware, legal compliance engines, distributed ledgers, and Fail-Legal control. By combining real and virtual data, the system compensates for sensor failure, noise, sampling limits, communication degradation, and regulatory changes in real time. Its core concept is to shift control from “measure → judge → act” to “predict → verify → legalize → control → prove,” enabling safer, legally compliant, evidence-driven operation through Quantum Thought Circuit OS ASI.

Elli Androulaki, Marcus Brandenburger, May Buzaglo Rosenbaum, Angelo De · 12 authors

The adoption of Distributed Ledger Technology (DLT) for critical financial infrastructures like Central Bank Digital Currencies (CBDCs) is hindered by a significant performance gap. Permissioned blockchains such as Hyperledger Fabric, which are conceptually suitable and have become popular platform used in many production deployments today, are nevertheless limited by architectural bottlenecks. Their monolithic peer design and consensus mechanisms prevent them from achieving the required scale for such demanding applications.

Lev Goukassian

This paper provides the rigorous engineering specification for the Ternary Logic (TL) Smart Contract Execution Layer, defining deterministic rules for all state transitions within the constitutional triadic model: Proceed (+1), Epistemic Hold (0), and Refuse (1). The Epistemic Hold is specified as the fail-closed default state, returned by TL_Evidence_Vault.getTransactionState() for any transaction whose evidence has not yet been archived, making uncertainty constitutionally visible rather than operationally invisible. The specification defines three forbidden transitions: Epistemic Hold to Epistemic Hold re-resolution, direct Refuse to Proceed, and direct Proceed to Refuse. Resolution of the Epistemic Hold to either Proceed or Refuse requires Stewardship Custodian quorum attestation of nine of eleven members. The Dual-Lane Latency Architecture is specified with a 2ms WCET hard ceiling at the 99.99th percentile for the Inference Lane and a 300ms hard ceiling with 50ms jitter maximum for the Governance Lane. The No Log = No Action invariant is enforced across five independent layers culminating in the on-chain terminal gate at TL_Ledger_Core.registerPermissionToken, which reverts NLNAViolation if the logHash is not provably included in an anchored Merkle root. The Smart Contract Treasury fee architecture is defined as governance parameters labeled Nomination 2026, establishing permissionTokenFee and archiveEvidenceFee as Tri-Cameral Joint-Approval variables rather than hardcoded constants. The Epistemic Hold carries no fee by constitutional design. The specification includes the Triple-Entry Accounting model extending traditional double-entry with a third cryptographically secured entry recording justification and context, Role-Based Access Control implementation patterns, the complete use case library spanning financial services, sustainable finance, supply chain, and decentralized governance, and a full Glossary of Terms establishing the canonical V2.0 vocabulary of the TL framework.

Lev Goukassian

This paper presents the governance architecture for the Ternary Logic (TL) Smart Contract Constitutional Suite, introducing the Tri-Cameral model as the institutional framework for distributed constitutional authority. The central thesis is that governance in TL is not management but rule enforcement over the rule enforcers. The Technical Council of nine members holds exclusive proposal rights and cannot exercise veto authority. The Stewardship Custodians of eleven members hold binding constitutional veto authority and cannot originate proposals. The Smart Contract Treasury operates autonomously under code governance with no admin key, collecting TL service fees as governance parameters established at Nomination 2026 and disbursing through Joint-Approval requiring a 75% supermajority independently in both governance bodies. The paper specifies the NL=NA five-layer enforcement chain from API schema validation through the on-chain terminal gate in TL_Ledger_Core.registerPermissionToken, the four-stage upgrade workflow with mandatory timelocks, and the enforcement process for operator certification and revocation. The structural limits of TL governance are defined: no governance body may eliminate the Epistemic Hold, reverse a Refuse state, bypass the Immutable Ledger, weaken the Goukassian Principle, or exercise the No Switch Off prohibition. These limits are not policy but bytecode. The paper concludes that governance power is legitimate only when it is bounded, transparent, and verified. The measure of good governance in TL is that it is used as little as possible.

Lev Goukassian

This paper presents a comprehensive defense-in-depth security analysis for the Ternary Logic (TL) Smart Contract Constitutional Suite. The analysis models adversarial threats not merely as code exploits but as economic attacks: governance capture, oracle manipulation, MEV front-running, flash loan price manipulation, chain reorganizations, and censorship. Security goals are defined for each TL constitutional invariant including NL=NA enforcement, Epistemic Hold bypass prevention, Refuse state finality, tamper-evident Decision Logs, elimination of God Mode access, and Anchor verifiability. The blueprint maps specific contract-level controls, operational controls, and verification metrics to each of the eight foundational pillars of the TL framework. The V2.0 implementation references TL_Ledger_Core.sol and TL_Evidence_Vault.sol as the on-chain enforcement layer, with the Dual-Lane Latency Architecture establishing the 2ms Inference Lane and 300ms Governance Lane timing constraints that the security model must preserve under all attack conditions. The No Log = No Action invariant G(execute implies P(escrow_recorded and auditable)) is the constitutional mechanism that no off-chain bypass can circumvent. The Tri-Cameral governance model comprising the Technical Council, Stewardship Custodians, and Smart Contract Treasury is analyzed as the institutional defense against capture. Formal verification targets, fuzzing strategies, third-party audit cadence, and incident response runbooks complete the security assurance framework.

S Murugesan

This study investigates the dynamic relationship between network activity and transaction fees in the Ethereum blockchain by analysing the interaction between Gas Used and Gas Price through a multivariate time series model. The objective is to determine whether variations in network demand influence short-term gas price fluctuations. Daily data of Gas Used and Gas Price were transformed into different logarithmic forms to ensure stationarity. The Augmented Dickey–Fuller test confirmed that both variables are stationary at the five percent significance level, with ADF statistics of −6.21 for Δlog (Gas Used) and −7.12 for Δlog (Gas Price), and p-values below 0.001. The Vector Autoregression model was estimated with an optimal lag length of fourteen days, selected using the Akaike Information Criterion, reflecting the persistence of network and fee dynamics. The results of the Granger causality test indicate a unidirectional causal relationship from Gas Used to Gas Price, with an F-statistic of 3.72 and a p-value of 0.018, suggesting that fluctuations in network demand significantly precede changes in gas pricing. The reverse direction is not significant, with an F-statistic of 1.26 and a p-value of 0.28, indicating that transaction fees do not predict network activity. The impulse response analysis shows that a one standard deviation shock in Gas Used increases Gas Price for two to three days before returning to equilibrium, while shocks in Gas Price have minimal effects on Gas Used. These findings confirm that Ethereum’s fee market operates primarily as a demand-driven mechanism were congestion and transaction volume shape short-term gas price movements.

Zishan Ashraf Mohammad, Nick Harkiolakis, Saman Sarbazvatan

Although there has been a massive increase in the size and complexity of the cryptocurrency ecosystem, most of the academic research into the relationship between token design parameters and the long-term value of a given token is still very much in its infancy. Most of the research in tokenomics is theoretical in nature, based upon frameworks for understanding, or is focused solely on observing a specific time frame. The authors of this paper address the above mentioned void by studying the statistically significant relationships between five on-chain tokenomic variables--transaction gas fees, total value locked (TVL), token unlocks, tokens burned, and governance concentration (as measured using the Gini coefficient) -- and the market price of Ether (ETH) during a 52 months observation window that began in August 2021 and ended in September 2025. The data for the study consisted of bi-weekly observations (n = 108) which allowed researchers to use three different analytical methods--Spearman correlation analysis, log-linear multiple regression analysis, and an error correction model (ECM) after conducting Johansen cointegration and unit root tests. A cointegrating equation among the variables was established through Johansen Trace Testing, indicating that all of these variables do indeed exhibit a long-run equilibrium relationship. The ECM revealed that the total amount of funds “locked” into smart contracts (“total value locked”) was the strongest single predictor of the price of Ether in both the long run (beta = 0.8, p &amp;lt; 0.001) and short run (beta = 1.18, p &amp;lt; 0.001) specifications. Additionally, it was found that token unlocks have a negative relationship with price (beta = −0.22, p &amp;lt; 0.001). Gas Fees (beta = 0.2, p = 0.021) and tokens burned (beta = 0.15, p = 0.039) had positive coefficients at the 0.01 level in the long-run specification; however, both exhibited extremely high levels of multicolinearity (Variance Inflation Factor&amp;gt;28,000), likely due to their technical/operational linkages under EIP-1559. Voting power did not demonstrate a statistically significant relationship to price (rho =0.143, p &amp;gt; 0.05).

Tanmay Khodankar, Dr. Ashwini Garkhedkar

India's asset management systems, especially land records, property registries and ownership documents, face major challenges such as fraud, ownership disputes, slow manual verification and fragmented documentation. These issues affect citizens, government departments, financial institutions and real-estate stakeholders. Blockchain technology provides an opportunity to improve asset management by creating tamper-resistant records, transparent transaction history and automated workflows through smart contracts. This paper studies the use of blockchain platforms for asset management in India with a comparative focus on Hyperledger Fabric and Ethereum. The study analyzes technical architecture, performance, privacy, cost, scalability and implementation barriers. It also considers Indian use cases such as Telangana land parcel initiatives, Karnataka Bhoomi-related digital land record modernization and national-level blockchain adoption efforts. The findings show that Hyperledger Fabric is more suitable for regulated government asset systems because it provides permissioned access, privacy channels, higher transaction throughput and lower operational cost. Ethereum is useful for public transparency and open applications, but its public-chain gas cost, lower throughput and regulatory challenges reduce suitability for high-volume government asset records. The paper concludes that a permissioned blockchain model with proper standards, legacy-system integration, legal recognition and rural digital infrastructure can support scalable blockchain-based asset management in India.

G'oyibnazarova Aziza Abdullo qizi

Mazkur ilmiy tezisda blokcheyn texnologiyasining xavfsizlik jihatlari, ayniqsa markazlashmagan tarmoqlarda yuzaga keladigan asosiy tahdidlar va ularni bartaraf etish usullari tahlil qilinadi. Tadqiqot davomida 51% hujumi, Sybil hujumi, Double Spending, smart-kontrakt zaifliklari, kriptografik kalitlar bilan bog'liq muammolar hamda DDoS hujumlarining blokcheyn infratuzilmasiga ta'siri o'rganildi. Shuningdek, Proof-of-Work, Proof-of-Stake, Multi-signature, shifrlash algoritmlari va audit mexanizmlarining xavfsizlikni ta'minlashdagi roli ilmiy manbalar asosida tahlil qilindi. Tadqiqot natijalari blokcheyn texnologiyasining yuqori darajadagi himoya imkoniyatlariga ega ekanligini ko'rsatsa-da, inson omili va dasturiy zaifliklar sababli xavfsizlikka tahdidlar saqlanib qolayotganini ko'rsatadi.

R Elavarasi

The rapid expansion of decentralized financial applications has increased the importance of understanding user trust in crypto wallet platforms. This study examines trust expressions in multilingual Phantom Wallet reviews using a hybrid classification framework that integrates BERT-based contextual embeddings with an XGBoost model. A total of 12,422 English and Indonesian reviews were collected and processed to construct a multilingual dataset for trust analysis. Exploratory findings reveal a highly polarized distribution of user ratings, indicating that trust in crypto wallets is strongly influenced by clear satisfaction or dissatisfaction rather than moderate evaluations. Cross-linguistic analysis indicates that Indonesian users express a higher proportion of low-trust reviews compared to English users, suggesting greater sensitivity to transaction errors and perceived asset safety concerns. Lexical patterns demonstrate that positive trust is associated with usability and performance stability, while negative trust is primarily driven by system failures, delays, and missing balance incidents. The results confirm that the BERT–XGBoost hybrid model is well-suited for decoding trust-related signals by combining contextual semantic understanding with structured metadata. This study contributes to the broader discourse on digital trust within Web3 environments by demonstrating an effective multilingual machine learning approach for analysing user perceptions in decentralized financial technologies.

Derek Regier, Andrew Polyak, Aresh Dadlani, Khosro Salmani

Temporal signed networks (TSNs) model the time evolution of cooperative and adversarial relationships that arise in applications such as social media analysis, trust and reputation systems, and financial transaction networks. While graph neural networks (GNNs) perform well for static or unsigned link prediction, effective learning in temporal signed graphs remains challenging due to the interaction of signed relations, evolving structure, and balance-theoretic constraints. To address this gap, we propose a \emph{modular} temporal enhancement framework for signed GNNs that integrates historical context into otherwise static architectures. The framework introduces a Historical Context Integration Module (HCIM) that combines learnable recency-aware temporal weighting, LSTM-based embedding trajectory modeling, and multi-head temporal attention to capture both short- and long-term signed interaction dynamics. Historical information is fused with current node representations using either global or node-adaptive weighting, allowing the architecture-agnostic framework to accommodate heterogeneous temporal behaviors. We instantiate the approach on the Self-Explainable Signed Graph Transformer (SE-SGformer), preserving interpretability while extending it with temporal awareness. Experiments on real-world and synthetic TSNs, including Bitcoin OTC, Bitcoin Alpha, Reddit, and small-world network models, demonstrate consistent and statistically significant improvements over the static baseline.

Xubin Luo

A decentralized ecosystem can capture value and still fail to fund the actors who keep it running. Users may pay fees, tokens may appreciate, issuers may earn revenue, and protocols may burn value, but none of these facts by itself shows that authors, miners, validators, suppliers, storage providers, or other critical participants are actually compensated. This paper argues that traditional value-capture analysis often assumes a centralized pool: once value is captured, it can be reallocated through budgets, contracts, payroll, or managerial discretion. Decentralized ecosystems do not have this default pool. They require routed closure: captured value must pass through a verifiable route to a specified critical incentive recipient, and it must be sufficient relative to that recipient's reward requirement. We formalize this distinction through Route-Admissible Value and operationalize it with the External Value Routing Closure protocol. A contrast set including YouTube, Steem/Steemit, Bitcoin, Ethereum, Aave, Filecoin, USDC, and XRP shows why revenue, fees, burns, token prices, or market capitalization should not be mistaken for sustainable incentive funding.

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.

Kunt

No abstract is available for this record.

Dr. Pankaj Malik, Soham Bundela, Mohd. Ivaid, Mohnish Dhurve · 5 authors

The rapid expansion of Decentralized Finance (DeFi) has enabled open and permissionless token trading, but it has also led to a surge in fraudulent activities such as rug pulls, wash trading, and pump-and-dump schemes. This paper presents a novel fraud detection approach based on correlation analysis between token price and liquidity, leveraging the inherent relationship between these two market variables. In legitimate markets, price movements are typically supported by corresponding changes in liquidity, whereas fraudulent tokens often exhibit abnormal or decoupled behavior due to artificial price manipulation. To investigate this, we analyze time-series data of token price and liquidity across multiple decentralized exchanges and compute statistical correlation metrics alongside liquidity variation patterns. Experimental results show that legitimate tokens maintain strong positive correlations (r > 0.7) between price and liquidity, while fraudulent tokens exhibit weak or unstable correlations (r < 0.3), often accompanied by sudden liquidity withdrawals or artificial volume spikes. The proposed framework achieves high detection performance with an accuracy of 92.4%, precision of 90.1%, recall of 93.6%, and F1-score of 91.8%, demonstrating its effectiveness in identifying suspicious tokens at early stages. The findings confirm that deviations in price–liquidity correlation serve as a reliable and computationally efficient indicator for fraud detection in DeFi ecosystems. This approach can be integrated with existing blockchain analytics tools to enhance real-time monitoring and improve investor protection.