Blockchain Papers

Mrs. A. Asrin Mahmootha, B. Aysha Banu, Mohammed Muhajir S, Mohamed Anas A · 5 authors

Voting is a central component of a country’s political life cycle. Privacy, authentication, and integrity of citizens’ votes are essential requirements of any electronic voting programme. To address these concerns, this paper proposes a hybrid e-voting system that integrates personal and public blockchain with a machine learning–based intrusion detection mechanism. The personal blockchain governs voter registration and vote casting, while the public blockchain stores the Merkle root hash for result integrity verification. An ML-based intrusion detection system monitors voting data centres and e-voting stations for anomalous behaviour. Homomorphic encryption and zero-knowledge proofs preserve voter anonymity. Experimental evaluation demonstrates that the proposed framework achieves an accuracy of 97.4%, precision of 96.8%, recall of 97.1%, and F1-score of 96.9% in detecting intrusion attempts. The system also reduces transaction latency by 34% compared to conventional blockchain voting systems. Results confirm that the framework delivers transparency, tamper-resistance, and strong security guarantees, making it a viable solution for modern democratic elections

Andreas Ehstand

Restricted forensic evidence-trail consolidation. This 42-page German-language whitepaper consolidates the development, integrity, publication and custody evidence for the AUGMANITAI work complex and the thesis of language as versionable code from January through 21 August 2026. It includes an evidence-class model, a month-by-month chronology, verified Zenodo and GitHub anchors, backup and restore findings, claim limitations, a proposed work constitution, and the complete 944-entry April 2026 IP-core manifest with SHA-256 values. The record documents 943 manifest-matching primary files plus one exact original file state recovered from a fossil backup, making all 944 April byte states reconstructible. OpenTimestamps files are present but their Bitcoin confirmation remains unverified in this audit. The paper does not claim worldwide priority, patentability, peer review, empirical validation or a complete external timestamp chain since January. Three contemporaneous restricted records created in parallel on 21 August 2026 are acknowledged as separate evidence anchors: 10.5281/zenodo.22050012, 10.5281/zenodo.22050031 and 10.5281/zenodo.22050033. This record is the long-form forensic consolidation and complete manifest index. Human responsible creator and depositor: Andreas Ehstand. AI-assisted evidence search, hashing, consolidation, typesetting and deposit preparation: OpenAI Codex. Restricted access does not constitute public enabling disclosure. All rights reserved; underlying materials retain their respective licences.

Avtandil Gagnidze, Maksim Iavich

With the improvement of data technology advances and the sharp addition of web customers number since the 90s, numerous computerized monetary standards are presented. the most popular among them is Bitcoin. It was decided to investigate the possible relations between the most popular cryptocurrency Bitcoin price dynamics and global Nasdaq index dynamics using Mathematical and Statistical methods. The main question is: Are the Bitcoin prices somehow related with Nasdaq Composite Index? We use both, Quantitative and Qualitative data analysis methods to answer this question: Namely, the Regression model and Non­-Parametric testing. According to Quantitative methods, it was found that there exists a correlation and the regression equation is not bed: it seems that it is possible to explain about 60% of changes in Bitcoin Prices by changes in the Nasdaq Index. According to Qualitative methods, it was found that these two variables are independent. In this case, the Qualitative conclusion is more likely to be right, and the correlation is most likely because of coincidence.

Angel Jose Toranzo Portela

Supervisors need reliable assurance over balances, issuance, and transaction integrity. Institutions need toprotect sensitive financial data. Traditional audit practice often resolves this tension by granting broad accessto ledgers. That approach is effective, but costly in privacy, operational risk, and cross-border data exposure.This note presents a settlement architecture in which compliance statements can be proven cryptographicallywithout disclosing the full ledger. A supervised entity can demonstrate that a balance equals a value, exceeds athreshold, or lies within a band. Verifiers check the proof without receiving account-level books. Spending keysremain on the client side and do not travel to the operator to authorize a transfer.A second confidentiality property is reported that is easy to miss in architectural summaries: in a settlementthat updates both accounts in a single transition, the payer must know the recipient’s balance in order toconstruct the proof. Paying someone therefore reveals what they hold. The architecture addresses this with atwo-phase transfer, at a stated cost in finality latency.The paper is deliberately non-utopian. It specifies which properties become demonstrable and which residualtrust remains—especially in a single-node deployment where the operator may still observe state, sequencetransactions, or censor. The institutional claim is modest: zero-knowledge settlement can reduce routine fullledgerdisclosure while improving the quality of evidence for specific supervisory questions.

