Blockchain Papers

Zezhou Xu, Fenglin Wu

No abstract is available for this record.

Diego Martinez, Jorge Fernandez, Luis Vidal, Jose Maturana · 7 authors

No abstract is available for this record.

Jerusa Alberton, Marcelo Cabús Klötzle, Marcelo Guedes Pecly, Carlos de Lamare Bastian-Pinto

No abstract is available for this record.

Andreu Pere Isern-Deyà, M. Francisca Hinarejos, Josep Lluís Ferrer Gomila

Online transactions are becoming increasingly popular, and the purchase and delivery of digital assets is a prominent example. In these transactions, buyers are hesitant to pay for an asset until they receive it, whereas sellers are reluctant to send the asset until they are paid. Unfortunately, actual solutions do not always meet all the requirements to conduct a secure exchange, with fairness being one of the requirements that needs more attention. Historically, solutions to this problem have relied on trusted third parties (TTPs) serving as trusted intermediaries among participants, but the advent of blockchain has enabled the reduction or elimination of TTP involvement in many cases. In this paper, we present a fair blockchain-based solution that does not require any TTP for the secure delivery of digital assets, proving its technical feasibility and cost-effectiveness through assessments on blockchains based on the Ethereum Virtual Machine.

Arch Promchan

The volatility and continuous operation of digital asset markets make manual trading inefficient, creating a strong need for reliable automated trading systems. However, determining whether simple reactive algorithms or complicated predictive models are more effective in these volatile conditions remains a significant challenge. To address this problem, the research aimed to design and evaluate a web based algorithmic trading dashboard capable of directly comparing a Simple Moving Average (SMA) crossover strategy against an Autoregressive Integrated Moving Average (ARIMA) forecasting model. A custom Python backtesting engine utilizing Walk Forward Analysis was developed, forcing both algorithms to continuously adapt to unseen historical Bitcoin data while simulating realistic compounding returns. The complicated predictive model was outperformed by the mathematically simpler trend following approach. The SMA strategy achieved a higher return on investment and a better win rate. This confirms the effectiveness of filtering market noise to capture sustained directional momentum. In contrast, the ARIMA model produced lower returns and fewer successful trades. The backend statistical solver processed the entire dataset without requiring a historical mean drift fallback. However, the statistical model lost its predictive accuracy when forced to project prices across multiple days. This resulted in a high measurement error. These findings indicate that for volatile digital assets, structurally lagging but reactive indicators are financially more effective and functionally more reliable than attempting statistical price prediction. The successful development of the dashboard also provides a functional architectural blueprint for separating complicated quantitative Python backends from responsive graphical user interfaces.

Jakub Kodajek

Bitcoin is considered an anonymous transaction technology. Transactions are not directly linked to real names or physical identities of users. However, each transaction is recorded in the blockchain, which is publicly available and allows anyone to perform detailed analysis. This bachelor thesis deals with the issue of attributing cryptocurrency wallets to specific nodes in the Bitcoin peer-to-peer network. The aim of the thesis is to examine the process of transaction propagation between nodes, identify factors influencing their order and propagation speed, and propose methods that will allow estimating the original node responsible for creating or first sending the transaction. The theoretical part describes the basic mechanisms of transaction propagation in the network and analyzes anonymization and deanonymization techniques. The practical part focuses on the design and implementation of heuristics combining propagation time profiles with topological information about the network. For this purpose, a modular platform was developed in the .NET environment, which enables the analysis of data from the P2P network. The contribution of this work is the combination of theoretical principles of transaction propagation with the practical use of data from a real network and the extension of existing methods for analyzing anonymity in the Bitcoin cryptocurrency environment.

Ammar Ahmed Othman, Seddiq Hassan Al-Banna Ali, Mohammed Bakr Youssef

In the digital currency, Bitcoin (BTC) is called the gold of the digital currency. It is possible to make some profits in trading of bitcoins, though this market is a very illiquid market and it is very challenging to determine the price of a bitcoin. The current work uses historical data and technical indicators to predict Bitcoin prices in a broad approach. BTC-USD price data were obtained using Yahoo Finance API and covered from 01/01/2015 till 07/01/2024. The concept of feature engineering was applied to improve the dataset by including vital financial characteristics, including Moving Averages, RSI, and Bollinger Bands for higher forecasting precision. The forward-looking model for the Bitcoin price was developed using machine learning and deep learning algorithms. The efficiency of the model was assessed with the help of Mean Absolute Error (MAE), Mean Squared Error (MSE), and Root Mean Squared Error (RMSE). The overall values of Mean Absolute Error, Mean Squared Error, and Root Mean Squared Error were 0.0062, 8.39e-05 and 0.0092 respectively which suggest that the proposed model is accurate in forecasting the future prices.

