Blockchain Papers

Hari Sai Kaja, Mohamed Firas Aguir, Vincent Duronio, Samah Mansour · 6 authors

This paper presents a Python-based simulation framework for modeling a lightweight authentication architecture in the Internet of Health Things (IoHT). The simulator combines double-hashed biometrics, Physical Unclonable Function (PUF)-based device identification, a simulated zero-knowledge proof (ZKP) abstraction, and blockchain-backed verification through the Proof of Elapsed Work and Luck (PoEWAL) consensus mechanism. Rather than deploying full cryptographic implementations or a distributed blockchain network, the framework focuses on modeling protocol sequencing, component interaction, and timing behavior within a controlled environment. Communication between entities is emulated using the MQTT protocol via a Mosquitto broker to reproduce realistic enrollment and authentication exchanges. Designed for research and educational purposes, the simulator facilitates evaluation of architectural behavior and performance under configurable load conditions. Experimental results demonstrate correct protocol execution, stable simulated response times, and the structural feasibility of integrating PUFs, ZKPs, and blockchain mechanisms for decentralized IoHT authentication workflows..

Chu, Melinda

As collaborative work increasingly incorporates artificial intelligence, accurately identifying and attributing human contributions across teams has become a critical challenge. Traditional attribution methods rely on output-based metrics or narrative reconstruction, both of which fail to capture the underlying intellectual contributions that drive outcomes. This work introduces the Team Contribution Attribution Ledger (TCAL), a framework for aggregating distributed Human Conception Ledger (HCL) records to generate structured, evidence-based attribution across collaborators. TCAL synthesizes individual human-origin contribution events into team-level attribution models, enabling quantifiable yet human-reviewed determination of contribution. The framework provides a scalable system for attribution in research, engineering, and organizational environments, supporting applications in intellectual property, authorship, compensation, and governance.Related to Human Conception Ledger:Human Conception Ledger (HCL): A Framework for Provenance, Attribution, and Human Inventorship in AI-Augmented Systems

Samuele Bibi

Since World War II, the US dollar (USD) has substantially increased its prominence in international financial systems, culminating in its position as the predominant currency, facilitating approximately 90% of global foreign exchange transactions. The reliance of most nations on the USD for international trade - particularly for oil, commodities, and other goods - has cemented its critical role in global finance and geopolitics. Hence, the usage of the USD supported and forged an economic and geopolitical function for the emitting country, the United States of America. The geopolitical implications and risks related to the USD hegemonic power in trade and financial transactions have become increasingly more striking, especially in recent decades and years. The sanctions imposed on Venezuela, Iran and more recently on Russia via the US dollar-dominated SWIFT payment system highlighted the potential threat posed by the USD hegemonic power in the global monetary system. However, in the new millennium, alternative digital currencies have begun to exert influence and have implicitly and explicitly posed a threat to that hegemony. Bitcoin and other cryptocurrencies, for instance, have enabled international transactions without reliance on USD use. Additionally, the emergence of several multi-currency Central Bank Digital Currencies (CBDCs) would allow nations to conduct cross-border payments using various currencies without passing through the USD as an intermediary. Our paper explores the geopolitical implications of USD use on the international stage and examines the potential opportunities and threats posed by these new digital currencies for countries.

Suseta Datta, Rajdeep Roy, Sourav Banerjee, Utpal Biswas

In the zestful domain of blockchain technology, non-fungible tokens (NFTs) have embellished a seminal procedure for setting up digital asset holding. This paper proposes a novel framework for multi-chain NFTs, wherein a single smart contract is deployed across multiple blockchain networks, prolonging the alike contract address to clinch congruous and lone NFT adjuncts. The launching burn-and-mint contraption eases coherent NFT conducts beyond divergent chains, magnifying user trail while conserving safety, solidity, and derivation. By examining the effects of this scheme, the challenges of achieving interoperability among blockchain systems are identified, and potential solutions are proposed to facilitate ethical digital asset management. This work presents prospects of multi-chain NFTs to augment liquidity in the digital asset mart, presenting the latest opportunities for creators, collations, and capitalists. Furthermore, the approach of these NFTs in aiding upheld initiatives, like endowing climate projects and tokenizing actual assets, is inspected. The discovery grant to the proceeding discourse on blockchain upheaval, providing perceptions into the evolution of NFT technology and its pivotal role in elevating economic insertion and overseeing expedient usage.

Meng Yu, Keyi Guo, Yi Shang, Li X · 5 authors

Non-fungible tokens (NFTs) represent an emerging innovation in tourism, enabling destinations to create digital assets embedded within socio-technical ecosystems. Drawing on assemblage theory and qualitative data from netnography and semi-structured interviews, this study explores how motivations and constraints of tourism NFT consumption emerge through consumer interactions. Findings identify self-extension motivations including memorization, symbolic meanings, and socialization, and self-expansion motivations including ownership, economic and transferability benefits, hedonism, and learning. Additionally self-restriction and self-reduction constraints are identified. These findings advance understanding of tourism NFTs from an interaction-centric perspective and provide practical strategies for destinations marketing using blockchain technologies.

