Blockchain Papers

Alessandro Chiesa, Michele Orrù

No abstract is available for this record.

Oliver Hirst

Extends the EQBSL (Evidence-Quality Bayesian Subjective Logic) framework with zero-knowledge proof constraints. Allows a prover to demonstrate that their trust opinion was computed correctly from private evidence, without revealing the evidence itself. Bridges cryptographic privacy guarantees with the epistemic trust formalism of EQBSL.

Oliver Hirst

A proof-carrying trust framework where every EQBSL trust claim ships with a zero-knowledge validity certificate verifiable by any third party without re-running the computation. Establishes the formal link between evidence-based subjective logic opinions and zero-knowledge proof systems, enabling trustless trust attestation in decentralised networks.

Sultan Almuhammadi

Zero-knowledge proofs (ZKPs) enable a prover to convince a verifier of knowledge of a secret without revealing it. The ZKP for the square-root problem has many applications in network and cloud security, such as user authentication and privacy-preserving cloud storage auditing. Classical protocols for the quadratic residuosity (square-root) relation require multiple iterations to reach negligible soundness error, incurring latency and communication costs that are critical in cloud settings. This paper proposes a new single-round zero-knowledge proof (SR-ZKP) for the square-root problem that achieves the same soundness as iterative schemes by increasing the challenge length. The protocol requires only one execution of a 4-message protocol (request, commit, challenge, response) and can be transformed into a one-message non-interactive ZKP via the Fiat–Shamir heuristic. The completeness, soundness, and zero-knowledge properties of the proposed scheme are formally proven. The results of this study show that the proposed protocol can achieve approximately \(97\%\) reduction in communication overhead and latency, when compared to an 80-round iterative ZKPs with RSA modulus n of size 2048 bits. This provides a substantial advantage for cloud applications.

José Ignacio Peinador Sala