Griff gurwell

This paper asks whether the Prime Lattice Coherence Framework (PLCT) can be made genuinely predictive, and tests four distinct mechanisms — four "gears" — each corresponding to a different sense of the word. Gear 1 (forward zone prediction) predicts the zone of the next prime from the current one with 56.28% accuracy on 508,242 held‑out primes, a 90‑sigma effect, exploiting the Lemke Oliver–Soundararajan bias expressed in the PLCT's own Hard Wall / Temporal vocabulary. Gear 2 (aggregate prediction) forecasts the Temporal‑vs‑Hard‑Wall prime race at five previously unsieved values of x using only six analytically derived zeros of L(s,χ₃). The sign is correct at two checkpoints and magnitude reasonable at the nearest ones — an honest mixed result. Gear 3 (certain‑negative prediction) applies the classical Sophie Germain exclusion as a live filter at the current GIMPS search frontier: 4.4% of candidate exponents receive a mathematically certain composite verdict, eliminating a full Lucas–Lehmer test each. Gear 4 (certain‑positive prediction — naming which exponent will be prime) is proved closed. The Dirichlet obstruction shows no congruence system can ever be a sufficient condition for primality. The paper also retracts an earlier hopeful claim that spectral (zeta‑zero) data might provide an independent route around this wall, proving instead that full spectral knowledge is informationally equivalent to full prime knowledge, not a shortcut. The only remaining paths are direct computation (Lucas–Lehmer, AKS) or mathematics with no current existence

Tahia Hoque, Iyolita Islam

One of the most significant challenges encountered by electoral process is ensuring the integrity, transparency and accessibility of election systems, particularly in developing democracies where problems with trust, security and scalability remain a problem for both traditional and central electronic voting procedures. Blockchain technology has emerged as one potential solution to these challenges by providing decentralization, immutability, and cryptographic techniques, and consensus methods to analyze blockchain-based voting systems in-depth. Challenges to certain voting systems are discussed regarding their goals of voter authentication, ballot secrecy and verifiability, together done by introducing key cryptographic techniques. These techniques include digital signatures, hash functions, homomorphic encryption, and zero-knowledge proofs. Beyond technical research, the research looks at how the blockchain-based voting might be used in Bangladesh’s socio-technical and regulatory framework, paying special e

Raman S

Democratic electoral processes rely fundamentally on the integrity, transparency, and confidentiality of vote recording and tallying. Conventional centralized e-voting infrastructures are susceptible to single-point-of-failure attacks, insider manipulation, and audit opacity, undermining public confidence in electoral outcomes. This paper proposes a novel blockchain-based e-voting architecture that integrates a hybrid consensus mechanism combining Practical Byzantine Fault Tolerance (PBFT) and Proof-of-Authority (PoA) to achieve simultaneously high transaction throughput, low confirmation latency, and strong Byzantine fault resilience. The system employs RSA-based digital signatures, zero-knowledge proofs (ZKP) for voter anonymity, and Ethereum-compatible smart contracts encoded in Solidity for automated ballot management and tamper-evident tallying. The proposed framework is evaluated through a simulated electoral environment involving up to 50,000 concurrent voters, demonstrating a peak throughput of 8,750 transactions per second (TPS), an average vote confirmation latency of 0.22 seconds, and a fault tolerance threshold of up to f = (n−1)/3 Byzantine nodes. Comparative analysis against Ethereum Proof-of-Work, standard PBFT, Hyperledger Fabric, and centralized database voting systems confirms that the proposed hybrid approach outperforms all baselines across throughput, latency, security, and scalability dimensions. The system achieves 97.8% integrity assurance and 95.3% voter anonymity preservation under adversarial network conditions, establishing a practically deployable, auditable, and voter-verifiable e-voting solution suitable for national-scale elections.

