The first machine-checked formalization, in any proof assistant, of any component of the Birch-Swinnerton-Dyer (BSD) conjecture pipeline. No prior Lean, Coq, or Isabelle project has formalized Silverman height bounds, Gross-Zagier-Kolyvagin data structures, or the logical architecture of BSD generator search. No new number theory is proved. The algorithms formalized are the engines inside Cremona's mwrank and SageMath. The contribution is the formalization itself and the foundational analysis it enables. Three results that did not previously exist in formal mathematics: (1) A machine-checked axiom/theorem boundary for BSD. The formalization identifies exactly which ingredients must be axiomatized (Gross-Zagier, Kolyvagin, Silverman bound, positive-definiteness) and which can be proved constructively (height bound chain, finite grid membership, search space finiteness). This is the blueprint for any future formally verified BSD solver: the deep analytic theorems interface with type theory through a single chokepoint (the real-valued Silverman bound), and everything below that chokepoint is verified. (2) A logical characterization of the Archimedean/p-adic dichotomy. The positive-definite Archimedean metric (u = 1) is identified as the exact logical modality lowering search complexity from Pi^0_1 (unbounded, MP) to Delta_0 (bounded verification, BISH). This foundational statement does not appear in the classical literature -- Cremona and Watkins use height bounds as engineering, not as a theorem in reverse mathematics. (3) A logical explanation of the exceptional zero pathology. The p-adic BSD exceptional zero (Mazur-Tate-Teitelbaum) is usually explained analytically: trivial zeros of p-adic L-functions, extra Euler factors. This formalization gives a logical explanation: the p-adic canonical height is not positive-definite, so the MP-to-BISH conversion fails. The search remains unbounded because the metric lacks the topological property needed for logical reduction. This re-reading of a classical analytic obstruction as a failure of logical reducibility is, to our knowledge, new. The axiom budget is minimal -- removing any one ingredient breaks the proof chain -- characterizing the necessary logical interface between analytic number theory and formal verification. This is the first application of constructive reverse mathematics to a Clay Millennium Problem. Formalized in Lean 4 + Mathlib with zero sorry's and zero custom axiom declarations. All analytic axioms enter as Prop-valued hypotheses in a BSDRankOneData structure. Axiom audit: every theorem depends only on [propext, Classical.choice, Quot.sound] (standard Mathlib infrastructure for the reals). Package contains compiled PDF (10 pages), LaTeX source, and complete Lean 4 source (7 files, ~725 lines) buildable with lake build.
Four ancient civilizations — Egyptian, Sumerian, Babylonian, and Hindu — independently preserved the same mathematical encoding system. When their 'mythological' timescales are divided by 144, they reveal real historical intervals, astronomical cycles, and geological periods with precision that cannot be coincidental. Statistical significance: P < 10⁻⁴⁸ (less than one chance in a number with 48 zeros). THE DISCOVERY: Ancient 'mythical' chronologies are not fiction. They are real timescales multiplied by 144 — a universal encoding system designed to preserve historical data across civilizational collapse. To decode ancient mythology into history: divide by 144. When we do this systematically across four independent cultures, the results are stunning. EGYPTIAN EVIDENCE (Turin Papyrus): Pre-dynastic 'mythical' periods when decoded: Total: 36,620 years ÷ 144 = 254.3 years Matches: Biblical Flood to Egyptian Dynasty 1 (254 years) Precision: 110 days (0.12% error) Pre-Shemsu Hor: 23,200 years ÷ 144 = 161.1 years Matches: Flood to Tower of Babel dispersion (161 years) Precision: 37 days (0.06% error) Shemsu Hor: 13,420 years ÷ 144 = 93.2 years Matches: Babel to Nile Valley settlement (93 years) Precision: 73 days (0.2% error) Egyptian P-value: < 10⁻⁸ (less than one in 300 million) The Egyptian scribes encoded the exact chronology from the Flood to their civilization's founding — 254 real years disguised as 36,620 'mythical' years. SUMERIAN EVIDENCE (King List): All eight pre-flood king reigns are EXACT multiples of 144 with zero error: King Reign (years) ÷ 144 Result Alulim 28,800 200.00 Perfect Alalgar 36,000 250.00 Perfect En-men-lu-ana 43,200 300.00 Perfect En-men-gal-ana 28,800 200.00 Perfect Dumuzid 36,000 250.00 Perfect En-sipad-zid-ana 28,800 200.00 Perfect En-men-dur-ana 64,800 450.00 Perfect Ubara-Tutu 36,000 250.00 Perfect 8 out of 8 = 100% exact multiples. Total pre-flood period: 302,400 years = 144 × 2,100 = 14,400 × 21 The Sumerians encoded exactly 21 complete geomagnetic excursion cycles (each 14,400 years) before the catastrophic 22nd cycle that became "The Flood." Sumerian P-value: < 10⁻¹⁶ (less than one in ten quadrillion) King Alulim's reign (28,800 years = 144 × 200) represents one complete Great Year — Earth's true harmonic precessional cycle before the Younger Dryas impact perturbed it to the current 25,772 years. BABYLONIAN EVIDENCE (Berossus): All ten pre-flood kings (Berossus, c. 290 BCE) divide perfectly by 144: King Reign (years) ÷ 144 Result Aloros 36,000 250 Perfect Integer Alaparos 10,800 75 Perfect Integer Amelon 46,800 325 Perfect Integer Ammenon 43,200 300 Perfect Integer Megalaros 64,800 450 Perfect Integer Daonos 36,000 250 Perfect Integer Euedorachos 64,800 450 Perfect Integer Amempsinos 36,000 250 Perfect Integer Otiartes 28,800 200 Perfect Integer Xisuthros 64,800 450 Perfect Integer 10 out of 10 = 100% exact multiples. Total antediluvian period: 432,000 years Divided by 144: 432,000 ÷ 144 = 3,000 (exact) Babylonian P-value: < 2 × 10⁻²⁴ (less than one in 2 septillion) King Otiartes (9th king) reigned for 28,800 years — identical to Sumerian King Alulim. Both cultures encoded the Great Year in the same king's reign. HINDU EVIDENCE (The Smoking Gun): Hindu Kali Yuga duration: 432,000 years Babylonian total: 432,000 years EXACT MATCH. Both = 144 × 3,000 precisely. Testing all four Hindu Yugas: Yuga Duration ÷ 144 Result Kali Yuga 432,000 3,000 Perfect Dwapara Yuga 864,000 6,000 Perfect Treta Yuga 1,296,000 9,000 Perfect Satya Yuga 1,728,000 12,000 Perfect 4 out of 4 Yugas = 100% exact multiples of 144. The k-values (3,000, 6,000, 9,000, 12,000) form a perfect 1:2:3:4 ratio. Hindu P-value: < 10⁻⁸ Babylon-Hindu match P-value: < 10⁻¹⁶ (the probability they'd both preserve 432,000 independently by chance) THE BABYLONIAN-HINDU BRIDGE: This is the smoking gun. Babylon (Mesopotamia) and Hindu civilization (India) are separated by: 2,500 miles of geography Completely different languages, religions, mythologies Independent cultural development across centuries Yet they both preserve IDENTICAL numbers: 432,000 years = 144 × 3,000 This is not cultural borrowing. This is not coincidence. This is evidence of a common source — a global pre-flood civilization that used 144-based timekeeping, which both Mesopotamia and India inherited independently. COMBINED STATISTICAL ANALYSIS: Testing across all four cultures: Total independent data points: Egyptian: 3 periods Sumerian: 8 kings Babylonian: 10 kings Hindu: 4 Yugas Total: 25 numerical values Probability all 25 would divide by 144 to yield meaningful results by random chance: P < 10⁻⁴⁸ One chance in: 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 For context: Stars in observable universe: ~10²⁴ Atoms in human body: ~10²⁸ This probability: 10⁻⁴⁸ This cannot be coincidence. This is proof. WHAT THE EVIDENCE PROVES: Before the Flood, there existed a global civilization that: Used 144 as the universal temporal constant Same number appears in Egypt, Mesopotamia, India Same encoding method (multiply real years × 144) Same astronomical knowledge (Great Year, excursion cycles) Survived multiple geomagnetic excursion cycles Sumerian record: 21 consecutive 14,400-year cycles Developed protocols for Type 1 reset survival Encoded survival knowledge in mythology Tracked astronomical cycles with precision Great Year: 28,800 years (true harmonic precession) Excursion cycle: 14,400 years (geomagnetic resets) Solar cycle: 144-day beats All based on 144 constant Transmitted knowledge to successor cultures Sumerians: Preserved raw data (king lists) Babylonians: Systematized data (432,000 total) Egyptians: Encoded data (pre-dynastic mythology) Hindus: Preserved data (Yuga cosmology) Built a universal timekeeping system Sar unit: 3,600 years = 144 × 25 Sexagesimal (base-60) mathematics Encoded in mythology to survive collapse THE METHODOLOGY: Simple, reproducible, falsifiable: Take any ancient 'mythological' chronology Divide by 144 Check if result corresponds to: Known historical intervals Astronomical cycles Geological events Other verified 144-based timescales If 144 encoding is universal, it will work across ALL major cultures. If coincidental, it will fail for most. WHY 144? This constant appears across EVERY tested domain: Planetary (spatial): All planet diameters = 144 × Fibonacci(n) miles (P < 10⁻¹⁸) Planetary (temporal): All planet orbits = 14.4-day multiples (P < 10⁻⁵⁰) Solar: Sunspot cycle = 144 days × 28 (exact) Geological: Geomagnetic excursions = 14,400-year intervals Deep time: Permian-Triassic extinction = 14,400 × 17,500 (exact) Human: Earth's day = 1,440 minutes = 144 × 10 Ancient chronology: Egyptian + Sumerian + Babylonian + Hindu = all encode via × 144 (P < 10⁻⁴⁸) This is a fundamental organizing principle operating fractally across nine orders of magnitude in time. WHY ENCODE VIA MULTIPLICATION? Three complementary reasons: Durability: Mythological narratives survive collapse better than administrative records. Epic poems and temple inscriptions are memorized and carved in stone. By encoding real chronology as 'god-king' myths, scribes ensured data survival even if civilization was destroyed. Dual purpose: Encoded numbers serve both religious functions (satisfying ritual requirements) and data storage (preserving actual chronology). One document accomplishes both. Astronomical connection: Using 144 linked human chronology to the same constant governing planetary mechanics and solar cycles. This embedded human history within cosmic time. FALSIFIABLE PREDICTIONS: If the framework is correct: Additional Egyptian sources (Palermo Stone, Abydos, Manetho) will decode via ÷ 144 to known intervals All Hindu chronological units (Manvantaras, Kalpas) will be exact 144 multiples Chinese Bamboo Annals (independent East Asian culture) will show 144 encoding or NOT (critical test) Mayan Long Count units beyond B'ak'tun will all be 144 multiples May 2027 will show measurable precession rate change (if 28,800-year Great Year is true) If ANY major culture with preserved chronologies does NOT show 144 encoding, this requires explanation. IMPLICATIONS: Ancient mythology is not fiction. It is real chronology encrypted with a mathematical key. That key is 144. When applied systematically: Mythology becomes history History becomes precise The past is no longer hidden The gods ruled for 432,000 years. Divide by 144. They ruled for 3,000 years. That is real. That is history. That is how long the pre-flood world lasted. And four ancient cultures — separated by thousands of miles, different languages, independent mythologies — all preserved it exactly. Each one encoding the same truth in their own sacred texts. We now have the decryption key. RELATED PUBLICATIONS: All papers in the CTF framework series available at ctftheory.com and Zenodo with permanent DOIs. Key papers: The 144 Hz Universal Constant Across Space and Time Sumerian Great Year Decoded: All Eight Pre-Flood King Reigns Are Exact Multiples of 144 Two Types of Catastrophe: Harmonic Resets vs. Impact Events Sun 144-Day Beat and 14,400-Year Reset Cycle Planet Nine Primordial Black Hole at the 144 Harmonic Node All data public. All calculations reproducible. All predictions falsifiable.
Zibin Lin, Taotao Wang, Shengli Zhang, Long Shi · 6 authors
Open Web 3.0 platforms increasingly operate as \emph{service ecosystems} (e.g., DeFi, DAOs, and decentralized social applications) where \emph{admission control} and \emph{account provisioning} must be delivered as an always-on service under bursty demand. Service operators face a fundamental tension: enforcing Sybil resistance (one-person-one-account) while preserving user privacy, yet keeping on-chain verification cost and admission latency predictable at scale. Existing credential-based ZK admission approaches typically require per-request on-chain verification, making the provisioning cost grow with the number of concurrent joiners. We present \textbf{ZK-AMS}, a scalable admission and provisioning layer that bridges real-world \emph{Personhood Credentials} to anonymous on-chain service accounts. ZK-AMS combines (i) zero-knowledge credential validation, (ii) a \emph{permissionless} batch submitter model, and (iii) a decentralized, privacy-preserving folding pipeline that uses Nova-style recursive aggregation together with multi-key homomorphic encryption, enabling batch settlement with \emph{constant} on-chain verification per batch. We implement ZK-AMS end-to-end on an Ethereum testbed and evaluate admission throughput, end-to-end latency, and gas consumption. Results show stable verification cost across batch sizes and substantially improved admission efficiency over non-recursive baselines, providing a practical and cost-predictable admission service for large-scale Web 3.0 communities.
We study the implications of the existence of weak Zero-Knowledge (ZK) protocols for worst-case hard languages. These are protocols that have completeness, soundness, and zero-knowledge errors (denoted $ε_c$, $ε_s$, and $ε_z$, respectively) that might not be negligible. Under the assumption that there are worst-case hard languages in NP, we show the following: 1. If all languages in NP have NIZK proofs or arguments satisfying $ ε_c+ε_s+ ε_z < 1 $, then One-Way Functions (OWFs) exist. This covers all possible non-trivial values for these error rates. It additionally implies that if all languages in NP have such NIZK proofs and $ε_c$ is negligible, then they also have NIZK proofs where all errors are negligible. Previously, these results were known under the more restrictive condition $ ε_c+\sqrt{ε_s}+ε_z < 1 $ [Chakraborty et al., CRYPTO 2025]. 2. If all languages in NP have $k$-round public-coin ZK proofs or arguments satisfying $ ε_c+ε_s+(2k-1).ε_z < 1 $, then OWFs exist. 3. If, for some constant $k$, all languages in NP have $k$-round public-coin ZK proofs or arguments satisfying $ ε_c+ε_s+k.ε_z < 1 $, then infinitely-often OWFs exist.
Nurgul Bakytbekovna Aiupova, Md Tota Miah, Krisztina Taralik
ABSTRACT Blockchain technology has emerged as a potential disruptor in non‐financial reporting practices for firms to publicly report their social and environmental impact with its promise of immutability and decentralization. In this context, this study employs a bibliometric analysis to explore the scientific advancements of blockchain applications in CSR reporting from 2015 to 2025. VOSviewer and Biblioshiny in Rstudio applications were employed to perform the required analysis. Drawing data from Scopus and Web of Science (153 articles), the results reveal a significant shift in focus from traditional corporate social responsibility (CSR) reporting mechanisms toward technology‐enabled sustainability reporting. The thematic analysis presents five significant areas for further exploration, including corporate governance and sustainability strategy, technology‐driven sustainable finance, CSR reporting and credibility, ESG performance and digital innovation, and blockchain for accountability and responsibility. The proposed conceptual framework suggests integration of technology‐organization‐environment (TOE) elements when introducing new technology within the organization. Future researchers can empirically test the framework's antecedents to assess the socio‐economic context of different types of non‐financial reporting.
Eman Alatawi, Anoud Alhawiti, Doaa Albalawi, Umar Albalawi
The rapid expansion of the Internet of Things (IoT) has led to billions of interconnected devices generating and exchanging sensitive data across diverse domains, which introduces challenges in identity management (IdM) regarding privacy, scalability, and verifiability. While blockchain technology provides decentralization and tamper resistance, its transparency and increasing on-chain storage demands make it unsuitable for large-scale IoT identity ecosystems. To overcome these challenges, IoT-SBIdM is proposed as a lightweight, privacy-preserving, and stateless blockchain-based identity management framework designed for IoT environments. This framework incorporates Elliptic Curve Cryptography (ECC)-based accumulators and Zero-Knowledge Proofs (ZKPs) to facilitate selective disclosure, enabling entities to prove credential authenticity without exposing sensitive identity information. Furthermore, the framework adopts W3C-compliant Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs) to promote interoperability and user-controlled identity ownership. The experimental results indicate that IoT-SBIdM achieves efficient smart contract execution by reducing gas costs through optimized registry logic. Moreover, the system maintains a compact block size of only 45 MB at higher block heights, outperforming comparable schemes in storage efficiency by achieving a 55% reduction relative to recent models and an approximate 94% reduction relative to older systems, thereby demonstrating superior scalability and storage efficiency, making it suitable for identity management solutions for IoT environments.
Fraud detection within the Ethereum network remains a major research challenge due to the strong statistical resemblance between legitimate and fraudulent transaction patterns, severe class imbalance, and the multiscale complexity of temporal-interaction dependencies. Proposing and evaluating a multi-branch attention-based system with automated architecture optimization, which can detect fraudulent Ethereum accounts with high accuracy, is the aim of this study. The experimental evaluation was performed on a dataset with 9,841 samples and 17 extracted features. The proposed system employed a hybrid multi-branch architecture combining CNN, Bi-LSTM, and LSTM with a Gated Fusion mechanism along with multiscale attention layers. The Artificial Bee Colony (ABC) algorithm was applied to automatically optimize sixteen key structural and learning parameters. The results indicate that the proposed system achieved an accuracy of 99.84 %, F1 score of 98.94 %, sensitivity of 98.76 percent, and precision of 99.12 percent. These results notably outperform eight algorithms, such as Random Forest, XGBoost, LGBM, and GADL. According to the confusion matrix analysis, there is a reduction in false negatives, confirming that the system produced only five such cases in the sample set. These findings show that the proposed system is an effective and efficient approach for detecting fraud in blockchain systems and enables deployment in exchanges, DeFi platforms, and regulatory institutions.
Zibin Lin, Taotao Wang, Shengli Zhang, Long Shi · 6 authors
Web 3.0 platforms need an onboarding mechanism that can admit real users at scale without forcing them to reveal identity documents or pay one on-chain verification cost per user. Existing approaches typically rely on KYC-style disclosure, per-request on-chain verification, or trusted batching, making onboarding cost and latency difficult to predict under bursty demand. We present \textbf{ZK-AMS}, a credibly anonymous admission infrastructure that maps Personhood Credentials to anonymous on-chain Soul Accounts. Rather than introducing a new primitive, ZK-AMS composes zero-knowledge credential validation, permissionless batch submission, recursive proof aggregation, and anonymous post-admission account provisioning into one end-to-end workflow. Its key design feature is a confidential batching pipeline in which admission instances of a common relation are folded off-chain under multi-key homomorphic encryption, allowing an untrusted batch submitter to coordinate aggregation without direct access to individual user witnesses during batching; the confidentiality scope is characterized explicitly in the security analysis. The resulting batch is settled on-chain with constant verification cost per batch rather than per admitted user. We implement ZK-AMS on an Ethereum testbed and evaluate admission throughput, end-to-end latency, gas consumption, and parameter trade-offs. Results show stable batch-verification gas across evaluated batch sizes, substantially lower amortized on-chain cost than the non-recursive baseline, and practical cost-latency trade-offs for high-concurrency onboarding in Web 3.0 platforms.
Zero-knowledge proof generation imposes stringent timing and reliability constraints on blockchain systems. For ZK-rollups, delayed proofs cause finality lag and economic loss; for Ethereum's emerging L1 zkEVM, proofs must complete within the 12-second slot window to enable stateless validation. The Ethereum Foundation's Ethproofs initiative coordinates multiple independent zkVMs across proving clusters to achieve real-time block proving, yet no principled orchestration framework addresses the joint challenges of (i) strict head-of-chain ordering, (ii) sub-slot latency bounds, (iii) fault-tolerant task reassignment, and (iv) prover-agnostic workflow composition. We present push0, a cloud-native proof orchestration system that decouples prover binaries from scheduling infrastructure. push0 employs an event-driven dispatcher--collector architecture over persistent priority queues, enforcing block-sequential proving while exploiting intra-block parallelism. We formalize requirements drawn from production ZK-rollup operations and the Ethereum real-time proving specification, then demonstrate via production Kubernetes cluster experiments that push0 achieves 5 ms median orchestration overhead with 99--100% scaling efficiency at 32 dispatchers for realistic workloads--overhead negligible (less than 0.1%) relative to typical proof computation times of 7+ seconds. Controlled Docker experiments validate these results, showing comparable performance (3--10 ms P50) when network variance is eliminated. Production deployment on the Zircuit zkrollup (14+ million mainnet blocks since March 2025) provides ecological validity for these controlled experiments. Our design enables seamless integration of heterogeneous zkVMs, supports automatic task recovery via message persistence, and provides the scheduling primitives necessary for both centralized rollup operators and decentralized multi-prover networks.
In this study, the authors developed a smart traceability framework for athletic equipment using distributed ledger technology. They conducted their research to address persistent gaps in authenticity, life cycle visibility, and fan-side provenance across the sports equipment ecosystem. The framework was designed through a design-science approach, integrating Internet of Things sensors, digital twins, Electronic Product Code Information Services logistics data, and retail/resale events into a unified distributed ledger technology architecture governed by smart contracts. Simulation results show high validation accuracy, strong life cycle coverage, stable ledger performance, and reliable ownership transfers across manufacturing, field use, and secondary markets. These findings indicate that end-to-end, tamper-resistant traceability can significantly improve trust, operational transparency, and fan engagement in real-world sports equipment environments.
We study builder-driven MEV arbitrage on BNB Smart Chain (BSC). BSC's Proposer-Builder Separation (PBS) adopts a leaner design: only whitelisted builders can participate, blocks are produced at shorter intervals, and private order flow bypasses the public mempool. These features have long raised community concerns over centralization, which we empirically confirm by tracing the arbitrage activities of the two dominant builders from Apr. 1, 2025 to Feb. 28, 2026 (full observable activity cycle). Within months, the two leading builders, \bd{48Club} and \bd{Blockrazor}, produced over 87\% of blocks and captured about 90\%+ of MEV profits. We find that profits concentrate in short, low-hop arbitrage routes over wrapped tokens and stablecoins, and that block construction rapidly converges toward monopoly. Beyond concentration alone, our analysis reveals a structural source of inequality: BSC's short block interval and whitelisted PBS collapse the contestable window for MEV competition, amplifying latency advantages and excluding slower builders and searchers. MEV extraction on BSC is not only more centralized than on Ethereum, but also structurally more vulnerable to censorship and fairness erosion.
The Bitcoin protocol [Nakamoto, 2008] represents a landmark achievement in distributed systems and cryptographic engineering. However, its fixed-supply design embeds a critical long-term vulnerability: the mathematical inevitability of permanent supply contraction driven by generational private-key inheritance failure. This paper formalises the generational loss model through discrete probability theory and recurrence relations, demonstrating that conservative estimates predict 51% of total supply becoming permanently inaccessible within 264 years, while realistic models project 64% loss. We further establish that the cessation of block rewards at approximately block height 6,930,000 ($\approx$2140 CE) eliminates the mining security budget, exposing the network to sustained 51% attack risk. We propose Bitcoin Infinity — the Perpetual Continuity Protocol — a minimal, mathematically grounded modification to Bitcoin Core's GetBlockSubsidy() function. The modification replaces a single hard-stop conditional with a modulo operation, restarting the original 50 BTC/block halving curve every 33 halvings ($\approx$132 years) in perpetuity. We prove that under this scheme, circulating supply converges to a stable equilibrium $C^* = S_0r/(1 - r)$ (approximately 49 M BTC at 30% generational loss), mining incentives are preserved indefinitely, and all previously issued bitcoins remain fully valid. The implementation is verified against 113 boundary tests with zero failures, exhibits no undefined behaviour under C++17, and maintains complete backward compatibility with the existing network until the activation block. Link: https://revistazen10.github.io/bitcoin-infinity/
The agri-food supply chain is a cornerstone of food security and economic stability, yet traditional systems often grapple with challenges such as limited transparency, data manipulation, delayed payments, and an over-reliance on intermediaries.These centralized frameworks hinder the ability to verify the origin, quality, and authenticity of agricultural products, weakening trust among stakeholders.This paper introduces a Blockchain-Based Crop Supply Chain and Traceability System leveraging smart contracts to address these persistent issues.The proposed system employs blockchain technology to establish a decentralized, transparent, and immutable ledger that records every transaction within the supply chain.Key processes are automated through smart contracts, including crop registration, ownership transfers, transaction validations, and payment executions.To manage large-scale data effectively, the InterPlanetary File System (IPFS) is incorporated for decentralized storage of crop-related documents like images, health reports, and certificates, while cryptographic hashes are stored on the blockchain for verification purposes.A token-based digital payment mechanism linked to the Indian Rupee (INR) ensures fair and instant payments between farmers and buyers.The system is implemented as a decentralized application utilizing React.js,Node.js,Solidity, and MetaMask, and deployed on the Binance Smart Chain Testnet.Experimental findings reveal significant enhancements in traceability, transparency, fraud reduction, and stakeholder trust compared to conventional agri-food supply chain systems.
Atefeh Nekouie, Majid Vafaei Jahan, Mohammad Hossein Moattar, Reza Sheibani
Access control and data privacy are two of the main necessities in managing electronic health records (EHRs) across distributed domain. There are privacy gaps that expose EHRs to risks like unauthorized access by unaffiliated medical personnel. Traditional attribute-based encryption (ABE) allows encryption based on user attributes but is unable to incorporate data-specific attributes, such as the type of medical information included in the record or the potential physician. This paper introduces a novel approach that integrates ABE with large language models (LLMs) and blockchain technology to enhance security and contextual access control in EHR systems. Specifically, a domain-specific LLM, such as ClinicalBERT, is leveraged to automatically extract semantic data attributes from unstructured medical records, enabling a more granular and context-aware encryption process. By embedding both user and data attributes into the ABE framework, access policies are dynamically refined, ensuring that only authorized users can view specific types of medical information. Furthermore, blockchain's immutable ledger enhances trust, streamlines attribute revocation, and fortifies the system against unauthorized modifications and security threats. The proposed framework significantly strengthens EHR privacy by integrating machine learning-driven attribute extraction with cryptographic access control, outperforming existing schemes in both security and flexibility. Evaluations validate the effectiveness of the proposed framework in preventing unauthorized access while maintaining efficient and transparent data management.
Electron EDM in QMU: CP-odd Square-Charge Dipole from Aether-Unit Holonomy This paper reformulates the electron "EDM" observable in the Aether Physics Model (APM) using Quantum Measurement Units (QMU), where the primitive charge dimension is square-charge and electrostatic potential is reciprocal capacitance. In this framework, the natural EDM-like observable is not a linear-charge dipole \(d_e\), but a CP-odd square-charge first moment of a distributed square-charge density. QMU potential and driver. Electrostatic potential is defined as reciprocal capacitance,\[\Phi_Q := \frac{1}{C},\]and the electrostatic driver is its gradient,\[\mathbf{G} := \nabla \Phi_Q.\] Square-charge EDM observable and ledger-closed coupling. Let \(\rho_{e^2}(\mathbf r)\) be the signed distributed square-charge density (magnetic basis). The square-charge dipole vector is the first moment\[\mathbf{D}_{e^2} := \int \rho_{e^2}(\mathbf r)\,\mathbf r\,d^3r.\]The ledger-closed interaction energy with external electrostatic structure is\[\Delta U = -\,\mathbf{D}_{e^2}\cdot\nabla\Phi_Q,\]which replaces the legacy coupling \(-\mathbf d\cdot\mathbf E\) by changing the driver to \(\nabla\Phi_Q\) and the dipole to a square-charge moment. Holonomy origin and CP-odd invariant. The Aether-unit two-sphere chronovibration supports a 5D closed action whose 4D forward-time projection can exhibit holonomy. A CP-odd defect one-form \(\delta\omega_{\mathrm{CP}}\) is defined from the 5D-to-4D connection mismatch, and the dimensionless CP-holonomy invariant is\[\Delta_{\mathrm{CP}} := \frac{1}{2\pi}\oint_{\gamma_+}\delta\omega_{\mathrm{CP}},\]where \(\gamma_+\) is the forward-time leg of the chronovibrational cycle. The square-charge dipole is parameterized by\[\mathbf{D}_{e^2} = {e_\mathrm{emax}}^{2}\,\lambda_C\,\Delta_{\mathrm{CP}}\,\hat{\mathbf s},\]with \({e_\mathrm{emax}}^{2}\) the distributed square-charge unit in the magnetic basis, \(\lambda_C\) the electron Compton length, and \(\hat{\mathbf s}\) the spin direction. Domain taxonomy, seams, and obstruction index. A minimal octant-domain cover of the electron sheet is introduced, with antipodal pairing and a loxodromic seam-crossing loop. Under a local-exactness hypothesis on each octant, the CP-odd holonomy reduces to a seam-sum cocycle. Quantized seam jumps are written as multiples of the octant increment \(\pi/4\), producing an integer obstruction index \(\tau_{\mathrm{CP}}\in\mathbb Z\) and a discrete spectrum\[\Delta_{\mathrm{CP}} = \alpha^{p}\,\frac{\tau_{\mathrm{CP}}}{8},\]where \(\alpha\) is the fine structure constant and \(p\ge 1\) is the leading order at which the CP-odd defect survives seam pairing. Metrology and experimental bridge. An action scale is defined in QMU as\[h_e := m_e\,{\lambda_C}^{2}\,F_q,\]so the measurable frequency shift is \(\Delta f=\Delta U/h_e\). In EDM platforms, the relevant driver is the internal reciprocal-capacitance gradient component\[\mathcal{G}_{\mathrm{eff}} := \hat{\mathbf n}\cdot\nabla\Phi_Q,\]leading to a spin-reversal splitting proportional to \(|\Delta_{\mathrm{CP}}|\,|\mathcal{G}_{\mathrm{eff}}|\). State-of-the-art null bounds from electron-EDM experiments (e.g. ACME) are interpreted here as constraints on admissible microstate classes and packing-weighted populations rather than on an intrinsic point-parameter. Next-step program and parameter-free prediction target. With canonical octant labeling and the loxodromic seam loop fixed, Milestone M1 is to compute the leading CP-odd chirality connection \(\omega^{(1)}_{\chi}\) and the associated seam integers \(m_{ij}\), and to determine whether \(p=1\) (non-canceling order-\(\alpha\) seam cocycle) or \(p\ge 2\) (order-\(\alpha\) cancellation). If the explicit summation yields \(p=1\) and the minimal obstruction \(\tau_{\mathrm{CP}}=1\), then the framework makes a parameter-free magnitude prediction in native QMU units:\[|\mathbf{D}_{e^2}| = {e_\mathrm{emax}}^{2}\,\lambda_C\,\frac{\alpha}{8}.\]For appendix-only SI-bridge purposes, the charge-basis relation\[e^{2} = 8\pi\alpha\,{e_\mathrm{emax}}^{2}\]connects the square-charge unit to the elementary-charge-squared scale used in legacy reporting.
This article reframes the first-row CKM unitarity test,\[|V_{ud}|^2+|V_{us}|^2+|V_{ub}|^2=1,\]as a Quantum Measurement Units (QMU) ledger-closure identity in the Aether Physics Model (APM). In this framing, the quantities commonly called “mixing parameters” are treated as overlap invariants between quark packing states induced by a 5D-to-4D holonomy map. The squared moduli are completeness weights in the holonomy-induced inner product, so first-row unitarity becomes a basis-closure check rather than a postulate about an abstract matrix. The empirical anchor is the current data-facing closure target compiled by the Particle Data Group (PDG). Using representative PDG values,\[V_{ud}=0.97367(32),\qquad V_{us}=0.22431(85),\]with the contribution of $|V_{ub}|^2$ negligible at the quoted precision, the first-row sum is reported as\[|V_{ud}|^2+|V_{us}|^2+|V_{ub}|^2=0.9983(6)(4),\]corresponding to a residual\[\Delta_{\mathrm{row1}}:=\big(|V_{ud}|^2+|V_{us}|^2+|V_{ub}|^2\big)-1\approx -1.7\times 10^{-3}.\] The central methodological move is to rewrite the superallowed $0^+\to 0^+$ beta-decay program in a ledger-first form. The observed constancy of corrected $\mathcal{F}t$ values is treated as a vector-current closure statement under holonomy, with standard “radiative” and “nuclear-structure” terms reorganized into two reader-facing categories:\[\mathcal{B}_V=\mathcal{B}_{\mathrm{hol}}\;\mathcal{B}_{\mathrm{map}},\]where $\mathcal{B}_{\mathrm{hol}}$ collects holonomy boundary terms and $\mathcal{B}_{\mathrm{map}}$ collects charge-basis conversion terms and normalization bookkeeping. Charge-basis discipline follows the established APM narrative. The internal APM relationship between singular and distributed square-charge bases is enforced by the unified charge equation,\[e^2 = 8\pi\,\alpha\,e_{\mathrm{emax}}^{\,2},\]with $\alpha$ the fine-structure constant. When bridging to SI reporting conventions, the operational SI$\leftrightarrow$QMU conversion is implemented by the Charge Conversion Factor (CCF),\[\mathrm{CCF}:=\frac{e_{\mathrm{emax}}^{\,2}}{e},\]used to translate SI charge-based units to QMU and back without altering the internal APM charge-basis identity. A constructive holonomy program is then organized into milestones that (i) define an action-normalized vector-channel connection, (ii) implement the forward-time restriction explicitly, and (iii) reduce the forward-time holonomy defect to seam (stitching) data classified by a discrete obstruction index. In the minimal octant taxonomy, seam increments are quantized in steps of $\pi/4$, leading to a defect structure of the form\[\Delta_V=\frac{1}{8}\,\tau_V\,\Xi_V(\alpha),\]with $\tau_V\in\mathbb{Z}$ (or half-integer effective classes under forward-time restriction) and $\Xi_V(\alpha)$ a normalization fixed by geometry and a charge-basis-constrained basis-map multiplier. A key geometric lock used in the diagnostic scan is a toroidal invariance principle for the forward-time projection, expressed as\[R\,r=\lambda_C^2,\]where $R$ and $r$ are the major and minor radii of the effective toroidal projection and $\lambda_C$ is the QMU Compton length. In the minimal octant-pitch model this yields a rigid seam-lock multiplier,\[s_V=\sec\beta_V=\frac{\sqrt{17}}{4}\approx 1.0308,\]which shifts the inferred obstruction index for the observed first-row deficit toward the forward-time half-class $3/2$ with only a sub-percent remaining mismatch.
Open access
2 source records
Quantum Chromodynamics and Particle Interactions
Nuclear physics research studies
Particle physics theoretical and experimental studies
Michele Battagliola, Laura Mattiuz, Alessio Meneghetti
Abstract The Vector Oblivious Linear Evaluation in the Head (VOLEitH) paradigm has proven to be a versatile tool to design zero-knowledge proofs and signatures in post-quantum cryptography. In this paper, we propose three VOLE-friendly modellings for Proofs of Knowledge (PoK) of a solution of an instance of the Linear Code Equivalence Problem (LEP). For the first two schemes, we propose two new reductions from LEP to the Multivariate Quadratic (MQ) problem, that may be of independent interest for the cryptanalysis of LEP. Instead, the last model is obtained by generalizing a recent work by Bettaieb et al. to the context of monomial matrices instead of permutation matrices. While our proposed schemes exhibit larger signature sizes compared to LESS, they improve the computational efficiency, reducing the overall complexity from $$O(n^3)$$ to $$O(n^2\log n )$$ and $$O(n^2\log ^2 n )$$ , where n is the length of the code.
Truffle is a framework that provides compiling, testing and systematic project management for developing Ethereum decentralized applications. As of now, Truffle provides a way to easily deal with bundling node.js modules of decentralized application using the webpack tool. However, due to the Truffle project structure, server-side node.js modules such as network communication modules are not usable in a direct way. In this paper, to address this issue, we propose a method to use server-side node.js modules through Ethereum smart contracts and event processing mechanism. In the proposed method, a separate node application is associated to the server-side module to execute the module in response to the request of the decentralized application. To this end, we introduce the notion of function gateway, a smart contract for connecting two applications with Ethereum's event-watch processing technique. Also, to use the function gateway contract in a robust way, we introduce a robust function gateway that includes the process of confirming whether or not the event-watch has occurred and the node.js module function has been executed. In addition, we present a decentralized application using node.js module for sending actual e-mails based on the function gateway.
Eduardo Sardenberg, Antonio José G. Busson, Daniel de Sousa Moraes, Julio Cesar Duarte · 5 authors
Smart contracts play a central role in blockchain systems by encoding financial and operational logic. Still, their susceptibility to subtle security flaws poses significant risks of financial loss and erosion of trust. LLMs create new opportunities for automating vulnerability detection, yet the effectiveness of different prompting strategies and model choices in real-world contexts remains uncertain. This paper evaluates state-of-the-art LLMs on Solidity smart contract analysis using a balanced dataset of 400 contracts under two tasks: (i) Error Detection, where the model performs binary classification to decide whether a contract is vulnerable, and (ii) Error Classification, where the model must assign the predicted issue to a specific vulnerability category. Models are evaluated using zero-shot prompting strategies, including zero-shot, zero-shot Chain-of-Thought (CoT), and zero-shot Tree-of-Thought (ToT). In the Error Detection task, CoT and ToT substantially increase recall (often approaching ~ 95--99%), but typically reduce precision, indicating a more sensitive decision regime with more false positives. In the Error Classification task, Claude 3 Opus attains the best Weighted F1-score (90.8) under the ToT prompt, followed closely by its CoT.
Transaction flow networks are crucial in detecting illicit activities such as wash trading, credit card fraud, cashback arbitrage fraud, and money laundering. \revise{Our collaborator, Grab, a leader in digital payments in Southeast Asia, faces increasingly sophisticated fraud patterns in its transaction flow networks. In industry settings such as Grab's fraud detection pipeline, identifying fraudulent activities heavily relies on detecting dense flows within transaction networks. Motivated by this practical foundation,} we propose the \emph{\(S\)-\(T\) densest flow} (\SDMF{}) query. Given a transaction flow network \( G \), a source set \( \Src \), a sink set \( \Dst \), and a size threshold \( k \), the query outputs subsets \( \Src' \subseteq \Src \) and \( \Dst' \subseteq \Dst \) such that the maximum flow from \( \Src' \) to \( \Dst' \) is densest, with \(|\Src' \cup \Dst'| \geq k\). Recognizing the NP-hardness of the \SDMF{} query, we develop an efficient divide-and-conquer algorithm, CONAN. \revise{Driven by industry needs for scalable and efficient solutions}, we introduce an approximate flow-peeling algorithm to optimize the performance of CONAN, enhancing its efficiency in processing large transaction networks. \revise{Our approach has been integrated into Grab's fraud detection scenario, resulting in significant improvements in identifying fraudulent activities.} Experiments show that CONAN outperforms baseline methods by up to three orders of magnitude in runtime and more effectively identifies the densest flows. We showcase CONAN's applications in fraud detection on transaction flow networks from our industry partner, Grab, and on non-fungible tokens (NFTs).
Disentangle introduces Topological Mass Consensus (TMC), a permissionless consensus mechanism that derives Sybil resistance from discrete curvature on transaction DAGs rather than proof-of-work or proof-of-stake. Edges connecting attack clusters to the honest network exhibit negative Jaccard curvature due to low ancestor overlap, enabling geometric throttling without trusted seeds or economic incentives. The protocol uses exclusively post-quantum cryptography (ML-DSA, ML-KEM, SHA3-256, Plonky3 STARKs) and derives all temporal properties from topological depth. We also present the Capability-Coherence Identity Protocol (CCIP), unifying DID-based identity, object capabilities, and petname naming under the same curvature analysis. Implementation: 9 Rust crates, 349+ tests.
Permissionless Proof-of-Stake (PoS) blockchain networks must demonstrate security and dependability as blockchain technology evolves. This research analyzes the ongoing need for a way to identify and eradicate rogue nodes inside such networks, also to advocate for the real-time rogue node’s identification in PoS blockchain networks by the application of neural network methodologies, particularly random neural networks. Experimental results indicate the ability of the developed model in differentiating legitimate blockchain nodes from malicious ones. The dataset in this paper is divided into two groups- malicious (Permissionless Proof-Of-Stake Blockchains) and non-malicious; this dataset is crucial for anyone interested in blockchain. The dataset includes details of the creation and validation of the PoS blocks. The paper aims to detect malicious nodes, analyze node behavior, and enhance security on PoS permissionless blockchains through data visualization. This paper shows the performance and process of the random neural network to refine and learn and then recognize the permissionless blockchain (malicious nodes) from the dataset of Proof-of-Stake Blockchain. We selected 100 records from the original dataset to examine them with our proposal. After analyzing the results, we found clearly how the proposal algorithm works properly with the proposed dataset to achieve fine accuracy and efficiency in the work to distinguish benign nodes from malicious (permission-less blockchain) nodes. This is the result of refining and learning the dataset using the random neural network for 340 instances, coming from the neural learning of 100 instances and 21 variables: [15 features: BlockHeight, UnixTimestamp, TxnFee (ETH), Block Generation Rate, TxnFee (Binary), Status (Tags), Stake Reward, Txnsize, Coin Days, Coin Age, Coin Stake, Stake Distribution Rate, Block Density, Block Score, Coin Day Weight) + 5 meta (node label, neural network, neural network0, neural network1, fold, selected) + no missing value), by two attributes: (node label, block score), two classes(0 non-malicious nodes,1 malicious nodes).
Bitcoin's design promises resilience through decentralization, yet the physical infrastructure supporting the network creates hidden dependencies. We present the first longitudinal study of Bitcoin's resilience to submarine cable failures, using 11 years of P2P network data (2014--2025) and 68 verified cable fault events. Applying a Buldyrev-style cascade model at country level, we find that Bitcoin's clearnet (non-TOR) critical failure threshold $p_c \approx 0.72$--$0.92$ for random failures, meaning the vast majority of inter-country cables must fail before significant node disconnection. Targeted attacks are an order of magnitude more effective ($p_c = 0.05$--$0.20$). To address the majority of nodes now using TOR with unobservable locations, we develop a 4-layer multiplex model incorporating TOR relay infrastructure. Because relay bandwidth concentrates in well-connected European countries, TOR adoption increases resilience under current relay geography ($Δp_c \approx +0.02$--$+0.10$) rather than introducing hidden fragility. Empirical validation confirms weak physical-layer coupling: 87% of historical cable faults caused less than 5% node impact. We contribute: (1) a multiplex percolation framework for overlay-underlay coupling, including a 4-layer TOR relay model; (2) the first empirical measurement of Bitcoin's physical-layer resilience over a decade; and (3) evidence that TOR adoption amplifies resilience, with distributional bounds quantifying uncertainty under partial observability.