A Modular DSP Architecture for Extreme-Precision Computation of π Author: José Ignacio Peinador SalaContact: joseignacio.peinador@gmail.comORCID: 0009-0008-1822-3452 🎯 TL;DR: What's This About? Problem: Calculating π at extreme precision hits a "Memory Wall" — parallel algorithms choke on shared memory access. Breakthrough: We discovered that π's calculation can be decomposed using modular arithmetic (mod 6), creating 6 independent computation channels with zero inter-thread communication. Key Insight: This decomposition is grounded in a formal isomorphism with polyphase filter banks in Digital Signal Processing (DSP), a bridge between number theory and engineering established in our companion work. Result: ✅ 100 million digits of π computed with just 6.8 GB RAM (95% parallelisation efficiency) ✅ Shared-Nothing architecture with strictly isolated memory per channel ✅ Stride-6 transition leaf with exact phase correction, compressing recursion depth by 2.6× ✅ Open-source implementation in Python/gmpy2, executable on Google Colab's free tier Why it matters: This architecture transforms an intrinsically memory-bound problem into a CPU-bound one, enabling near-linear scaling on commodity hardware without specialised HPC infrastructure. 📖 Executive Summary This repository hosts the reference implementation and experimental validation of the Hybrid Stride-6 architecture for extreme-precision computation of π. The architecture exploits the arithmetic structure of the Chudnovsky series by decomposing it into six independent modular channels, each processed by a dedicated worker with its own memory space. The decomposition is not an ad hoc optimisation but rests on a rigorous mathematical foundation: the polyphase isomorphism between modular arithmetic on ℤ/6ℤ and multirate signal processing. This isomorphism guarantees perfect reconstruction (no information loss across channels) and orthogonality (no inter-channel interference). The architecture is validated through the 100M Barrier Run: computing 10⁸ digits of π on a resource-constrained Google Colab instance (2 vCPUs, 12 GB RAM) in under 20 minutes, with 95% parallelisation efficiency and a sustained throughput of over 83,000 digits per second. 🏆 Key Contributions 🔬 Theoretical Foundations (Summarised from Companion Work) Polyphase Isomorphism: Formal proof that modular decomposition of integer-indexed series is equivalent to polyphase decimation in DSP Hexagonal Lattice Connection: Geometric motivation via the A₂ lattice (densest circle packing in the plane) Perfect Reconstruction Guarantee: Mathematical proof that the six channels recombine without aliasing or leakage ⚡ Computational Architecture Shared-Nothing Design: Six independent Python processes with strictly isolated memory spaces Stride-6 Transition Leaf: Processes blocks of 6 consecutive terms in a single operation, reducing recursion tree depth by log₂6 ≈ 2.585 Critical Phase Correction: Direct accumulation of the linear term B(k) prevents off-by-one-stride phase errors 📊 Experimental Validation 100M Barrier Run: 100 million digits computed on 12 GB RAM with 95% parallel efficiency Orthogonality Verification: ℓ² norm of channel terms matches norm of original series to machine precision Reference Comparison: All 10⁸ digits match y-cruncher reference values exactly 📈 Performance Highlights 🚀 "The 100M Barrier Run" — Extreme Validation Metric Result Significance Digits Calculated 100,000,000 Exascale-capable architecture Total Time 1,194.32 s (19.90 min) Sustained performance on cloud hardware Parallel Efficiency 95% (1.90× speedup) Near-linear scaling on 2 cores Peak RAM Usage ~6.8 GB Runs within 12 GB Colab limit Throughput 83,729 digits/second Competitive with optimised implementations Numerical Integrity Bit-exact match with y-cruncher Zero cumulative error 🏗️ Architectural Comparison Aspect Monolithic Binary Splitting Hybrid Stride-6 (This Work) y-cruncher (State-of-Art) Memory Pattern Contiguous, saturates bus Local per core, optimises cache Sequential disk I/O Parallel Model Fine-grained synchronisation Embarrassingly parallel (6 processes) Optimised with locks Scalability Memory-bound CPU-bound, linear to 6 cores Disk-speed limited RAM Requirement Entire dataset in memory Working set reduced 6× Uses disk as RAM Design Philosophy Maximise single-thread speed Maximise resource efficiency Maximise absolute speed 🚀 Quick Start & Reproduction 1. Instant Online Experiment (Recommended) Click above to run the complete experimental validation in Google Colab — no installation required! 2. Key Experiments to Reproduce The companion notebook provides step-by-step reproduction of all manuscript claims: Theoretical Foundation: Verify the polyphase decomposition and energy conservation Stride-6 Algorithm: Test parallel computation with arbitrary precision (100k digits) 100M Barrier Run: Reproduce the full-scale benchmark (requires ~7 GB RAM) Performance Analysis: Measure speedup and parallel efficiency ⚙️ Technical Implementation Details The "Stride-6" Computational Engine Unlike conventional Binary Splitting (processes terms individually), our engine implements a compressed transition leaf that calculates the aggregate effect of 6 consecutive terms: def stride6_leaf(k_start): """Calculate compressed transition for block [k, k+5]""" P, Q, B_acc = 1, 1, 0 for m in range(6): n = k_start + m P_n, Q_n, B_n = compute_chudnovsky_term(n) P *= P_n Q *= Q_n B_acc += B_n # Critical phase accumulation T_leaf = Q * B_acc # Correct phase synthesis return P, Q, T_leaf Key Innovation: Direct accumulation of the linear term B(n) prevents phase drift, preserving arithmetic integrity at any scale. Shared-Nothing Architecture Each of the 6 workers operates in complete memory isolation: Independent address spaces (no shared memory locks) Local garbage collection (prevents heap fragmentation) Cache-optimised access patterns (maximises L1/L2 utilisation) Numerical Stability Guarantees Orthogonal decomposition — zero information loss (verified experimentally) Arbitrary precision backend (gmpy2) with proven numerical stability Exact phase correction in the Stride-6 leaf 📚 Citation & Academic Use If this work contributes to your research, please cite: @article{peinador2026modularDSP, title={A Modular DSP Architecture for Extreme-Precision Computation of π}, author={Peinador Sala, José Ignacio}, journal={Zenodo}, year={2026}, doi = {10.5281/zenodo.17768718}, url = {https://github.com/NachoPeinador/Arquitectura-de-Hibridacion-Algoritmica-en-Z-6Z} } The companion theoretical work establishing the polyphase isomorphism is: @article{peinador2026polyphase, title={Polyphase Isomorphism between Modular Arithmetic and Multirate Signal Processing}, author={Peinador Sala, José Ignacio}, year={2026}, publisher={Zenodo}, doi = {10.5281/zenodo.17680023} } 🌐 The Broader Research Programme This architecture is one component of a larger investigation into the computational and physical consequences of the ℤ/6ℤ modular symmetry. Related projects include: Polyphase Isomorphism: Formal mathematical proof of the isomorphism between modular arithmetic and DSP. Modular Substrate Theory: Unified framework for cosmology and hadronic physics. Topological State Preparation: Quantum register initialisation and dissipative protection via ℤ/6ℤ superselection. Common Thread: All projects leverage modular arithmetic (ℤ/6ℤ) as a fundamental organising principle across mathematics, physics, and computation. ⚖️ Licensing & Usage ✅ Academic & Research Use (Free) Available under PolyForm Noncommercial License 1.0.0: Permitted: Academic research, teaching, personal projects, non-commercial forks Requirements: Attribution, license preservation, non-commercial use ⛔ Commercial Use (License Required) Commercial applications require explicit permission, including: Integration into proprietary software products Commercial hardware benchmarking services SaaS platforms and cloud computing services 💼 For Commercial Licensing Inquiries:Contact: joseignacio.peinador@gmail.comSubject: "Commercial License Inquiry — Modular π Architecture" 🌟 Acknowledgments This independent research was enabled by: Infrastructure & Tools Google Colab for democratised computational resources Python ecosystem (gmpy2, NumPy, SciPy, Jupyter) for scientific computing GitHub for open collaboration infrastructure Data & References y-cruncher for validation benchmarks Digital Signal Processing community for foundational theory Community & Inspiration The open-source scientific community for collective knowledge advancement Independent researchers worldwide pushing boundaries outside traditional institutions Last updated: June 2026 | Version: 3.0 | Status: Actively Maintained