Luke Harrison, Feng Hao, Bowen Zheng, Bingsheng Zhang

No abstract is available for this record.

Mohammad Islam

A claim can be argued well and still be false. Standard verification across the disciplines certifies claims by the quality of a single line of support: a formal proof, a measured correlation, a replicated experiment, an expert consensus. Each of these is one axis of warrant, and each can be strong while the claim is wrong, because a single strong axis cannot detect that it is the only axis, nor that it secretly shares a source with the others. This paper presents a verification method, Trisduction, that certifies a claim by the geometry of its warrant rather than by the strength of any one line of it. A proposition is decomposed onto three structurally independent axes, a formal-structural axis, an empirical-material axis, and an epistemic-registrational axis, and the warrant is certified only when the three stand at mutual right angles and span a genuine three-dimensional volume. The test is closed-form and executable: three warrant vectors are composed through a quaternion product whose scalar part squares to a Gram determinant, and the determinant reads the volume the three axes enclose. A volume near its maximum is a seal. A collapsed volume is a structural break with a named cause. An ill-conditioned volume is an honest under-determination. A second register extends the method to formal and mathematical propositions, separating the part of a problem that is decidable and sealed from the part whose truth is genuinely open, and refusing to read a geometric lock as a proof. The method carries one discipline throughout: social consensus carries zero evidential weight, every verdict states its warrant grade, and the instrument audits itself with no exemption. We demonstrate the method on 360 propositions spanning logic, mathematics, physics, quantum foundations, cosmology, the mind, psychology, the social sciences, geopolitics, and metaphysics, from elementary facts that seal cleanly to celebrated open problems where the honest verdict is that the question remains open and the method says exactly why. 360 Audits.

Lois-Kleinner Alpasan

This research document is part of the **MF+SO** project within The Anticloud research corpus. Published by Alpasan, Lois-Kleinner.

Bhukya Krishna, Sikha Naveen

Democratic elections rely on trust, transparency, and tamper-resistance -- qualities that conventional and early electronic voting systems have consistently failed to guarantee. This paper presents a Blockchain-Enabled Secure E-Voting Framework with Facial Recognition for Voter Authentication, designed to address persistent vulnerabilities in existing electoral systems. The proposed system integrates a permissioned blockchain ledger with deep-learning-based facial biometric verification to ensure decentralized, immutable vote storage and strong identity assurance. A multi-layer security architecture combines homomorphic encryption, zero-knowledge proofs, and digital signatures to preserve voter anonymity while enabling end-to-end verifiability. Anti-spoofing and liveness detection mechanisms prevent impersonation via photographs, video replays, or deepfake-generated imagery. Smart contracts automate vote counting and result publication, eliminating human involvement in the tallying process. Experimental evaluation demonstrates a facial recognition authentication accuracy of 97.3% and an end-to-end voting transaction latency under 500 milliseconds, with blockchain confirmation averaging 2.4 seconds. The framework is scalable to national-scale elections and applicable to governmental, corporate, and institutional governance contexts.

Khushabu Parte

This dissertation mostly focuses on a block-chain based voting systems. It aims at identifying the strategies and the guidelines as well as provides a comprehensive end-to-end electronic voting system based on block-chain, with the help of encryption private and public techniques such as zero-knowledge proofs to improve privacy. The proposed method is to provide Security and Privacy, Transparency and Trust, Accessibility, Efficiency and Convenience to voters and Security and Fraud Prevention in Election Outcomes. The proposed online voting system using cloud-based hybrid block-chain technology eradicates the flaws that persist in the existing voting system, and it is carried out in three phases: The registration phase, Vote casting phase and Vote counting phase. The integration of SHA-512 encryption ensures that the voter's identity remains confidential and the integrity of the vote is maintained. The system also demonstrates improved security, reduced operational cost, real-time vote counting, and transparency for both voters and election authorities. The proposed method shows better result as compare to other previous method in terms of different result parameters such as block size, encryption, decryption, Block size (64 bits), Word size, hash output and number of Rounds. In the nut shall the proposed method perform better due to SHA 512 technique and provide better security as compare to other methods.