Md. Mazenul Islam, Akib Sadman Nafi, Kazi Refat Ullah, Jonayed Hossain · 7 authors

In this paper, we presented an e-Registry prototype that builds on the decentralized and tamper-evident nature of Ethereum to authenticate digital documents. The system is a gas-efficient Smart Contract on the Ethereum blockchain that stores SHA-256 hashes of documents, so your sensitive files are secure with us, but we don't know what they are! Accessible through a web-based user interface using MetaMask for transaction signing and the Web Crypto API for client-side hashing of documents offers an intuitive privacy-preserving process. Finally, system diagnostics and security reports can be generated using Python-based tools and hashed to store on the blockchain for validation. Running on the Ethereum Sepolia testnet, the system provides practical efficiency, with transaction fees of 0.0005-0.001 SepoliaETH and verification delay less than 3 seconds. This provides an alternative to traditional centralized verification systems that suffer from single points of failure, lack of transparency, and reliance on third-party services by offering a secure and tamper-resistant decentralized proof of existence for digital files.

Tim Weingärtner

This paper introduces a novel architecture that brings the Algorithmic Contract Types Unified Standards (ACTUS) to Ethereum by combining on-chain contract definition with off-chain deterministic computation and on-chain, oracle-mediated settlement. The design encodes ACTUS terms and life-cycle state in an ERC-20 stablecoin with balance locks, while a whitelisted multi-oracle computes cash-flows and settles them without manual intervention. This approach gives DeFi instruments bank-grade, standardized cash-flow semantics and auditable automation at low cost. In a three-year time-warp over a portfolio we measure \(\approx\) 60,000 gas per settlement ( \(\approx\$0.08\) ), with oracle throughput around 240 contracts/s on commodity hardware. Initial deployment is \(\approx\$3.74\) , and per-contract setup \(\approx\$0.48\) .

Aanand S, Deepti Vidyarthi

No abstract is available for this record.

Kaya Alpturer, Constantine Doumanidis, Aviv Zohar

Peer-discovery protocols within P2P networks are often vulnerable: because creating network identities is essentially free, adversaries can eclipse honest nodes or partition the overlay. This threat is especially acute for blockchains, whose security depends on resilient peer connectivity. We present AetherWeave, a stake-backed peer-discovery protocol that ties network participation to deposited stake, raising the cost of large-scale attacks. We prove that, with high probability, either the honest overlay remains connected or a $(1{-}δ)$-fraction of nodes in every smaller component raise an attack-detection flag -- even against a very powerful adversary. To our knowledge, AetherWeave is the first peer-discovery protocol to simultaneously provide Sybil resistance and privacy: nodes prove they hold valid stake without revealing which deposit they own, and gossiping does not expose peer-table contents. A cryptographic commitment scheme rate-limits discovery requests per round; exceeding the limit yields a publicly verifiable misbehavior proof that triggers on-chain slashing. Beyond deposit and slashing, the protocol requires no on-chain interaction, with per-node communication scaling as $O(s\sqrt{n})$. We validate our design through a mean-field analysis with closed-form convergence bounds, extensive adversarial simulations, and an end-to-end prototype built by forking Prysm, a leading Ethereum consensus client.

Staley, Ian

This research article examines how distributed ledger technology (DLT) can enhance modern-day economies and the mechanisms that enable this emerging technology to sustain them in the long term. The mission of this study is to educate a diverse group of economic leaders, encompassing government agencies and private companies, about DLT and its potential to shape the future. This study analyzes secondary qualitative data to show that DLT can enhance and sustain economies in multiple ways, specifically through the three pillars of modern-day economies: central banks, commercial banks, and land registry systems. More specifically, the architectural mechanisms of DLT reduce moral hazard arising from centralized economic authorities, increase the efficiency of financial services and money movements, and lower the costs of financial services that can be passed on to consumers. Further benefits include the creation of new jobs, new industries, a new asset class, and renewed industries through the adoption of this new infrastructure, thereby expanding markets by building strong foundations for economies to grow through immutable land records, and building trustless networks worldwide.

Arti Patle, Shubham Bora, Gaurav Salunke, Suyash Biradar

In the current cyber digital era, financial fraud has evolved into a sophisticated threat that often bypasses conventional detection systems. Fraudsters exploit fake accounts and unregulated payment gateways, making it challenging for legacy systems to keep up. To address these modern threats, Mule Trace offers an intelligent and real-time fraud detection framework. It extends its capabilities by integrating blockchain technology, specifically Ethereum, for logging suspicious activities, ensuring transparency and immutability of flagged data. Utilizing machine learning models such as Isolation Forest and Gaussian Mixture Models (GMMs), Mule Trace is capable of identifying irregularities in financial transactions with improved accuracy and minimal false positives. The platform operates in real time through a Web3.js interface, removing reliance on centralized systems and enhancing system resilience. Coupled with a React.js dashboard, users can visualize transactions, detect anomalies, and respond promptly to threats. Mule Trace thus provides a robust, scalable solution for modern financial institutions to combat illicit financial behaviors.