Shreyas Wakhare, Eshaan Warade, Parth Yangandul, Shagufta Sheikh

This study introduces a functional EEG-based Multi-Factor Authentication (EEG-MFA) system engineered for accessibility and security utilizing affordable consumer hardware. Our version uses the BioAmp EXG Pill ( |3,000) with Arduino UNO, which is far cheaper than standard biometric systems that need expensive medical-grade equipment (|50,000–|500,000). It gets 86.7% authentication accuracy when the signal is good.The system uses three authentication factors: a password (knowledge), a pattern (behavior), and an EEG biometric (inherence). This makes it more secure. We utilize One-Class SVM with RBF kernel (nu=0.1) for user modeling, which means we don’t have to collect fake data, which is a big problem when using biometrics. The system learns brain patterns unique to each user using just 3–5 enrollment recordings (12 seconds each) and a simple electrode setup (3 electrodes: forehead + ears).Recent improvements in open-source EEG gear have made it much cheaper. With devices like the BioAmp EXG Pill (around 3,000 rupees), OpenBCI boards (100–500 dollars), and NeuroSky MindWave (100 dollars), students can do projects and small-scale research that weren’t possible before with medical-grade equipment. This lower price makes it possible to look into EEG authentication outside of established labs, utilizing real-world consumer technology that has its own problems. Some of the most important new features are: (1) an adaptive learning mechanism that lowers the False Rejection Rate from 20% to 0% over five sessions while keeping the False Acceptances at zero; (2) a tolerance margin system (10%) that makes up for differences in electrode placement; and (3) a complete end-to-end implementation with FastAPI backend, PostgreSQL database, and Next.js frontend.When we tested with real consumer hardware, we found that the most important performance aspect was signal quality (electrode preparation). With the right setup, we got an 80% genuine acceptance rate and a 0% imposter acceptance rate. The 10% Equal Error Rate (EER) is higher than medical-grade systems (¡5%), but it shows that it is possible to use it for specialized security applications, educational research, and proof-of-concept deployments where cost is more important than accuracy.

Joseph Natangwe Ilonga, Mercy Mwangala Ziezo

The fast growth of Internet of Things (IoT) technologies has turned smart cities into big data ecosystems for intelligent mobility, energetic efficiency and public services. But this increasing reliance on IoT data raises significant privacy issues because of the perpetually gathered sensor readings, inter-organisational sharing and algorithmic analyses. In this paper, we focus on the state-of-the-art IoT data-sharing methods that preserve privacy and protect recent progress in preserving privacy while sharing data in the IoT personal record by preserving statistical value. It combines traditional approaches, including anonymisation, differential privacy, federated learning, secure multiparty computation and homomorphic encryption with new technologies (e.g., blockchain-enabled governance, edge intelligence or zero-knowledge proofs) (Nguyen et al., 2023; Alrawais et al., 2024; Lin & Kuo, 2025). The paper analyses the impact of hybrid architectures combining edge-cloud cooperation and decentralised access control for improving data protection, in terms of not losing performance or interoperability. Conclusions: Summary of the main findings, Barriers to Implementation. This paper identifies several ongoing barriers, including computational expense, related to past research. Personal data while preserving its analytical worth. It combines cutting-edge technologies like blockchain-enabled governance, edge intelligence, and zero-knowledge proofs with traditional strategies like anonymisation, differential privacy, federated learning, secure multiparty computation, and homomorphic encryption (Nguyen et al., 2023; Alrawais et al., 2024; Lin & Kuo, 2025). The study investigates how hybrid architectures that incorporate decentralised access control and edge-cloud collaboration can improve data security without compromising interoperability or performance. The results point to enduring obstacles, such as interoperability, computational overhead, and regulatory compliance, especially in urban settings with limited resources. In order to integrate privacy-by-design principles into IoT analytics for smart city governance, the study suggests a multi-layered conceptual framework. To maintain public confidence in urban digital transformation, this framework places a strong emphasis on open data policies, citizen consent procedures, and the incorporation of cutting-edge cryptographic techniques. The information adds to the current discussion on how to balance privacy and innovation in smart cities and provides guidance for system architects, legislators, and municipal IT leaders who want to adopt IoT responsibly.

Hassan Raza, Tsendayush Erdenetsogt, Muhammad Mohsin Kabeer, Muhammad Arsalan Aslam · 5 authors