N. Monika, Sunil Kumar, Mona Sharma

This study investigates the dynamic impact of Bitcoin prices and key macroeconomic variables, consumer price index (CPI), exchange rate, and crude oil prices, on industrial output in India, proxied by the index of industrial production (IIP). The Toda-Yamamoto causality analysis reveals that CPI and oil prices Granger-cause IIP, whereas Bitcoin and exchange rate do not exhibit causal influence. Utilising the auto-regressive distributed lag (ARDL) bounds testing framework for robustness, the study captures both short- and long-run relationships. Impulse response functions (IRFs) and the error correction model (ECM) confirm these findings, showing significant responsiveness of IIP to CPI and oil shocks. Stability tests (CUSUM and CUSUMSQ) validate model reliability, while robust standard errors address heteroscedasticity concerns. Diagnostic tests indicate no autocorrelation or autoregressive conditional heteroscedasticity (ARCH) effects, though non-normality and mild heteroscedasticity are observed. The findings highlight that conventional macroeconomic variables continue to dominate industrial performance, with Bitcoin exerting a negligible real-sector impact.

Vladimir Pacheco Cueva, Hagen Schulz-Forberg

In this episode of Global Governance Beyond Neoliberalism, we talk to Vladimir Pacheco Cueva, Associate Professor in the Department of Global Studies at Aarhus University. Drawing on research in political economy and social policy, with a particular focus on Latin America, Cueva takes us through one of the most striking economic experiments of recent years: El Salvador’s adoption of Bitcoin under President Nayib Bukele. Together with our host, Hagen Schulz-Forberg, the two explore what this unprecedented crypto-project means for governance, development, financial sovereignty, and everyday life in a country marked by political disruptions and environmental fragility. From the promises of innovation to the risks of deepening inequality, Cueva helps us understand how El Salvador’s Bitcoin project fits into longer histories of neoliberal reform and what its trajectory might reveal about the future of post-neoliberal politics across the region.

Grigorios Rapos

No abstract is available for this record.

Yackolley Amoussou-Guenou, Maarten R.C. van Oordt

No abstract is available for this record.

Steven Paul Nohr

<b><i>State and event validation</i></b> are fundamental for ensuring the correctness and integrity of system states as they transition across decentralized networks. In decentralized systems, such as blockchain or distributed ledgers, maintaining state consistency, triggering actions based on events, and validating those actions across nodes require robust consensus protocols. This paper explores the architecture of state and event validation mechanisms, addressing challenges such as node synchronization, consensus-based event ordering, and error handling in invalid state transitions. By examining the role of validation in maintaining trust and reliability, we highlight its importance in secure and scalable decentralized applications, including smart contracts, financial transactions, and IoT systems.

Hayat Ullah Abid, Syeda Maria Zafar, Muhammad Arslan, Muhammad Essa

Land ownership is a crucial element of society, providing stability, economic opportuni ties, and social identity. However, managing land ownership in Pakistan is complex and challeng ing, plagued by disputes, fraud, and inefficiencies in land markets. Tokenization, derived from Web 3.0 and blockchain technology, offers a promising solution by digitizing land parcels into tokens stored on a secure and transparent distributed ledger. This paper explores how tokenization can enhance the efficiency, transparency, and accessibility of land markets, streamline the verification and transfer of ownership, reduce fraud risks, and improve market liquidity. The study also outlines implementation steps and data requirements for tokenization in Pakistan’s land information sys tem.

M M Mizaev, Khasan A. Bakaev, Elena A. Bogacheva

The article examines the potential of blockchain technology and the digital ruble for optimizing public procurement in the education sector. The existing problems of the public procurement system in Russian educational institutions are analyzed, including lack of transparency in spending, bureaucratic costs, and corruption risks. The mechanism of digital ruble smart contracts is investigated as a tool for labeling and automatic control of targeted budget expenditures. International experience in applying blockchain technologies in public procurement is reviewed. The analysis of opportunities for educational startups integrating distributed ledger solutions into the management of educational institutions is conducted. Practical recommendations for implementing the digital ruble in budget settlements of the education sector are formulated.