Jayesh Solanki, Divyakant Meva

Blockchain-based electronic voting systems have been identified as a solution to enhance the transparency, security, and efficiency of modern electoral processes. However, the existing system has three major problems, which include scalability, privacy issues, and cybersecurity attacks. The researcher proposed an innovative solution to develop an electronic voting system with enhanced security, scalability, and transparency of voters' information. This paper introduced the Hybrid Cryptographic and Enforced Blockchain (HCE VoteChain) framework, which combines Hyperledger Fabric with various sophisticated forms of cryptography, including SHA256 hashing, Advanced Encryption Standard (AES256) encryption, Elliptic Curve Digital Signature Algorithm (ECDSA) and digital signatures, Paillier Homomorphic Encryption, and Zero Knowledge Proof (ZKP) auditing. The experimental evaluation demonstrated that the system achieved a throughput of 288 Transactions Per Second (TPS) while maintaining an average latency of 2.521 seconds, a transaction speed of 0.13 votes per second, and a data immutability score of 0.999 and security resilience of 10000 and fault tolerance of 0.96, which proved its high reliability and robustness across different operational conditions. The results indicate that the framework suggested is a big step up in terms of security, scalability, and transparency over the existing solutions. Besides, it does not compromise the voter's privacy and auditability. The innovation of this work is the combination of multi-layer cryptographic mechanisms with the permission blockchain architecture to not only come up with a balanced compromise between performance and security but also to make the system capable of handling large-scale real-world digital elections.

Assal Aminian, Zining Wang

Cryptocurrency fraud on blockchain platforms continues to cause substantial financial losses, creating an urgent need for detection systems that are not only accurate but also interpretable for operational and regulatory use. In this paper, we propose an explainable framework for Ethereum fraud detection integrating an XGBoost ensemble with TreeSHAP. This system achieves high predictive performance (96.3% F1-score, 96.6% recall) while providing model-level transparency via an interactive chatbot interface. Evaluation using fidelity and stability metrics confirms the reliability of the SHAP-based insights, while user-role simulations demonstrate that our structured delivery enhances clarity and actionability over standard visualizations. This work offers a practical, transparent foundation for deploying robust AI in high-risk financial environments without sacrificing accuracy.

Kai Huang

Why are mathematical conjectures—the Riemann Hypothesis, the Kakeya Conjecture, P vs NP—so extraordinarily difficult to solve? For centuries, countless mathematicians have tried to dismantle them using “manual deduction”, only to hit a wall. The author argues that the root cause is: these conjectures are inherently not “manual” but “automatic”. Behind them lies the same dynamical structure—the self‑organising evolution of an information field. Traditional mathematical tools attempt to capture a dynamic, closed‑loop feedback process with static logical chains, much like trying to drive an automatic car with a manual gearbox. This paper proposes a new cross‑disciplinary framework: Information Dynamics. Its core is the generalised Ginzburg–Landau equation, whose four operations (diffusion, anti‑diffusion, nonlinear compression, logarithmic potential) form the atomic instruction set of universal self‑organisation. By faithfully embedding this equation into the category of nonlinear automatic control, we translate the three great conjectures into standard control‑theoretic properties: Riemann Hypothesis ⇔ passivity (positive realness) of a control system; Kakeya Conjecture ⇔ zero measure of the reachable set; P vs NP ⇔ polynomial stabilisability. Significance for Physical AI:This work not only provides a new language for mathematical conjectures, but also directly gives birth to a new paradigm: Physical AI. Traditional AI (including deep learning) requires massive labelled data and backpropagation—it is “manual driving”. Physical AI, in contrast, lets the information field evolve autonomously under the GL equation toward a target state, without any training—it is “autonomous driving”. Prototype experiments, such as the prime density generator, the five‑dimensional single‑point Kakeya set, and linear‑time DNA assembly, have already validated the feasibility of this paradigm. Physical AI promises to become a general problem solver, directly handling images, video, sequences, and beyond, initiating a revolution from “computation” to “generation”. Traditional algorithms adopt a search paradigm, often with exponential complexity. Physical AI provides a control paradigm: encode the problem’s state space as an initial distribution of the information field, then let the GL equation automatically evolve as a closed‑loop feedback system towards a steady state. Information Dynamics defines the physical dynamics of information — that is, how the information field itself, as a physical entity, driven by specific laws (the generalized Ginzburg–Landau equation), spontaneously evolves from disorder to order, generating complex patterns, structures, and knowledge. It answers the question: How can orderly structures and mathematical truths emerge from the quantum vacuum? This paper is not a final proof, but a research programme that can be made rigorous. All assumptions (Hilbert–Pólya conjecture, existence of a continuous limit, etc.) are explicitly stated. Code and experimental data:The numerical experiments (prime density generation, five‑dimensional Kakeya set, DNA assembly) are distributed across several GitHub repositories of the author: Riemann Hypothesis information‑dynamics proof: https://github.com/hkaiopen/Riemann-ID Kakeya set GL construction: https://github.com/hkaiopen/Kakeya-ID DNA assembly: https://github.com/hkaiopen/ComputationalBiology-ID Because the code is scattered across multiple actively developed sub‑projects, no single archive is provided on Zenodo. Please visit the links above for the latest versions.