The block chain technology has become a potential solution to improving security, privacy, and trust on contemporary data management systems. Conventional centralized systems are easily breached, tampered with and unauthorized access makes it necessary to have decentralized systems that cannot easily be tampered with. Block chain offers immutability, transparency, and cryptographic security and smart contracts offer automated access control and auditing. Sensitive information is safeguarded using privacy-saving methods, such as encryption, a zero-knowledge proof, and decentralized identity schemes. Scalability and collaboration are further increased with integration with cloud and big data systems. This review identifies the uses of Block chain, challenges and future research direction, which shows that Block chain is capable of changing the way secure and privacy-conscious data management is achieved.

Abdila Lestari, Asep Id Hadiana, Melina

Perkembangan teknologi komputer dan telekomunikasi meningkatkan efisiensi pengolahan data, namun menimbulkan tantangan keamanan, khususnya pada data rekam medis elektronik (RME) yang bersifat sensitif. Penelitian ini mengimplementasikan metode Zero-Knowledge Proof (ZKP) dan Revest Shamir Adleman (RSA) untuk meningkatkan keamanan dan privasi RME. ZKP memungkinkan pembuktian tanpa mengungkapkan informasi rahasia, sedangkan RSA menjaga kerahasiaan dan integritas data melalui enkripsi-dekripsi. Hasilnya, entropi data meningkat 24,53% (4,8314 menjadi 6,0165 bits/byte) setelah enkripsi RSA 2048-bit dengan padding OAEP berbasis SHA-256. Protokol ZKP metode Schnorr berhasil diimplementasikan tanpa membocorkan rahasia pengguna. Pengujian pada 100 pengguna simultan menunjukkan waktu respons rata-rata 1,8 detik dengan keberhasilan permintaan di atas 94%. Tantangan utama adalah beban komputasi autentikasi ZKP dan efisiensi saat jumlah pengguna bertambah. Integrasi RSA dan ZKP terbukti efektif meningkatkan keamanan, menjaga privasi, dan mempertahankan kinerja sistem RME.

ISHII, DAISUKE

Zero-knowledge proofs (ZKPs) have evolved from foundational interactive proof systems to highly efficient, scalable, and trusted-setup-free constructions powering today’s privacy-preserving and blockchain applications. The field began with the seminal works of Goldwasser, Micali, and Rackoff (GMR) and Goldreich, Micali, Wigderson (GMW) in the 1980s, which introduced interactive proofs, knowledge complexity, and showed that all NP languages admit zero-knowledge proofs. The 1990s brought non-interactive ZK (NIZK) via the CRS model (Blum–Feldman–Micali) and practical sigma-protocols like Schnorr proofs, establishing foundational tools still used today. From the 2000s through early 2010s, research integrated pairings, PCPs, and cryptographic soundness, culminating in pairing-based NIZKs and early succinct argument systems. The SNARK revolution accelerated with QAP-based zk-SNARKs (Gennaro–Gentry–Parno), practical implementations like Pinocchio and libsnark, and the highly efficient Groth16 proving system that became a blockchain standard. Since 2018, the field has shifted toward transparent, universal, and post-quantum-secure systems. Innovations include Bulletproofs (short proofs without trusted setup), zk-STARKs (scalable and PQ-secure), PLONK (universal/updatable setup), and Halo/Halo2 enabling recursive proofs without trusted setup. These advances underpin modern Zcash deployments, zk-rollups, and privacy-preserving scaling systems across Web3. Overall, the ZKP landscape has progressed from theoretical constructs to practical, scalable, and secure systems central to modern cryptography and decentralized computation.

Yersaiyn Mailybayev, Anel Shinykulova, Vladimir Vesselov, Adilkhan Kushukbaev · 5 authors

The rapid expansion of Internet of Things (IoT) devices poses significant challenges for traditional centralized identity and access management (IdM) systems, which suffer from scalability limitations, single points of failure, and notable privacy risks. Although blockchain technology presents a promising decentralized solution, its direct adoption is often constrained by limited transaction throughput, high operational costs, and the computational constraints of IoT devices. To address these issues, this study proposes and rigorously evaluates HybID-AC, a novel hybrid architecture for decentralized identity and access management, specifically designed for large-scale, heterogeneous IoT ecosystems. HybID-AC employs a dual-layer design that separates global trust anchoring from local execution. A highly scalable, feeless Directed Acyclic Graph (DAG)-based distributed ledger functions as a public anchor layer, registering W3C-standard Decentralized Identifiers (DIDs) and access policy hashes. High-frequency access control operations are handled off-chain at the edge layer, leveraging the DIDComm v2 peer-to-peer protocol, Attribute-Based Access Control (ABAC) for fine-grained policy enforcement, and Zero-Knowledge Proofs (ZKP) to preserve attribute privacy. Analytical results demonstrate that the HybID-AC architecture significantly improves latency and cost-efficiency compared to fully on-chain approaches, maintaining stable performance even as network scale increases. Additionally, a novel probabilistic model is introduced to provide a quantitative measure of the integral security risk of ABAC policies under potential attribute compromise. Overall, the study concludes that this hybrid architecture effectively addresses the inherent trade-offs of blockchain in IoT systems, delivering a secure, scalable, and interoperable framework that empowers devices with self-sovereign identity while ensuring privacy and security by design.