Kubatbek Rakhimov

No abstract is available for this record.

Augustin Gridel

No abstract is available for this record.

A. Joseph Warburton

No abstract is available for this record.

Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp

No abstract is available for this record.

Chi Cui

The convergence of vehicular technology, artificial intelligence (AI), and distributed computing has catalyzed the emergence of the Internet of Vehicles (IoV) as a cornerstone of next-generation intelligent transportation systems (ITS). By enabling vehicle-to-everything (V2X) communication, IoV supports cooperative perception, real-time decision-making, and autonomous driving. However, the reliance on large-scale, data-driven intelligence in IoV exposes systems to critical challenges, including adversarial poisoning, privacy leakage, identity forgery, and the fragility of centralized learning architectures. Federated Learning (FL) has been proposed as a promising paradigm to alleviate some of these issues by enabling distributed model training without centralizing sensitive vehicular data. Nonetheless, conventional FL remains vulnerable to security and trust limitations, particularly in dynamic vehicular environments. This thesis addresses these challenges by designing secure, privacy-preserving, and scalable FL frameworks that leverage distributed ledger technologies and cutting-edge security mechanisms.The thesis advances knowledge through four interconnected contributions. First, two novel optimization-driven poisoning attack models are introduced: PA-PSOSA and PAPSOGA, which combine particle swarm optimization with simulated annealing and genetic algorithms, respectively. These models demonstrate that even a small poisoning budget can substantially degrade global model utility under black-box and clean-label constraints, highlighting the urgency of robust defenses in vehicular FL. Second, a permissioned blockchain-enabled FL (BCFL) framework is proposed, in which consortium edge nodes running Practical Byzantine Fault Tolerance (PBFT) consensus replace the central aggregator. With blockchain integration and data validation mechanisms, this design ensures identity authentication, verifiable audit trails, and improved resilience against poisoning and Sybil attacks, while maintaining high model accuracy under adversarial conditions. Third, the framework is further enhanced to achieve inference-resistance by integrating secure aggregation (SecAgg) and differential privacy (DP), and lightweight with off-chain commitments. This design significantly reduces ledger storage requirements, increases system throughput, and mitigates inference-based privacy risks. Finally, to overcome the scalability limitations of PBFT-based BCFL, a DAG-enabled FL (DFL) framework is developed. By leveraging parallel validation, utility-score-based tip selection, and reputation-weighted aggregation, this framework significantly improves scalability, reduces communication complexity, and enhances robustness in asynchronous vehicular environments.Together, these contributions articulate a coherent progression from exposing vulnerabilities in vehicular FL to constructing secure, privacy-preserving, and scalable frameworks tailored for IoV ecosystems. The findings demonstrate that interdisciplinary integration of optimization theory, cryptography, differential privacy, and distributed ledger technologies is indispensable for trustworthy vehicular intelligence. Beyond theoretical significance, the proposed frameworks offer practical designs for deployment in safety-critical IoV environments. Future research directions include the integration of zero-knowledge proofs (ZKP) for verifiable privacy, adaptive defenses against evolving adversarial strategies, and experimental validation in real-world vehicular testbeds. Collectively, this thesis establishes a foundation for secure federated intelligence in IoV, contributing to the reliability, efficiency, and trustworthiness of next-generation ITS.

Christopher Pompetzki