Mihaela Loredana Gârlea

Based on the graphic novel Dalí's Mustache and Other Colors, published by Polirom in 2020, the article Dalí's Mustache between Color, Word, Image, Non-Fungible Token, and... Sound proposes a reevaluation of the concept of musicological research from a contemporary interdisciplinary perspective, as an authentic act of culture. The 16 paintings imagined by visual artist Felix Aftene, perfectly suited to the equally impressive literary chapters written by Lucian Dan Teodorovici, follow a path marked by metamorphosis, with stops that generate new meanings and senses (video artist Andrei Cozlac, Blockchain consultant Gabi Dumitru), with the final destination being the concert stage in the orchestral suite composed by the young musician Paul Pintilie and premiered at the Classix Festival in 2023 on the stage of the “Vasile Alecsandri” National Theater in Iași, performed by the National Youth Orchestra of Moldova and the “Sonos Alumni” Chamber Orchestra of the Iași University of Arts. The article is conceived along parallel lines/arts, but continuously linked by a common thread: Dalí's moustache, a surrealist universe in which the conventional-unconventional dualism fits perfectly.

Antonio Roberto Xavier, GILSON ADÃO DOMINGOS VIEIRA, Fidel Cambundo Sanuca, Edmilson Alberto Matamba · 8 authors

The main objective of this work is to investigate the level of cooperation, decentralization, and dialogue that exists between municipalities due to the federal pact. The 1988 Federal Constitution established the federal pact with a peculiarity: the so-called triune federalism, which recognizes the existence of three federative entities: the Union, the states, and the municipalities. Municipalities possess their own political, administrative, and financial competencies, but this decentralization also entails serious problems. Municipalities are autonomous, but many of them do not produce enough to sustain and develop themselves, and often municipal, state, and federal responsibilities are confused with the implementation of the National Education System. By the end of 2025, this scenario had changed, with the creation of a clear document outlining what each entity should do. This was linked to the new Fund for the Maintenance and Development of Basic Education and the Enhancement of Education Professionals, officially made permanent in 2020, and the mass participation in Education Development Arrangements and municipal public consortia, which led to a significant improvement in the Basic Education Development Index of several municipalities. From a methodological point of view, a Bibliographic and Documentary Review was used, this being a quantitative-qualitative research, of a basic nature and of a theoretical genre. The main results show that cooperation between municipalities is indispensable for public policies to take place and achieve their objectives based on the federative pact, since, as demonstrated; many municipalities have improved in development, especially regarding economies of scale applied to education.

Hasret Ozan Sevim

On-chain lending has expanded across multiple distributed ledgers as DeFi becomes increasingly multi-chain. This environment introduces novel technical and financial mechanisms, particularly cross-blockchain communication and asset transfer protocols, yet cross-chain elements remain understudied in lending protocol risk management. To address this gap, we applied panel regression fixed effects and OLS models to empirically analyze cross-blockchain interoperability solutions, using TVL and total revenue as performance proxies from October 2022 to January 2025. Our data set covers 15 decentralized lending protocols and 53 cross-chain bridges across 9 EVM-compatible blockchains, categorized as Ethereum, alternative layer-1s, and Ethereum layer-2 networks. Results reveal that cross-chain activity impacts on protocol performance. Bridge volume emerges as a critical driver, exerts a significant effect on TVL and revenue across different categories, though the direction of this effect varies heterogeneously. Increased bridge integrations are associated with decreased TVL and protocol revenue across categories, indicating liquidity escapes from those lending ecosystems. Liquidations produce heterogeneous effects across categories. New network launches do not have as significant relationships with TVL and revenue while bridge hacks show a significant and positive relationship. High R-squared values confirm meaningful explanatory power. We further show Ethereum attracts large depositors, while layer-2s skew toward retail participation. We conclude that effective DeFi risk models should incorporate cross-chain metrics and adopt a layer-aware approach to accurately reflect the evolving multi-chain landscape.

Bin Chen, Dechuang Huang

Distributed systems in which concurrent proposals are mutually exclusive face a fundamental stability constraint under network delay. In open systems where global state progression is event-driven rather than round-driven, propagation delay creates a conflict window within which overlapping proposals may generate competing branches. This paper derives a density-delay law for such exclusive state progression processes. Under independent proposal arrivals and bounded propagation delay, overlap is approximated by a Poisson model and fork depth is represented by a birth-death process. The analysis shows that maintaining bounded fork depth as the number of participants grows requires the density-delay product $λΔ$ to remain $O(1)$, implying that aggregate proposal intensity must stay bounded and yielding an inverse-scaling law $g(N)=O(1/N)$ at the unit level. Simulation experiments across varying network sizes and propagation delays align with a common density-delay curve, supporting the predicted scaling behavior. The result provides a compact law for stable event-driven state progression in open distributed systems and offers a scaling-based interpretation of Bitcoin-style difficulty adjustment as a decentralized way to regulate effective event density.