J.ArturoOrnelasBrand

Cubical Triads: A Homotopy-Type-Theoretic Foundation for Proportional Reasoning and Abductive Discovery 🌌 Overview Shadow Engine is the reference implementation of the Unified Holographic Resonance Theory (UHRT) and the core logic behind the paper, "Cubical Triads." Unlike statistical AI models (LLMs) that approximate logic via vector probability, this engine treats proportional reasoning as a strict Topological Necessity. It embeds the classical arithmetic of integer proportions into a set-truncated Higher Inductive Type framework from Homotopy Type Theory (HoTT), proving that valid semantic and physical laws are "path fillers" in a synthetic logarithmic space. Key Capabilities ** Topological Immunity:** The engine refuses to "hallucinate." If data is structurally degenerate (redundant or contradictory), it raises a Topological Obstruction rather than attempting a statistical fit or approximation. ** Abductive Discovery (New in v2.1):** It doesn't just reject errors; it rigorously diagnoses them. When an obstruction occurs, the engine mathematically calculates the Missing Integer Factor ($\delta$) required to restore "cubical resonance." This factor is a computable witness for a hidden variable. Physics Example: Predicts missing mass/constants (e.g., in the Degenerate Gravity Test). Security/Semantics: Detects structural impostors (spoofing) that mimic magnitude but lack a fundamental prime signature. ** Thermodynamics of Reason:** Defines Simplicity ($K$) not as a heuristic, but as a Boltzmann probability $K = e^{-E}$ derived from the minimal logarithmic path energy ($E$) in the fundamental $\infty$-groupoid of magnitudes ($\M$). Quick Start Prerequisites Python 3.8+ Installation git clone https://github.com/arturoornelasb/Shadow-Engine.git cd Shadow-Engine # Recommended: Create a virtual environment python3 -m venv venv source venv/bin/activate Usage Run the engine to witness the transition from Validation (Newton) to Discovery (Degenerate Gravity). python Python/shadow_Engine_v2.1.py Experiments: Topological Immunity in Action The file Python/shadow_Engine_v2.1.py contains the core logic (SyntheticShadow class) and two key experiments. 1. The Newton Test (Validation) Validates that fundamental laws ($F=ma$) correspond to identity paths ($E=0, K=1$) in the homotopy category, meaning the proportion is perfectly balanced in its simplest form. 2. The Degenerate Gravity Test (Abductive Discovery) Scenario: A triad is tested against the Gravity Law form $m_1 \cdot m_2 = G \cdot (r^2 F)$, where $G$ is an unknown integer factor $C_4'$. The inputs are structurally redundant: $r^2F=36, m_1=6, m_2=6$. Arithmetic: $6 \times 6 = 36$ is true. Shadow Engine: Detects that GCD normalization ($\gcd(36, 6, 6) = 6$) collapses the magnitude space to a point that requires a fractional solution in $\mathbb{Z}^+$. Internal Trace (Normalized): $1 \cdot 1 = 6 \cdot C_4'$ Output: [GLITCH DETECTED] Topological Obstruction. Prediction: Missing Factor: 6. Meaning: The system deduces a hidden variable (the factor of 6) is necessary to close the Kan cube and restore structural consistency. Repository Structure | Directory | Description | | :--- | :--- | | /Python | The Shadow Engine v2.1. A functional Python implementation of the core GCD-based discovery logic for empirical testing. | | /Paper | The latest $\LaTeX$ source (From GCD to Cubical Triads.tex) and PDF of the research paper. | | /Agda (Coming Soon) | Formal proofs in Cubical Agda or Lean 4 verifying the main Embedding Theorem and properties of the Higher Inductive Type $\M$. | | LICENSE | The license file (CC BY-NC 4.0). | Citation If you use this framework or theory in your research, please cite: Ornelas Brand, J. A. (2025). From GCD to Cubical Triads: A Homotopy-Type-Theoretic Reconstruction of Proportional Reasoning. Contributing This is a foundational zero-to-one project. We are looking for contributors in: Formal Verification: Porting the Python logic and theorems to a proof assistant like Lean 4 or Agda. Knowledge Graphs: Building the "Prime Dictionary" for richer semantic discovery beyond physics. Performance: Optimizing the $\gcd$ operations for massive datasets. ⚖️ License This work is licensed under the Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0). See the LICENSE file for details. License Copyright © 2025 José Arturo Ornelas Brand. "Reality is the unique self-consistent configuration that does not raise a topological exception when asked to justify its own existence."

Mary Jesselyn Co, Bruce Mitchell, Lisa Jordan Powell