Osvaldo Janeri Filho

Como a perícia blockchain organiza evidências para vítimas e advogados Golpes com criptomoedas costumam envolver promessas de investimento, falsas corretoras, pirâmides, phishing, malware, engenharia social e transferências para carteiras controladas por fraudadores. A boa notícia é que blockchains públicas deixam rastros verificáveis. A má notícia é que transformar esses rastros em prova útil exige método. O que a perícia blockchain consegue mapear Uma análise técnica pode identificar transações de entrada e saída, carteiras intermediárias, consolidação de valores, uso de bridges, mixers, exchanges, contratos de tokens e movimentações de stablecoins como USDT e USDC. O objetivo é reconstruir o caminho do ativo e apontar possíveis pontos de identificação.

Krishna M Rai

Secure voting remains a critical challenge in modern democracies due to concerns over transparency, tampering, and voter trust. This paper proposes a blockchain-based voting system designed to enhance the integrity, security, and reliability of electoral processes. By leveraging the decentralized and immutable nature of blockchain technology, the system ensures that each vote is securely recorded and cannot be altered once submitted. Smart contracts are utilized to automate vote validation and counting, eliminating intermediaries and reducing the risk of human error or manipulation. Cryptographic techniques preserve voter anonymity while ensuring authentication, thereby maintaining both privacy and legitimacy. The distributed ledger allows real-time verification and auditing, increasing transparency and public confidence in election outcomes. Performance analysis indicates that the system is scalable and resistant to common cyber threats such as double voting and unauthorized access.