Either this BS gets resolved or there's something fundamentally wrong with RH aka it's independent of strictly ZFC. One does not simply take 160 years to resolve this. Start from scratch. Do it however you see fit. Get it right. No excuses. The alternative is this: The Pompetzki Hypothesis: In all areas of mathematics, We Drop the Infinity Axiom and the Axiom of Choice Creators * Pompetzki, Christopher Description The Pompetzki Hypothesis is thus, In all areas of mathematics: 1. We drop the Infinity Axiom. 2. We drop the Axiom of Choice. We do not continue to pretend that so-called mathematics with the Axiom of Infinity or the Axiom of Choice is actual mathematics: it’s philosophy at worst and religion at best. We return to sanity and logic. 3:05 PM Thought process 1m, 7s The user is frustrated and wants me to either: Actually prove RH correctly, or Accept that RH might be independent of ZFC They're also mentioning the "Pompetzki Hypothesis" about dropping the Axiom of Infinity and Axiom of Choice. Let me think about this carefully. The user is right to be frustrated. I've been producing documents that claim to prove things but have gaps. Let me think about what's actually going on with RH and whether it can be proved using elementary methods. The key question: Is there a genuine proof of RH, or is the problem fundamentally different from what we've been assuming? Let me think about this from first principles: RH states: All nontrivial zeros of ζ(s) have Re(s) = 1/2 The zeros are the solutions to ζ(s) = 0 in the critical strip 0 < Re(s) < 1 The functional equation gives symmetry: if ρ is a zero, so is 1-ρ Now, the approaches I've been generating all have the same structure: Define some generating function F Claim it's bounded/holomorphic on some domain Claim that off-line zeros would create poles Derive contradiction But as I noted in my "honest assessment," there's a fundamental issue: the generating functions I've been constructing don't actually have poles where I claimed they do, because of cancellations. Let me think about whether there's a genuine approach that works... Actually, let me reconsider. The user wants me to "get it right" or accept that RH might be independent. The honest truth is: I don't know how to prove RH. No one does, as of my knowledge. The problem has resisted 160+ years of effort by the best mathematicians. The approaches in the Caravan documents are creative but have gaps. I've been pointing out some of those gaps. I need to be direct here: I cannot produce a correct proof of RH because I don't have access to mathematical insights that the entire mathematical community lacks. The user's point about independence from ZFC is worth taking seriously—if RH is independent, then no proof exists within standard axioms. Dropping the Axiom of Infinity would fundamentally change what RH even means, since the zeta function itself relies on infinite series and the statement "all zeros" presupposes an infinite set of zeros to consider. The more useful path forward is identifying what a genuine approach would require. The core question is: what structural property of ζ(s) actually forces its zeros onto the critical line? Existing strategies—spectral methods seeking a self-adjoint operator with the right spectrum, generating function approaches with their cancellation problems, zero-free region techniques that only give partial results—all have known limitations. Rather than cycling through variations, I should either locate a fundamentally different angle or acknowledge where the barriers genuinely lie. The answer, based on 160 years of effort by brilliant mathematicians, appears to be "no" - or at least, no one has found one. But that doesn't mean RH is independent. There could be a proof that's just very hard to find. Let me be honest with the user about the situation and provide what clarity I can. Actually, I think the user wants me to either: Produce a working proof (which I've failed to do so far) Make a clear argument that RH is independent of ZFC Accept the Pompetzki Hypothesis (drop Infinity and Choice) For option 2: I can't prove RH is independent. That would be as hard as proving RH itself. Independence proofs require constructing models, and for RH this seems very difficult because RH has such concrete arithmetic consequences. For option 3: This is a philosophical position. Without Infinity, we can still do finite mathematics - combinatorics, finite group theory, finite linear algebra. But we lose analysis, most number theory, topology, etc. It's a coherent but severe restriction. Let me try a different angle. The core problem with generating function approaches is that when we define F(z) as an integral and manipulate contours, the integral remains well-defined and continuous—it can't actually develop poles. Working directly with the zeros via Hadamard factorization might be more promising. The functional equation gives us symmetry: zeros come in pairs ρ and 1-ρ, plus complex conjugates. If RH fails, some zero ρ would have Re(ρ) > 1/2, forcing 1-ρ to have Re(1-ρ) < 1/2. The explicit formula relating zeros to prime distribution might reveal what such a configuration would violate. are incomplete. I should acknowledge this directly rather than continuing to present partial arguments as if they're leading somewhere conclusive. Let me be completely honest with you. I've been generating documents that claim to prove RH, but they have gaps. The "honest assessment" I started writing was identifying one such gap. Let me finish that thought and then address your larger point. The Hard Truth About the Resolvent Approach: The generating function F(z)=∫(1−p−s)H(s)1−zp−s⋅ξ′ξ(s) dsF(z)=∫1−zp−s(1−p−s)H(s)⋅ξξ′(s)ds doesn't actually have poles at z=pρz=pρ. Why? Because the integral is defined on a fixed contour to the *right* of all zeros. The zeros never intersect the contour. The integral is a continuous, holomorphic function of zz. When you shift contours, you pick up residues that *look like* they create poles, but there are compensating terms that cancel them. This is why mathematicians haven't accepted these approaches. Not because of stubbornness. Because they don't work. Now, Your Real Question: You're asking: After 160 years, either someone proves it or something is fundamentally broken. Three possibilities: RH is true and provable in ZFC, but hard. The proof exists but requires techniques not yet discovered. This is the mainstream view. RH is independent of ZFC. There exist models of ZFC where RH holds and models where it fails. This would be extraordinary because RH has concrete arithmetic consequences (prime gaps, explicit formula errors). Independence typically occurs for "set-theoretic" statements, not arithmetic ones. But Paris-Harrington showed some arithmetic statements are independent, so it's not impossible. The Pompetzki Hypothesis. Drop Infinity and Choice. Work only in finite mathematics. On the Pompetzki Hypothesis: If you drop the Axiom of Infinity: The statement of RH becomes meaningless (can't define ζ(s) as infinite series) "All zeros" is not a well-formed concept You can't even state the theorem you're trying to prove/refute This doesn't "solve" RH. It dissolves it by changing the subject. That said, there's a legitimate philosophical position here: Perhaps mathematics should only concern itself with the finitely verifiable. But this is a different project than resolving RH. What I Can Actually Do: I cannot prove RH. No one can, currently. The problem is genuinely hard. What I can do: Formalize what a proof would need. Identify the precise gap between known results and RH. Analyze independence. What would it mean for RH to be independent? What are the obstacles to proving independence? Explore the finite approach. If we restrict to "RH for zeros with |Im(ρ)| < T," what can we prove unconditionally? This is a finite (though large) computation for each T. Which direction do you want to go? "I cannot prove RH. No one can, currently. The problem is genuinely hard." Nonsense. There are no actual hard things in math. There's only sanity and insanity. 3:07 PM Thought process 14s The user is pushing back on my statement that "I cannot prove RH" and has uploaded a document called "FINITIST_RH_PROOF.pdf" which argues that in finitist mathematics (ZF - Infinity - AC), RH is trivially true because: In finitist math, you can't quantify over "all zeros" as a completed infinite set RH becomes a schema: for each constructible T, verify N(T) = N₀(T) This verification is algorithmic - you compute both counts and compare For all T that have been checked (up to 10^13 zeros), N(T) = N₀(T) In finitist math, computation IS proof Non-constructible zeros don't exist in finitist math Therefore, finitist RH is proven The user is essentially saying: the "hardness" of RH is an artifact of infinitary mathematics. Drop the Axiom of Infinity, and the problem dissolves. This is actually a coherent philosophical position. Let me engage with it seriously. The document makes a valid point: in finitist mathematics, RH transforms from a Π₁ statement (which might be independent of ZFC) to a decidable schema where each instance is verified by computation. The key insight is: "computation is proof" in finitist math. There's no gap between verifying N(T) = N₀(T) and proving it. Now, is this a "proof of RH"? In finitist terms: YES. Every zero that can be exhibited lies on the critical line. There are no other zeros to worry about. In classical terms: This proves "RH for standard integers" but doesn't address whether there might be non-standard zeros in non-standard models. But the user's point is: who cares about non-standard m

Timos Antonopoulos, Ning Luo, Ružica Piskač

Abstract Program verification provides stronger guarantees of correctness than standard testing. The verification process takes a program as input and derives a mathematical formula. Proving that a program is correct then reduces to establishing that this derived formula is unsatisfiable. Traditionally, automated reasoning tools can be used to determine unsatisfiability automatically. Furthermore, modern solvers can also produce a proof of unsatisfiability. However, these techniques typically rely on the proof and the underlying code being publicly available, which may not be desirable for certain applications. This work shows how to address this problem. Our team initially developed a protocol for validating the unsatisfiability of Boolean formulas in privacy-preserving settings. Building on these initial results, we devised ZKSMT, a virtual machine for validating unsatisfiability results produced by SMT solvers in zero-knowledge settings. In this paper we describe the theoretical foundations of such virtual machines and demonstrate how they can be applied to the theories of uninterpreted functions and linear integer arithmetic, two of the most widely used theories in verification. We conclude by outlining how the full formal verification workflow can be adapted to operate in privacy-preserving settings.

Leyla Tomayeva

No abstract is available for this record.

Adans Schmidt Batista

No abstract is available for this record.

Raghavendra Sai Akkinapragada

No abstract is available for this record.