This paper describes the development and implementation of an innovative hotel carbon reduction simulation aimed at developing sustainability competencies in business students. Using the Harvard Business School "Net Zero" simulation, we assess how interactive simulation-based learning opportunities improve students' self-assessment of the eight sustainability competencies with a mixed-methods approach. The research examines critical gaps in knowledge of how simulation-based methods can develop integrated competency sets needed to solve complex sustainability challenges. The simulation assigns around 950 first-year management students as hotel managers tasked with achieving 50% emission reductions over seven years while maintaining financial performance. Students select from 29 sustainability initiatives across Energy, Purchasing, and Management categories, working within realistic constraints of carbon budgets, site-specific emission factors, and dynamic market conditions. Our comprehensive analytical design combines pre-post competency surveys with cluster analysis of strategic approaches, and qualitative analysis of learning reflections. Anticipated outcomes are enhanced competency development across all eight dimensions, with gains in systems-thinking, futures-thinking, and implementation competencies. The research aims to provide empirical proof for developing specific sustainability competences as well as demonstrating scalable approaches of integrating sustainability education into core business curriculum.

Owen Dugan, Garcia, Roberto, Ronny Junkins, Jerry Liu · 8 authors

The success of large language models (LLMs) can be attributed in part to their ability to efficiently store factual knowledge as key-value mappings within their MLP parameters. Recent work has proposed explicit weight constructions to build such fact-storing MLPs, providing an improved understanding of LLM fact storage mechanisms. In this paper, we introduce an MLP construction framework that improves over previous constructions in three areas: it 1) works for all but a measure-zero set of feasible input-output pairs, 2) achieves asymptotically optimal parameter efficiency matching information-theoretic bounds for some embeddings, and 3) maintains usability within Transformers for factual recall. Through our improvements, we 1) discover a metric on value embeddings that characterizes facts-per-parameter scaling for both constructed and gradient-descent-trained MLPs, 2) identify a simple encoder-decoder mechanism that empirically matches gradient-descent MLP facts-per-parameter asymptotics across all the inputs and outputs we test, and 3) uncover a fundamental tradeoff between an MLP's fact-storage capacity and its usability within Transformers. Finally, we demonstrate a proof-of-concept application of fact-storing MLPs: modular fact editing on one-layer Transformers by \textit{replacing entire MLPs at once}.

P. Prakash, Faheema Kattakath Sanil, Jeffrey Tom Shaji, Saravanan Palani · 5 authors

The adoption of privacy-preserving techniques in healthcare is significant, especially while handling sensitive medical information. Traditional machine learning approaches raise significant concern regarding privacy, regulations, and data protection. Federated learning has emerged as an effective machine learning approach that enables a group of local models to collaboratively train the global model by sharing their updates instead of sharing the sensitive medical data. Nevertheless, a significant issue with federated learning is its vulnerability to various attacks, including model corruption and data tampering. The authors propose a methodology for developing a secure and privacy-safeguarded collaborative learning model by integrating zero knowledge proof (ZKP) with federated learning (FL). The proposed RS-ZKP methodology utilizes Pedersen commitments within ZKP to verify feature importance, ensuring that they fall within specified bounds without disclosing the actual values. The methodology is validated on two benchmark datasets using metrics accuracy, precision, recall, and F1 score.

Tarsha Kurdi, Mamone

We present ZK IR, a novel 32-bit instruction set architecture (ISA) specifically designed for efficient zero-knowledge proof generation using STARK protocols. Unlike existing zkVMs that adapt general-purpose ISAs like RISC-V, ZK IR is designed from first principles to minimize proving overhead while maintaining compatibility with modern compiler toolchains. Our key contribution is a rigorous analysis demonstrating that a pure 32-bit register architecture with software-based multi-precision arithmetic outperforms designs with wider registers or specialized field arithmetic units. We achieve approximately 2× reduction in constraint count compared to naive approaches. ZK IR uses the Baby Bear field (31-bit prime) with Plonky3 for proving, and provides an LLVM-based compiler infrastructure enabling developers to write ZK applications in Rust, C, and C++.

Jiaxi Liu, Lin Sun, Tianyu Kang, Di Wu · 7 authors

Federated Learning (FL) enables model training on distributed devices while preserving data privacy. However, malicious clients can submit fabricated model updates to fraudulently obtain training rewards, a behavior known as free-rider attacks. Existing detection-based solutions analyze anomalies in model updates but lack direct evidence of local training, making it fail to fully prevent free-riders. To address this limitation, we propose zkVFL, a verifiable FL framework leveraging Zero-Knowledge Proofs (ZKP) to ensure the integrity of local training while preserving privacy. To reduce the computational overhead of proof generation in ZKP, zkVFL introduces two novel techniques: (i) anomaly-aware client sampling to selectively perform ZKP verification and (ii) A recursive ZKP protocol (ReMPoT), incorporating a pruning-based layer selection technique, reduces proof generation costs. Experimental results demonstrate that zkVFL improves the accuracy and convergence of FL training under free-rider attacks while significantly reducing the computational and memory overhead of proof generation on resource-constrained devices.