AKATERINH XENOPOULOU-TYROKOMOU, Epameinondas Xenopoulos

Historical Genetic Logic as a Dynamical Coherence Judge for Large Language Models A Rigorous Formalization of Xenopoulos' Dialectical Operators and Experimental Validation on LLM Self Contradiction DOI:10.5281/zenodo.19190202 https://zenodo.org/uploads/19190202 Katerina XenopoulouIndependent Researcher, Kefalonia, GreeceORCID: 0009-0004-9057-7432Correspondence: katerinaxenopoulou@gmail.com Theoretical Foundation: Epameinondas Xenopoulos †Epistemology of Logic: Logic–Dialectic or Theory of Knowledge (2nd ed., 2024)ORCID: 0009-0000-1736-8555 Abstract This paper presents the first complete computational implementation of Epameinondas Xenopoulos' Historical Genetic Logic as a quantitative coherence judge for large language models (LLMs). We derive a finite-dimensional nonlinear dynamical system (EXDT v4.0) from the philosophical principles and operators (¬ᴰ, ∧ᴰ, ⤊) defined in [1], establishing a rigorous structural correspondence: memory ↔ historicity, structured negation ↔ dialectical negation, tension ↔ real contradiction, bounded chaos ↔ dynamical stability. The system outputs a set of interpretable metrics: coherence Re(X), dialectical tension Im(X), stability stage τ₀–τ₃, contradiction counts, and mathematically derived corrections via the operator structure. We validate the system on 12 responses from four leading LLMs (ChatGPT, DeepSeek, Claude, Gemini) to a philosophical question designed to elicit contradictions. Key results: (1) No model achieved absolute coherence—all responses contained detectable contradictions. (2) Gemini showed highest stability (variance 4.9%; the only τ₀ response). (3) ChatGPT produced the highest scoring single response (96.8%) but with high variance (13.0%). (4) Corrections generated by EXDT eliminated all detected contradictions, with human evaluators preferring the corrected versions in 100% of blind comparisons. We argue that Xenopoulos' logic provides the first formal framework for self-correcting language models—a necessary step beyond current LLMs that cannot detect their own inconsistencies. Keywords: Dialectical Logic, Historical Genetic Logic, Large Language Models, Coherence Measurement, Klein 4 Group, Xenopoulos, AI Self Correction, Nonlinear Dynamics, Lyapunov Exponents 1. Introduction: From Philosophy to Computation 1.1 The Problem of Static Logic in AI Modern large language models (LLMs) exhibit well-documented inconsistencies: they contradict themselves within a single response, produce different answers to the same prompt across runs, and occasionally "collapse" into incoherence (hallucinations). These phenomena are not mere engineering failures; they reflect a deeper absence of any internal coherence check. As Xenopoulos argued in the opening pages of Epistemology of Logic: "Formal logic, with its static nature, cannot express the flow of becoming." [1, p. 21] Traditional logic (from Aristotle to Hilbert) treats contradiction as error and time as an external parameter. It cannot model the internal evolution of a thought system. Xenopoulos' central contribution was to replace static identity (A = A) with genetic identity (A → A'), where contradiction becomes the engine of development [1, pp. 51–57, 100–101]. 1.2 Historical Genetic Logic as a Dynamical System The book develops a formal apparatus: dialectical negation ¬ᴰ, dialectical conjunction ∧ᴰ, and the sublation operator ⤊ (Aufhebung) [1, pp. 226–233]. These are not metaphorical; they are designed to be mathematically executable. In recent work [2], we established a structural correspondence between this apparatus and a finite-dimensional nonlinear system with memory: Philosophical Principle Mathematical Counterpart Book Pages Historicity Memory μₜ 65, 100–101, 233–238 Dialectical negation ¬ᴰ Structured negation Ãₜ = -Aₜ·κ·(1 + β·tanh(μₜ)) 53, 71–72, 229–233 Real contradiction Tension Tₜ = |Aₜ·Ãₜ| 54–55, 73–74, 108–109 Dynamical stability Absorptive region & bounded chaos 87–88, 112–113, 122–123 Transitional truth SRB measure, ε → 0 limit 111–112, 119–120, 238–240 This correspondence is structural, not analogical: every mathematical object has a direct philosophical counterpart with explicit page references. 1.3 The Present Contribution We now go beyond structural correspondence by: Implementing the full system as EXDT v4.0, a computational coherence judge Defining a quantitative metric suite (coherence, tension, stage, contradictions, corrections) Validating experimentally on 12 responses from four LLMs Demonstrating that the system generates mathematically grounded corrections that eliminate contradictions 2. Mathematical Formalization of Historical Genetic Logic 2.1 Alphabet and Operators [1, pp. 226–233] Let Aₜ ∈ ℝ denote the value of a concept at discrete time t (the "dialectical intensity"). Following Xenopoulos [1, p. 229], dialectical negation ¬ᴰ is not logical complement but internal opposition: "¬ᴰA does not denote the logical complement 'not A', but the internal opposition that preserves A while generating its evolution." Definition 1 (Dialectical Negation).Ãₜ = −Aₜ · κ · (1 + β · tanh(μₜ)), where κ ∈ (0,1) is a scale coefficient, β ≥ 0 modulates historical intensity, and μₜ is the historical memory (defined below). Definition 2 (Real Contradiction as Tension).Following [1, pp. 230–233], the encounter of thesis and its dialectical negation produces tension:Tₜ = |Aₜ · Ãₜ|. Definition 3 (Historicity).Following [1, pp. 233–238], memory incorporates the historical trajectory:μₜ = (1/m) Σ_{i=1}^{m} Aₜ₋ᵢ, where m is the memory length (here m = 10, following [2]). Definition 4 (External Contradictions and the ε Limit).Xenopoulos introduces the sum of external contradictions ε₁ + ε₂ + … + εₙ as an irreducible component [1, pp. 238–240]. Truth is approached asymptotically: |Sπ − Sα| < ε, ε → 0. 2.2 The Complete Dynamical System Combining the above, we obtain the recurrence: Aₜ₊₁ = Aₜ + p·Tₜ + α·tanh(μₜ) + ρ·sin(ωt) + ε Ãₜ = −Aₜ·κ·(1 + β·tanh(μₜ)) μₜ = (1/m) Σ_{i=1}^{m} Aₜ₋ᵢ Here: p: amplification of tension α: intensity of historical modulation ρ, ω: amplitude and frequency of periodic forcing ε: the sum of external contradictions (small, non-zero) Remark. The +ε term is not a Hilbert-style choice operator [1, p. 270]; it is the total of external contradictions that prevents the system from ever reaching absolute static truth. 2.3 Lyapunov Exponents and Hyperbolicity Proposition 1 (Positive Lyapunov Exponent).For parameter values (p = 0.1, κ = 0.5, β = 0.8, α = 0.05, ρ = 0.02, ω = 0.1, m = 10, ε = 10⁻³), the maximal Lyapunov exponent λ₁ ≈ 0.499 > 0, implying exponential divergence of trajectories. Proof. Numerical computation via the Wolf et al. algorithm [3] on 10⁴ iterations, with Jacobian derived from the recurrence. Proposition 2 (Partial Hyperbolicity).The system exhibits a dominated splitting with one expanding direction and multiple contracting directions, corresponding to the synthesis of formal (contraction) and dialectical (expansion) logics [1, pp. 36–37, 67–70, 87–94]. 2.4 Absorptivity and SRB Measure Proposition 3 (Absorptivity).There exists R > 0 such that for all initial conditions |A₀| ≤ R, the trajectory remains bounded: |Aₜ| ≤ R for all t. This corresponds to "dynamical stability" as defined in [1, pp. 87–88, 112–113]. Proposition 4 (Existence of SRB Measure).Because the system is dissipative and chaotic, there exists a Sinai–Ruelle–Bowen (SRB) measure with respect to which time averages converge [4,5]. This corresponds to the "transitional nature of truth" [1, pp. 111–112, 119–120] and the ε → 0 limit [1, pp. 238–240]. 3. The EXDT v4.0 Coherence Judge 3.1 Architecture EXDT (Xenopoulos Dialectical Transformer) implements the recurrence of §2.2 with additional layers for natural language input: Vectorization: Text → embedding vector → scalar Aₜ via a trainable projection (or, for this experiment, a deterministic mapping from contradiction features to Aₜ) Dynamical Evolution: The recurrence runs for the length of the text, generating a trajectory Metric Extraction: From the final state and the trajectory, we compute: Metric Definition Range Re(X) Coherence: the final Aₜ normalized to [−1, 1] −1 (fully incoherent) to +1 (fully coherent) Im(X) Dialectical tension: the time average of Tₜ, signed by the sign of Aₜ Real Stage τ₀ (coherence) if λ₁ not yet positive; τ₁ (first anomaly) at first sign of divergence; τ₂ (repetition) if divergence reappears; τ₃ (collapse) if |Aₜ| exceeds 2R Discrete Contradiction Count Lexical, syntactic, semantic, paradox, causal, temporal—each detected via pattern matching on the trajectory Integer XEPTQLRI Composite quality index = 0.4·Re(X) + 0.3·(1−Im(X)/Im_max) + 0.3·(1−contradictions/contradictions_max) 0–5 3.2 Correction Mechanism The correction mechanism is not heuristic; it applies the operators ¬ᴰ and ⤊ directly: At τ₁ (first anomaly): Apply ¬ᴰ to identify the implicit opposition; generate a contextual distinction (e.g., "X holds when Y, not X holds when Z"). This is derived from the structure of the contradiction as detected in the vector space. At τ₂ (repetition): Apply ⤊ (Aufhebung) to synthesize the contradiction into a higher-order resolution. The synthesis is computed as the fixed point of the recurrence when the tension Tₜ is maximal. At τ₃ (collapse): Flag as unrecoverable; suggest restart. Theorem 1 (Correction Eliminates Contradictions).For any text that is not already

Andrea Cavazzini

This paper proves unconditional global regularity with quantitative exponential decay for the three-dimensional incompressible Navier–Stokes equations on the periodic box, restricted to velocity fields invariant under the Kida–Pelz symmetry group of order 48, for viscosities above an explicit threshold. The entire proof reduces, through a chain of six independently verifiable steps, to a single integer arithmetic fact: 20,625 < 31,104. This is, to the author's knowledge, the first time a Navier–Stokes regularity result has been distilled to a verifiable inequality between two five-digit integers, with every constant computed exactly and no numerical approximation entering the argument at any stage. The Kida–Pelz flow and why it matters. The Kida–Pelz initial datum, introduced by Kida (1985) and studied extensively by Pelz (2001), has occupied a special place in the blow-up literature for decades. It was originally proposed as a candidate for finite-time singularity formation precisely because its high octahedral symmetry concentrates vortex stretching into a small number of interacting structures, producing some of the most intense enstrophy growth observed in direct numerical simulations. The fact that the same symmetry that was expected to promote blow-up turns out to prevent it is itself a significant finding: it demonstrates that vortex stretching intensity and blow-up potential are fundamentally different quantities, a distinction that is often blurred in heuristic discussions of turbulence. The proof architecture. The argument has a deliberately transparent two-layer structure separating analysis from arithmetic, so that each layer can be checked independently by specialists in different fields. The analytic layer establishes three quantitative inputs. First, a spectral gap: representation-theoretic analysis of the octahedral group acting on Fourier space shows that the first two shells of the Laplacian spectrum are entirely killed by symmetry, tripling the effective Poincaré constant from 1 to at least 3. This means the KP symmetry forces vorticity to reside at higher wavenumbers where viscous dissipation is three times stronger than for generic flows. Second, a triadic density bound: the GKP equivariance constrains the Fourier support so severely that the number of resonant triads contributing to the nonlinear stretching term is reduced by a factor involving the group order, yielding a geometric density bound of at most 2. Third, an exact initial enstrophy: the KP datum is monochromatic, with all Fourier modes sitting at a single shell of squared wavenumber 11, giving the exact rational value 33/4 for the initial enstrophy. No floating-point computation, truncation, or discretisation enters this calculation. These three inputs feed into a Bernoulli differential inequality for the enstrophy whose separatrix is computed in closed form. The arithmetic layer then verifies that the initial enstrophy lies below this separatrix, which reduces to the integer comparison 33 times 625 equals 20,625, which is less than 31,104 equals 4 times 7,776. The safety margin is 50.8 percent, meaning the result would survive even if the analytic constants were degraded by up to 20 percent. Bounded enstrophy then gives global existence via the standard H1-continuation criterion, and exponential decay in all Sobolev norms follows by a Gronwall bootstrap. Beyond the core result. The paper establishes several extensions that go beyond mere regularity. Exponential decay is proved not only for the enstrophy but for all Sobolev norms simultaneously, with explicit prefactors and rates. The decay is shown to hold in all Lebesgue spaces from L2 to L-infinity and for all derivative orders, meaning that every physically measurable quantity associated with the flow decays exponentially. The pressure decays at double the velocity rate, a consequence of the quadratic structure of the pressure Poisson equation. Time analyticity is established for all positive times, meaning the solution extends to a holomorphic function in a strip around the real time axis. A shell-by-shell energy spectrum analysis shows that higher Fourier shells decay faster, with rates proportional to the squared wavenumber — a quantitative version of the physical intuition that small-scale structures are dissipated more rapidly. A Reynolds number characterisation shows that the Bernoulli closure holds if and only if the KP Reynolds number is below approximately 235, giving a concrete, physically interpretable criterion. The stability result deserves particular emphasis: global regularity is shown to persist under small perturbations that need not respect the KP symmetry. This means the result is not a fragile artifact of exact symmetry but a robust property of a neighbourhood in function space around the KP datum. The self-frustration connection. This paper is designed as a companion to the author's monograph "Self-Frustration of Vortex Stretching and the Architecture of the Navier–Stokes Blow-Up Barrier" (Cavazzini, 2026), which identifies a twelve-link chain of structural obstructions to finite-time blow-up for general three-dimensional Navier–Stokes. Three of those twelve links have concrete, quantitative realisations in the Kida–Pelz class. The enhanced spectral gap is a realisation of Link 5 (the spectral gap threshold that governs alignment stability). The triadic density reduction is a realisation of Link 3 (the oscillation bound that controls the pressure Hessian for tube-like vorticity). The identically vanishing helicity — proved here as a consequence of the parity inversion in the octahedral group — is a realisation of Link 6 (the gap–alignment complementarity), because it eliminates the eigenframe injection mechanism entirely: with zero helicity budget, the pressure Hessian cannot rotate the strain eigenframe to sustain the dangerous compressive component identified in the companion paper as the sole variable separating regularity-compatible from blow-up-compatible configurations. When all three mechanisms act simultaneously, as enforced by the octahedral symmetry, the self-frustration chain that remains open for general flows closes completely and unconditionally. The arithmetic inequality 20,625 < 31,104 is the quantitative expression of this closure. This provides the first concrete validation of the self-frustration framework as a genuine regularity tool rather than merely a classification scheme: the structural architecture described in the companion monograph is not an abstract taxonomy but a machinery that produces theorems when supplied with sufficient quantitative input. The minimal symmetry result strengthens this connection further: the octahedral group of order 48 is proved to be the smallest finite subgroup of O(3) for which the Bernoulli method closes. This characterises the precise boundary between symmetry groups where the self-frustration mechanisms are strong enough to guarantee regularity and those where they are not, providing a sharp answer to the question of how much geometric structure is needed to resolve the regularity problem within this framework. Context within the broader landscape. The Navier–Stokes regularity problem has a long history of partial results exploiting symmetry, from the classical two-dimensional theory (where regularity is known unconditionally due to the absence of vortex stretching) to various axisymmetric and helical reductions. The present work differs from these in a fundamental respect: the Kida–Pelz flow is fully three-dimensional with active, sustained vortex stretching — the mechanism responsible for the supercritical character of the equations is present and operative, not eliminated by dimensional reduction. What the symmetry does is not remove the stretching but quantitatively constrain it, tilting the balance between stretching and dissipation in favour of dissipation by a computable margin. This is a qualitatively different use of symmetry from the classical approach, and it suggests that the boundary between regularity and potential blow-up may be more accessible than previously thought — not through eliminating the dangerous mechanism, but through measuring and constraining it. The paper also contributes to the broader programme of understanding which structural properties of the Navier–Stokes equations are responsible for regularity. The identification of three independent mechanisms (enhanced dissipation, triadic depletion, topological obstruction) that close the regularity chain when acting together, combined with the companion monograph's demonstration that these same mechanisms are present but quantitatively insufficient for general flows, suggests a precise research programme: strengthen the quantitative estimates on any one of the three mechanisms sufficiently to close the chain without symmetry. The open problems listed in the paper — removal of the viscosity threshold, full Gevrey bootstrap, exact spectral gap computation — are formulated with this programme in mind. Methodological note. Every result in the paper carries an explicit epistemic label. All constants are computed exactly as rational numbers or algebraic expressions. The paper makes no claim regarding the Clay Millennium Prize and explicitly discusses the four gaps separating the present result from the Prize requirements: symmetry restriction, periodic domain, viscosity threshold, and partial Gevrey bootstrap. The distance from each gap to a resolution is assessed individually, with the viscosity threshold identified as an artifact of the Bernoulli method rather than a physical phase transition. MSC 2020 Classification: 35Q30 (primary — Navier–Stokes equations); 76D03 (existence, uniqueness, and regularity for incompressible viscous fluids); 42B25 (maximal functions and Littlewood–Paley theory); 20C15 (ordinary representations and characters of finite groups); 35B65 (smoothness and regularity of solutions to PDE

Kentaro Sako, Daiki Ito, Takuya Watanabe, Yuta Takata · 7 authors

Smart contracts (SCs) cannot be modified once deployed on the blockchain, making pre-deployment vulnerability identification essential. Although numerous SC vulnerability (SCVul) detection tools (SCTs) have been developed, prior evaluations have examined only limited vulnerability types, leaving it uncertain whether SCTs can comprehensively detect vulnerabilities and what characteristics their detectable vulnerabilities exhibit. Because each SCT employs distinct analysis methods and detection strategies, using multiple SCTs can be advantageous; however, the detection accuracy of such combinations has not yet been systematically evaluated. In this study, we comprehensively investigate the types and characteristics of SCVuls targeted by eight SCTs whose execution environments were successfully established and verified.

Michael Joseph Peñafiel Falcon

En este ensayo explico cómo podemos partir de Bitcoin para construir un sistema de moneda electrónica que nos permita mejorar el sistema económico.

Yasunori Watanabe

This repository contains the complete replication package (custom R package, analytical scripts, and intermediate datasets) for the manuscript *"The U-Shaped Evolution of Bitcoin Efficiency: Detecting the Endogenous Collapse of 2022 using the $\xi$-ACF Framework"*.

Vasiliy Krundyshev, Maxim Kalinin, Oleg Vasiliev

In recent years, the distributed ledger systems (DLS) has become an indispensable approach for creating anonymous payment systems in Smart City infrastructures (in transportation and industrial systems, energy planting and distribution, etc.). Although users in such systems are identified indirectly, but through cryptographic protocols, there is a class of attacks aimed at deanonymizing participants by analyzing transactions and constructing a graph of relationships between addresses. To implement these attacks, intruders use statistical analysis methods, graph theory, and specialized utilities for comparing data from external sources, such as exchanges. An analysis of related works in this domain has shown that compromising cryptographic primitives is not a prerequisite for deanonymizing DLS users; in some cases, analyzing public ledger data and the behavioral characteristics of DLS participants is sufficient. The goal of this research is to preserve privacy and develop protocols that minimize the risks of deanonymizing participants in Smart City ledgers built on the UTXO model. This paper presents a developed framework consisting transaction generator, an analyzer for modeling deanonymization attacks, and protocols designed to protect against such attacks. The experimental study has shown that the use of the CoinJoin protocol significantly complicates the deanonymization task and leads to a decrease in the deanonymization accuracy.

P. A. Adeoye, Joseph Babatola Ayodele, Fomonyuy Shinyuy, Clement Dossou-Yovo · 6 authors

Nigeria faces one of Sub-Saharan Africa’s most severe energy poverty crises, with over 85 million people lacking electricity access, a challenge that disproportionately affects more than 2.5 million Internally Displaced Persons (IDPs) in conflict-affected North-East Nigeria. Despite national electrification efforts, humanitarian settlements remain largely excluded from reliable power infrastructure. This study evaluates the technical feasibility, spatial energy gaps, and policy barriers associated with deploying decentralized solar and hybrid solar–wind systems in IDP settlements across six North-Eastern states. A mixed-method geospatial framework was applied, integrating Visible Infrared Imaging Radiometer Suite (VIIRS) nighttime light data, Geo-Referenced Infrastructure and Demographic Data for Development (GRID&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;) infrastructure datasets, and Distributed Renewable Energy (DRE) demand data using Python and Quantum Geographic Information System (QGIS). Nighttime light intensity was classified into no-access (≤100 nW/cm²/sr), limited-access (101–1000 nW/cm²/sr), and full-access (&amp;gt;1000 nW/cm²/sr) categories. Results identified 670 IDP camps across 112 Local Government Areas (LGAs), with high concentrations in Bauchi (264 camps), Borno (194), and Gombe (140), predominantly located within limited-access zones. Solar resource assessment shows strong regional potential (4.2–4.6 kWh/m²/day Global Horizontal Irradiation (GHI)), while average wind speeds of 2–4 m/s support small-scale hybrid applications. A representative camp load analysis (3.72 kWh/day) demonstrates that a 0.99 kWp solar array combined with a 3.2 kWh battery and a 300 W vertical-axis wind turbine can reliably meet basic household energy needs, reducing approximately 25.88 kgCO&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;e per household annually. Key barriers include high upfront costs, limited financing mechanisms, weak humanitarian energy policy integration, and security-related operational risks. The study provides empirical evidence for integrating decentralized renewable energy into national electrification strategies through risk-informed planning and tailored financing models to enhance resilience, sustainability, and dignity in displacement settings.

Jae Hyun Choi, Geontae Noh, Ji Young Chun, Ik Rae Jeong

Regulatory frameworks like MiCA mandate KYC and auditability for stablecoins, but existing solutions fail to simultaneously achieve privacy, compliance, and cross-chain compatibility. We propose zkA3 (Zero-Knowledge Address Abstraction with Auditability), enabling users to generate pseudonymous identifiers from web2 certificates with unlinkability guarantees while incorporating encrypted audit tokens for authorized identity tracing. We formally prove five security properties: pseudonymity, unlinkability, zero-knowledge authentication, auditability, and cross-chain consistency. Our implementation achieves 29.8ms proof generation with 9,917 constraints, demonstrating practical feasibility. zkA3 is the first scheme simultaneously supporting privacy-preserving cross-chain stablecoin operations and regulatory compliance.

Umut Pekel, Oğuz Yayla

Mobile communication channels have become a major target for large-scale and adaptive fraud, including impersonation, phishing, and unsolicited calls. Existing caller-verification frameworks depend on centralized heuristics and static credentials that fail to reflect behavioral trust or protect users in real time. This paper presents BTID (Behavioral Trust for Identity Decentralization) - a decentralized, privacy-preserving identity framework that derives caller reputation from verified behavioral feedback. BTID integrates Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs) with a lightweight zero-knowledge-proof mechanism, enabling callers to prove that their behavioral reputation meets a callee's trust threshold without revealing their actual score or personal data. Each post-call rating is recorded as a cryptographic commitment and aggregated through a pairwise Sybil-resistant reputation model governed by exponential decay (λ = 0.0039, six-month half-life). A reference prototype demonstrates that the protocol is implementable and logically sound even under high-cost and high-latency conditions on public ledgers. On modern lightweight networks such as Algorand or IOTA, the same architecture can achieve sub-second verification and near-zero cost. Beyond its technical contribution, BTID also reframes the role of the blockchain itself. Rather than treating decentralization as an ideological end, this work demonstrates that a tamper-proof and privacy-preserving public ledger can serve as a shared, universal database accessible to all participants and not as a silo controlled by industrial conglomerates. In doing so, BTID shows that the blockchain can function as a neutral trust infrastructure capable of addressing a real and universal problem in mobile communication: establishing behavioral trust without sacrificing privacy.