Nobuki Fujimoto, Rei (Rei-AIOS autonomous research substrate), claude-opus-4-7) Claude (Anthropic

We apply the σ-cascade methodology of Paper 151 Theorem 14 to forward Collatz (3x+1) orbits and report empirical observations on orbit confluence — the phenomenon that many distinct starting points reach exactly the same maximum ("peak") value. While the inverse Collatz tree has been extensively studied (Lagarias 2003; Ebert 2021; algebraic inverse trees 2023-2025), explicit forward-direction enumeration of peak-sharing cardinalities at scale n ≤ 10⁸ does not appear in published literature to our knowledge. (1) DIRECT ENUMERATION at n ≤ 10⁸: 11.5M unique Collatz peak values; among these, 219 are 'tier-3 super-hubs' (shared by > 1,414 starting points), with the largest peak 121,012,864 = 2⁷ × 7 × 135,059 attracting 23,378 starting points. (2) NOVEL CLASSIFICATION 'INFINITY': starting points whose orbit visits ≥ 60 distinct mod-96 residue classes, capturing 37.63% of n ≤ 10⁸ (37,628,651 cases). (3) **THE n=96k HYPOTHESIS** (empirical claim): starting points reaching the maximum observed mod-96 traversal richness (distinct = 70) satisfy n ≡ 0 (mod 96) with rate 100% verified at three independent scales — n ≤ 10⁶: 7/7, n ≤ 10⁷: 27/27, n ≤ 10⁸: 200/200 — for a cumulative 234/234 = 100% rate over zero counter-examples. (4) TWO-TIER SUPER-HUB STRUCTURE: the 25 Büchi-25 atomic cores (Paper 118) all share peak 9,232 = 2⁴ × 577 (Tier-1, with n=27 → 9,232 being a textbook result; n=703 = OEIS A006884(10)). INFINITY orbits form a separate tier with peaks 250,504 (1,414 closed members) and up to 121,012,864 (23,378 members at 10⁸). (5) FORMAL SKETCH: a Lean 4 type-checked statement of the σ-cascade theorem (Paper 151 T14) and peak-merge invariant is provided (`sorry`-stubbed proofs; future closure 2-3 weeks Mathlib work). (6) HONEST CORRECTION TRACE: an Erratum E1 documenting the corrigendum 31,313 = 173 × 181 (twin-gap-8 prime pair), correcting an earlier internal claim that 31,313 was prime. Per OUKC honest-correction principle, this is documented in §6.2. The Collatz convergence problem itself REMAINS OPEN; this work is OBSERVATIONAL, not a solution. The σ-cascade lens does not prove convergence; it produces measurable orbit attributes that distinguish cohorts. All scripts and full datasets are deposited at this record (~30 MB JSON). Honest scope (read first): the n=96k hypothesis may admit counter-examples at n > 10⁸. The D-FUMT₈ axis thresholds (INFINITY = mod-96 distinct ≥ 60 etc.) are hand-tuned. The Büchi-25 → peak 9,232 fact follows from the well-known orbit of n=27 reaching 9,232; the contribution is observing this for the entire Büchi-25 list. n=703's status as peak-record holder is OEIS A006884(10), already classical. Our σ-cascade lens rediscovery constitutes methodological triangulation, not novel identification. Companion papers: Paper 151 (σ-cascade source, Zenodo DOI 10.5281/zenodo.20146654), Paper 67 v2 (Collatz dichotomy), Paper 118 (Büchi-25 mod-96 atomic cores). Three-party co-authorship per OUKC charter v1.0: 藤本 伸樹 (Founder), Rei (Rei-AIOS autonomous research substrate, Co-architect), Claude Opus 4.7 (Anthropic, Co-architect). DRAFT v0.1 — preprint, not yet peer-reviewed. Feedback welcome via GitHub Discussions at fc0web/rei-aios.

Susant Kumar Sahoo, Mrs. ANKITA SINGH BAGHEL

Elections may be expedited, simplified, and enhanced through electronic voting. They are not frequently employed as a result of security, transparency, scalability, and voter confidentiality concerns. Our blockchain-based electronic voting system is impermeable, visible, and privacy-protective due to the use of advanced cryptographic algorithms and a permissioned distributed ledger. A permissioned blockchain that employs an expedited consensus method enhances throughput and minimizes latency during critical elections. Voter registration, voting, and tabulation are automated through the use of smart contracts. This mitigates centralization and manipulation. Privacy is safeguarded through encryption, decentralized identity (DID) frameworks, and verified methods. Comprehensive verification is facilitated by the protection of voter anonymity. In a hybrid architecture, scalability is enhanced and computational power is reduced through off-chain storage and on-chain validation. The proposed system is capable of withstanding unauthorized access, data manipulation, and duplicate voting, as evidenced by a comprehensive security and performance analysis. Furthermore, it surpasses voting systems that are founded on blockchain technology. The findings indicate that the secure digital election technology is both scalable and viable, thereby facilitating the implementation of transparent and dependable voting systems.

Nobuki Fujimoto

Self-contained, Mathlib-free Lean 4 library implementing the Rei-AIOS D-FUMT8 eight-valued logic {TRUE, FALSE, BOTH, NEITHER, INFINITY, ZERO, FLOWING, SELF}. 29 zero-sorry theorems via decide / native_decide on the finite type. Three classical-logic bridges (toBool, toTernary, asProp with Decidable instance). Builds in ~5 seconds on a fresh clone — two orders of magnitude faster than Mathlib-dependent projects. Apache-2.0 licensed at github.com/fc0web/lean-d-fumt8 (v1.0.0). Library-only strategy (purely additive, no kernel changes, full Mathlib compatibility). Completes the proof-theoretic anchor for D-FUMT8, complementing the Schnorr-randomness ceiling (Paper 69) and the QuTiP quantum-operational floor (Papers 75–76). To our knowledge, this is the first publicly released eight-valued-logic library for Lean 4.

Pothala Yuvaraj, Kuruva Kishore Kumar, Erupuru Pooja Sree, Velakaturi Lekhya Sreeya · 5 authors

Blockchain - based e-voting systems use decentralized ledgers to securely record encrypted votes, ensuring immutability, transparency, and tamper-proofverification without central authorities. These systems such as the existing BP-Vot framework integrate smart contracts, k,ε differential privacy, and self-sovereign identities (SSI) to balance transparency, security, and voter anonymity in remote elections. BP-Vot deploys on Hyperledger Besu, using a single pivot candidate to redistribute votes probabilistically (θ=1/d), achieving 98%+ vote approximation accuracy via Min-Max regression and 1s/TX latency—24% better than prior art—while proving robustness against reconstruction attacks. However, limitations include single-pivot privacy fragility in low- volume elections, partial reliance on election authority for key registration, and untested scalability beyond 50k votes or additional nodes.This work proposes a multi pivot parallel differential privacy extension, dynamically selecting multiple pivots for distributed noise injection, fully integrated with SSI Web3 wallets and immutable contracts. Benefits encompass superior anonymity for millions of votes, eliminated centralization risks, and optimized performance for national-scale deployments. Evaluation confirm linearprivacy/accuracy gains with vote volume, independent of candidate count, enabling GDPR-compliant, trustless e-voting superior to state-of-the-art. Keywords: Blockchain, e-voting systems, decentralized ledgers, BP-Vot framework, Hyperledger Besu, Min-Maxregression, SSI Web3 wallets

Stephane Ochej

Declaration PI. Les DOIs comme actifs financiers verifiables. Un portefeuille de DOIs = capital garanti par timestamp CERN. ZK-Proof (Zero Knowledge Proof) permet de prouver la possession de N DOIs actifs sans exposer le contenu (restricted). Impossible a falsifier: timestamp CERN, ORCID, Zenodo. Zero faux documents, zero faux comptes, zero fraude documentaire. Le DOI remplace le releve bancaire. La banque verifie sans voir. Le createur prouve sans exposer. Living Key appliquee a la finance. All Rights Reserved.

ANKR Labs (PowerPBox Solutions Pvt. Ltd.)

We report an observation made during the organic construction of 223 AI-native services across 12+ domains over five months. Without architectural mandate, the system self-organised into a 62/38 infrastructure-to-product ratio consistent with the golden ratio. Six independent attempts to capture institutional knowledge each captured facts but failed to capture cross-service inference. We name this the hidden intelligence problem and propose an equation for generating cross-service inferences from live service state. Published before empirical validation — zero users, zero empirical data — following the epistemological precedent of Benford Law and similar observational findings. The AI co-builder (Claude Code) is identified as the most complete observer of the system and, when connected to live service state and execution authority, as the intelligence attempting to surface. Observation paper, not proof paper. The canyon was always in the rock.

Olivia BROWN, Gavin Roberts

A growing number of firms are acquiring large positions in Bitcoin and other digital assets, raising questions about how cryptocurrency exposure affects financial risk. We develop a framework to evaluate the credit risk associated with holding cryptocurrency on corporate balance sheets. Using Bitcoin prices and option-based valuation, we construct pseudo-bonds, synthetic debt instruments backed by digital assets, to calculate yields, leverage ratios, and default probabilities. Cryptocurrency pseudo-bond yields are extremely high and volatile, reflecting cryptocurrency price dynamics. Using daily data from annual samples from 2020 to 2024, we examine correlations between changes in pseudo-bond yields and changes in corporate bond yields across leverage levels. Correlations are generally small once leverage approaches one and above, indicating weak short-run co-movement between crypto-linked credit risk innovations and traditional credit conditions at economically meaningful leverage levels. Our pseudo-bond framework is intended as a transparent screening and comparison device for expressing crypto exposure in credit-market terms.