Talgar Bayan, Adnan Yazıcı, Richard Banach

Permissionless blockchains have evolved beyond cryptocurrency into foundations for Web3 applications, decentralized finance (DeFi), and digital asset ownership, yet this rapid expansion has intensified privacy vulnerabilities. This study provides a comprehensive review of recent trends, emerging privacy threats, and mitigation strategies in permissionless blockchain ecosystems. We examine six developments reshaping the landscape: meme coin proliferation on high-throughput networks, real-world asset tokenization linking on-chain activity to regulated identities, perpetual derivatives exposing trading strategies, institutional adoption concentrating holdings under regulatory oversight, prediction markets creating permanent records of beliefs, and blockchain–AI integration enabling both privacy-preserving analytics and advanced deanonymization. Through this work and forensic analysis of documented incidents, we analyze seven critical privacy threats grounded in verifiable 2024–2025 transaction data: dust attacks, private key management failures, transaction linking, remote procedure call exposure, maximal extractable value extraction, signature hijacking, and smart contract vulnerabilities. Blockchain exploits reached $2.36 billion in 2024 and $2.47 billion in the first half of 2025, with over 80% attributed to compromised private keys and signature vulnerabilities. We evaluate privacy-enhancing technologies, including zero-knowledge proofs, ring signatures, and stealth addresses, identifying the gap between academic proposals and production deployment. We further propose a Secure Development Lifecycle framework incorporating measurable security controls validated against incident data. This work bridges the disconnect between privacy research and industrial practice by synthesizing current trends, providing insights, documenting real-world threats with forensic evidence, and providing actionable insights for both researchers advancing privacy-preserving techniques and developers building secure blockchain applications.

Akhileshwar Pathak

Democratic institutions increasingly rely on verifiable digital trust to enable fair participation and evidence-based decisions. Truvry is a decentralised protocol that converts behaviour-based evidence (usage patterns, transaction integrity, peer attestations) into portable cryptographic proofs that remain independent of any single platform or identifier, allowing individuals to transfer trust capital across domains while preserving privacy. The current prototype is zero-knowledge–compatible; in this version we use hashed proof anchoring and field-level redaction (no zk-SNARK module is deployed), with configurable smart-contract verifiers. By decoupling trust from identity, Truvry widens citizen inclusion, mitigates gatekeeping bias, and supplies auditable inputs for AI-mediated governance. In prototype tests (n=112), end-to-end proof issuance averaged 3.7 s (fastest local 1.4 s), verifier parse+check averaged 1.8 s, and the current minimum anonymisation entropy is 8.9 bits; gas costs for optional on-chain anchoring remained below US$0.02. All results are based on simulated user streams; a production pilot is planned.

Olha Mykhailenko, Kyrylo Gorokhovskyi, Semen Gorokhovskyi

The paper explores the possibility of expanding the use of end-to-end encryption protocols based on the Double Ratchet algorithm in applications with low trust in the server, particularly in turn-based games and strategic interactions. The relevance of the research is due to the growing need for secure communication in cyberattacks, especially during military operations. The field of end-to-end encryption requires the study of additional applications beyond the usual ones, such as encrypted communication in text messengers. The developed implementation of the protocol can be safely used in any applications that aim to implement end-to-end encryption and satisfy the criterion of session ephemerality (in cases where secrets are stored outside a secure environment). The implemented server supports ephemeral sessions, which guarantee minimal risks of information compromise, and uses digital signatures (EdDSA) for user authentication. Logical routing of requests ensures efficient message transmission in secure scenarios. The choice of the classic game of checkers as an example allowed the authors to effectively demonstrate the advantages of end-to-end encryption and the capabilities of the implemented protocol. All cryptographic operations, including key generation, encryption and decryption of messages, are successfully performed on client devices. It is important to improve error handling mechanisms and optimize the operation of WebAssembly. An interesting area of further research is the creation of zero-knowledge proof mechanisms to prevent Man-In-The-Middle attacks during the creation of a shared secret, optimizing integration with cryptographic hardware security modules (HSM), and exploring the scalability of the solution. The proposed approach can be used to solve real-world information security problems where trust in the data transmission channel is critically important. Thus, the work has created a comprehensive solution that includes a cryptographic protocol, a backend, and a web client, which demonstrates the viability of end-to-end encryption in browser environments and multiplayer games. The work can be used as a basis for further research and development in the field of security of communication systems and privacy in multiplayer games.

J Nagapriya, J. Srimathi

Graph-structured data has become central to modern analytics, enabling institutions to model relationships in domains such as healthcare, finance, cyber security, and education. However, privacy regulations and institutional policies restrict the sharing of sensitive nodes, edges, or interaction logs, preventing the discovery of global graph patterns. This paper introduces a novel framework for Federated Graph Pattern Mining Across Institutions (FGPM-AI), enabling multiple organizations to collaboratively extract global sub graphs, motifs, and temporal patterns without sharing raw graph data. The framework proposes six novel contributions: (1) Privacy-Preserving Pattern Signatures (PPPS) for anonymized sub graph encoding, (2) Federated Temporal Graph Pattern Mining (FT-GPM) to learn evolving patterns across distributed graphs, (3) Zero-Exchange Federated Sub graph Matching (ZE-FSM) using zero-knowledge proofs, (4) Heterogeneity-Aware Graph Pattern Consensus (HGPC) for semantic alignment between distinct graph schemas, (5) Communication-Adaptive Pattern Sharing (CA-FGM) for bandwidth-efficient collaboration, and (6) Multi-Party Graph Pattern Distillation (MGPD) for merging patterns into a unified knowledge model. Experimental design considerations demonstrate the feasibility and robustness of the framework. The results highlight FGPM-AI as a promising direction for secure, scalable, and intelligent cross-institution graph analytics.

Revista, Zen, HISTORY, 10

Byzantine Fault Tolerance (BFT) protocols are fundamental to achieving consensus in distributed systems where some nodes may behave maliciously. However, traditional BFT mechanisms often rely on strong trust assumptions in a majority of honest participants or incur significant communication overhead for extensive verification, thereby limiting scalability and introducing explicit points of trust. This paper proposes a novel approach to verifiable Byzantine agreement that leverages the power of Zero-Knowledge Proofs (ZKPs) to enhance trustlessness and verifiability. By integrating ZKPs into the consensus process, participants can cryptographically prove the correctness of their protocol actions and proposed states without revealing the underlying sensitive information or requiring every other node to re-execute complex computations. This paradigm shift enables a new class of BFT protocols where agreement is not merely reached but is {em verifiably} correct by any observer, reducing implicit trust and increasing transparency. We outline a conceptual framework for such a ZKP-enhanced BFT protocol, discussing the key integration points for zero-knowledge proofs, the expected benefits in terms of security and scalability, and the challenges associated with its implementation. Our approach aims to pave the way for more robust, scalable, and genuinely trustless decentralized systems.

Shrutika Singh, Anton Alyakin, Daniel Alexander Alber, Jaden Stryker · 12 authors

The performance of Large Language Models (LLMs) on multiple-choice question (MCQ) benchmarks is frequently cited as proof of their medical capabilities. We hypothesized that LLM performance on medical MCQs may in part be illusory and driven by factors beyond medical content knowledge and reasoning capabilities. To assess this, we created a novel benchmark of free-response questions with paired MCQs (FreeMedQA). Using this benchmark, we evaluated three state-of-the-art LLMs (GPT-4o, GPT-3.5, and LLama-3-70B-instruct) and found an average absolute deterioration of 39.43% in performance on free-response questions relative to multiple-choice (p = 1.3 * 10 -5 ) which was greater than the human performance decline of 22.29%. To isolate the role of the MCQ format on performance, we performed a masking study, iteratively masking out parts of the question stem. At 100% masking, the average LLM multiple-choice performance was 6.70% greater than random chance (p = 0.002) with one LLM (GPT-4o) obtaining an accuracy of 37.34%. Notably, for all LLMs the free-response performance was near zero. Our results highlight the shortcomings in medical MCQ benchmarks for overestimating the capabilities of LLMs in medicine, and, broadly, the potential for improving both human and machine assessments using LLM-evaluated free-response questions.

Diyan Putranto, Fransiscus Amonio Halawa, Rintis Eko Widodo, Fahmi Setiawan · 5 authors

The competitive hospitality sector faces a growing credibility crisis, where rising consumer skepticism regarding "greenwashing" severely limits the ability of hotels to capture the Sustainable Revenue Premium. This research addresses a critical gap in Sustainable Supply Chain Management (SSCM) literature by empirically modeling the "Credibility Mechanism"—the process by which digital technology resolves information asymmetry to monetize sustainability claims. Focusing on the complex Food and Beverage (F&B) supply chains of emerging archipelagic economies, the study employs a rigorous sequential mixed-methods design. First, Design Science Research was utilized to architect a permissioned cross-chain blockchain framework integrating Zero-Knowledge Proofs (ZKPs) for verifiable, private provenance. Subsequently, Partial Least Squares-Structural Equation Modeling (PLS-SEM) confirmed that blockchain-enabled transparency significantly mitigates perceived greenwashing risk, which in turn fosters Customer Trust. Critically, the study validates financial outcomes using a Stochastic Frontier Bayesian Model (SFBM) applied to longitudinal hotel data. Results demonstrate that adopting this traceable framework yields an 8.4% increase in F&B revenue efficiency and sustains a 5.1% price premium for ethically sourced items. These findings provide profound theoretical advancements by redefining SCM risk mitigation through Information Governance rather than material redundancy. Managerially, the research offers a data-driven justification for high-tech investment, proving that verifiable transparency is a direct revenue driver essential for competitive advantage in opaque markets.