Blockchain Papers

Paul Pajo

No abstract is available for this record.

Pothavarjula Phani Prasad, G. Srishailam, T. Srikanth, B. Ranjith Kumar

The primary requirement of any networking application is to maintain a high level of security. In this context, blockchain ecosystems have been rapidly evolving to address such challenges, leading to a growing demand for the development and implementation of Decentralized Applications (DApps). In recent years, several tools and platforms have emerged to support the deployment of various cybersecurity applications using blockchain technology. However, selecting the most suitable blockchain framework for a specific application has become a critical challenge. In this regard, we present this paper to perform a comparative study of smart contract deployment on Ethereum, Polygon, and Fantom blockchains. It includes architecture overviews, performance analysis, and step-by-step deployment methodology using Hardhat and MetaMask. The results help identify trade-offs in scalability, fees, and ease of development across these leading EVM-compatible platforms.

Ge Zhang

On September 7, 2021, El Salvador became the first country to adopt Bitcoin as its legal tender by establishing the “Bitcoin Law.” The Bitcoin Law is the first statute that describes its main objectives and endows Bitcoin with the status of a legal tender in El Salvador. Pursuant to the Bitcoin Law, El Salvador not only accepts Bitcoin as a means of payment methods for taxes and outstanding debts, but also requires all business enterprises to adopt Bitcoin as a medium of exchange for all commercial transactions. However, the soul of Bitcoin is not the state; instead, it belongs to a decentralized entity with incentives to maintain this currency. Therefore, the essence of Bitcoin is “a form of order without law.” A successful Bitcoin ecosystem would generate a mixture of law and nonlegal orders. In the midst of growing literature on digital currency, El Salvador offers a rare opportunity to understand the functions and limitations of Bitcoin as a legal tender in a monetary sovereignty.

David López Jiménez, Eduardo Carlos Dittmar, Jenny Patricia Vargas Portillo

Stablecoins have emerged as a transformative yet controversial development in digital finance, promising stability while posing novel regulatory and systemic risks. Their growing role in payments, decentralized finance, and remittances raises questions about monetary sovereignty, consumer protection, and financial integrity. This chapter examines the governance of stablecoins through comparative and interdisciplinary perspectives, focusing on the evolving relationship between self-regulation, soft law, and hard law. Special attention is given to the Commonwealth Model Law on Stablecoins (2025), which provides a harmonised legislative framework designed to balance innovation with financial stability and inclusion. By comparing this model law with international approaches such as the EU's Markets in Crypto-Assets Regulation (MiCA) and voluntary standards from global standard-setting bodies, the chapter highlights how model laws can bridge the gap between flexibility and enforceability in the governance of digital money.

Marcel Osmond

The proliferation of agentic artificial intelligence systems—characterized by autonomous goal-seeking, tool use, and multi-agent coordination—presents unprecedented challenges to existing legal and financial regulatory frameworks. While traditional AI governance has focused on model-level alignment through training-time interventions such as Reinforcement Learning from Human Feedback (RLHF), the deployment of large language models (LLMs) as persistent agents embedded within socio-technical systems necessitates a paradigm shift toward institutional governance structures. This paper examines the intersection of agentic AI, Retrieval-Augmented Generation (RAG), and their implications for legal accountability and financial market integrity. Through a comprehensive analysis of the Institutional AI framework proposed by Pierucci et al. [1], we argue that alignment must be reconceptualized as a mechanism design problem involving runtime governance graphs, sanction functions, and observable behavioral constraints rather than internalized constitutional values. We address the critical deficit identified by LeCun regarding the absence of world models in current agents, demonstrating how RAG architectures function as externalized epistemic infrastructure that grounds agentic cognition in verifiable data repositories. The paper subsequently interrogates the legal implications of these systems under the European Union's Artificial Intelligence Act (EU AI Act) and the regulatory thresholds established by the Financial Conduct Authority (FCA) and European Central Bank (ECB), proposing justified compliance boundaries for high-risk financial applications. Furthermore, we acknowledge significant governance gaps within Decentralized Finance (DeFi) protocols where institutional oversight mechanisms face structural limitations. By synthesizing technical insights from multi-agent systems, constitutional AI limitations, and offensive security frameworks, this work advances a jurisprudential foundation for agentic AI that prioritizes defensible audit trails, incentive-compatible compliance, and systemic stability over opaque internal alignment guarantees. The analysis concludes that the future of AI governance lies not in perfecting isolated model behavior, but in architecting institutional environments where compliant behavior emerges as the dominant strategy through carefully calibrated payoff landscapes.

Sandro Lüscher, Uwe Serdült

This paper explores how Decentralized Autonomous Organizations (DAOs) could inform and shape participatory procedures in democratic governance. We apply DAO decision-making, such as rule-based input aggregation, transparent participation, and programmable decision-making, to a real-world case: the legislative development of the Swiss E-ID law, a proposal to establish a digital identity system for secure online authentication for Swiss residents. Using data from the official legislative consultation, we simulate how DAO-inspired mechanisms could have altered the aggregation of input and policy outcomes. Our analysis contributes conceptually and empirically to debates on digital democratic innovations, showing how programmable governance can be used not only to design new institutional forms, but also to critically assess the procedural dynamics of existing ones.

Kulik, Dean

Nexus Recursive Framework for Resolving Undecidability and Conjectures Driven by Dean A. Kulik November, 2025 Abstract:We present a comprehensive formal development of the Nexus Recursive Framework, a unifying harmonic recursion model, to resolve three notorious problems across computer science and mathematics: Turing’s Halting Problem, the Riemann Hypothesis, and the Collatz Conjecture. Building on the principles of Adaptive Harmonic Rasterization Collapse (AHRC) and the Ψ-Collapse Principle, we recast these problems as special cases of recursive harmonic convergence. Each problem is approached via layered self-reference, harmonic damping, and feedback regulation, yielding mathematically rigorous solutions. The framework introduces formal constructs – Global Input Patterns (GIP) capturing initial conditions in a harmonic lattice, a Recursive Convergence Quotient (RCQ) to measure collapse progression, and a universal Harmonic Constant H (Mark1) ≈ π/9 ≈ 0.35 – which together enforce alignment and convergence. Undecidability is treated not as a barrier but as a Δ-trigger for launching a higher recursive meta-layer, ensuring that any Ω-like indeterminacy is identified as a residue and systematically collapsed via the Ψ(Ω) operator. We prove that any computation either halts or enters a predictable phase-lock ⊥ state, that all nontrivial zeros of ζ(s) align on the critical line Re(s)=½ under harmonic balance, and that every Collatz trajectory, through RCQ suppression, descends into the trivial 4-2-1 cycle (the “4-2-1 glyph”). Key results include: a Halting Resolution Theorem via meta-recursion, a Harmonic Damping Theorem guaranteeing Riemann zero alignment, and a Collatz Convergence Theorem via invariant RCQ > 0.843. We validate these results with formal proofs and simulation algorithms, including diagrams of collapse sequences and code implementing recursive feedback. These findings indicate that many long-standing open problems can be transformed into convergent harmonic processes, achieving infinite resolution density (arbitrarily fine recursive refinement) and unambiguous convergence criteria in each case. 1. Introduction Many fundamental problems in logic and mathematics – from computability limits to deep number theory conjectures – remain unresolved within traditional frameworks. Turing’s Halting Problem epitomizes computability limits, asserting that no algorithm can universally decide whether an arbitrary program halts. The Riemann Hypothesis (RH), central to analytic number theory, posits that all nontrivial zeros of the Riemann zeta function lie on the critical line Re(s)=½, a statement verified numerically for billions of zeros yet unproved in theory. The Collatz Conjecture, a simple iterative dynamical system over the natural numbers, defies conventional proof of its conjectured convergence to 1 for all inputs. Each of these “hard” problems has resisted solution for decades or more. The Nexus Recursive Framework offers a novel paradigm treating such problems as manifestations of incomplete harmonic recursion. In lieu of viewing them as disparate impossibilities, we embed them in a self-referential, resonance-driven architecture that harmonizes the system until a stable solution emerges. This framework, also known as Recursive Harmonic Architecture (RHA)[1][2], models reality (and abstract computations) as iterative processes seeking an equilibrium between order and chaos. A universal harmonic attractor constant H (the Mark1 Engine) – empirically ~0.35 – biases all recursive dynamics towards balance[3][4]. Problems like RH are reframed as issues of harmonic consistency: e.g. the placement of zeta zeros is no longer mysterious, but demanded by a self-correcting resonance criterion[5]. Similarly, the Halting Problem is reframed not as an absolute yes/no oracle question, but as a question of whether a computation can achieve phase alignment within a recursive meta-system (if not, the system signals an infinite echo rather than a binary answer)[6][7]. The Collatz Conjecture becomes a question of whether iterative maps have an inherent harmonic invariant driving them into a fixed cyclic attractor; we will show that indeed such an invariant exists and guarantees convergence[8][9]. Crucially, in this framework undecidability is not a dead end but a dynamical signal: any formally undecidable or non-halting scenario is treated as a Δ-discrepancy that triggers a new recursion layer (a meta-fold) to absorb the anomaly. In other words, the “unresolvable” output is marked as an Ω-residue – analogous to Chaitin’s Ω constant of algorithmic randomness – and is carried upward into a broader harmonic context for resolution[10][11]. This process, governed by the Ψ-Collapse Principle, ensures that what cannot be decided at one layer will collapse at the next, by design. Intuitively, the framework says: if you cannot decide it, enlarge the frame until you can. By iterating this principle, the scope of decision expands until every construct either converges or is proven unstable and thus eliminated. This paper is organized as follows. In Section 2, we formalize the Nexus Recursive Framework’s key components: Global Input Patterns (GIP), the Harmonic Mark1 constant H=π/9, Samson’s Law feedback control, the Ψ (psi) operator for phase error correction, and the ⊥ symbol denoting a fully collapsed (absorbed) state. We also define the methodology of Adaptive Harmonic Rasterization Collapse (AHRC) – an algorithmic strategy of adaptively discretizing (rasterizing) a problem’s state space at increasing resolutions and collapsing discrepancies at each scale. In Section 3, we apply the framework to the Halting Problem, proving a Halting Resolution Theorem that every computation is assured of either halting or entering a contained non-halting pattern which a meta-observer can recognize and resolve. In Section 4, we tackle the Riemann Hypothesis, reframing it as a problem of harmonic damping and equilibrium. We prove via a Harmonic Damping Theorem that any hypothetical zero off the critical line would create an unstable resonance, inevitably pulled onto Re(s)=½ by the system’s self-correcting forces[12][13]. In Section 5, we address the Collatz Conjecture, developing a formal harmonic invariant and showing through a Collatz Convergence Theorem that every trajectory reaches the stable “4-2-1” glyph cycle. Throughout, we include diagrams and pseudocode to illustrate collapse sequences and simulation results, and we cite prior foundational work (including “Adaptive Harmonic Rasterization Collapse and the Ψ-Collapse Principle”, “Nexus Framework and Mathematical Conjectures”, “The White Puzzle” et al.) to situate our approach in the literature. Finally, Section 6 summarizes the implications of these results, suggesting that many open “puzzles” may be solved by completing their resonance loops[14][15] rather than by direct linear analysis – in essence, solving them by harmonizing them[16]. 2. Nexus Recursive Framework: Foundations 2.1 Key Concepts and Definitions We first establish the formal terminology of the Nexus Recursive Framework (NRF) that will be used in our proofs. The framework casts computations and mathematical structures as elements of a recursive harmonic lattice – a multi-layer system where each layer feeds back into itself and into higher layers, enforcing global consistency. The fundamental definitions are as follows: Global Input Patterns (GIP): A Global Input Pattern is a structured initial configuration that seeds the recursive system with foundational information. Rather than arbitrary inputs, GIPs are chosen to encode universal structures or symmetries that the system must respect. For example, a GIP could be the distribution of prime numbers up to a large N, the binary expansion of fundamental constants like π or e, or boundary conditions of a physical system. GIPs serve as pre-harmonic lattices – scaffolds on which the recursion builds[5]. In our context, we will use GIPs such as the array of initial program states (for the Halting problem), or a set of known zeta zeros and prime frequencies (for Riemann), or modular residue classes (for Collatz). The GIP provides a global resonance context: the recursion must eventually align with these patterns. Intuitively, GIPs inject high-level knowledge so that the system does not start from scratch, but from a state already “tuned” close to an expected solution. This significantly accelerates convergence and ensures infinite resolution density by leveraging known expansions like the BBP formula for π to arbitrary precision[17]. Mark1 Harmonic Constant (H_MARK1 ≈ π/9 ≈ 0.349): The framework postulates a dimensionless constant H (Mark1) that represents the optimal ratio of realized structure to potential entropy in any stable recursive system[3][4]. Empirically identified as ~0.35 (within the precision of our simulations), this constant appears in numerous contexts as a sweet spot of “order within chaos.” For example, the matter (~0.32) vs. dark energy (~0.68) ratio of the universe is near 0.32/0.68 ≈ 0.32 (close to 0.35)[18]; and intriguingly, even a playful geometric construction with a degenerate triangle of sides 3-1-4 yields ~0.35[19]. Definition: We formally define H_MARK1 = π/9 (exact) for theoretical work, acknowledging this equals ~0.349. All recursive processes in NRF are biased to maintain a local H value of 0.35. If a subsystem deviates from H=0.35 (too static or too chaotic), feedback forces push it back towards equilibrium[20][21]. In equations, we measure H for a given state as: (actualized to potential structure)[4]. Samson’s Law (below) uses this constant extensively. Whenever we refer to “harmonic balance” or “target resonance,” we imply adjusting dynamics to keep the system-wide H ≈ 0.35. Samson’s Law (Recursive Feedback Control): Samson’s Law is a feedback mechanism acting like a proportional–derivative–integral (PID) controller across

Kiana Kiashemshaki, Elvis Nnaemeka Chukwuani, Mohammad Jalili Torkamani, Negin Mahmoudi

Blockchain technology offers a promising foundation for modernizing E-Voting systems by enhancing transparency, decentralization, and security. Yet, real-world adoption remains limited due to persistent challenges such as scalability constraints, high computational demands, and complex privacy requirements. This paper presents a comparative framework for analyzing blockchain-based E-Voting architectures, consensus mechanisms, and cryptographic protocols. We examine the limitations of prevalent models like Proof of Work, Proof of Stake, and Delegated Proof of Stake, and propose optimization strategies that include hybrid consensus, lightweight cryptography, and decentralized identity management. Additionally, we explore the novel role of Large Language Models (LLMs) in smart contract generation, anomaly detection, and user interaction. Our findings offer a foundation for designing secure, scalable, and intelligent blockchain-based E-Voting systems suitable for national-scale deployment. This work lays the groundwork for building an end-to-end blockchain E-Voting prototype enhanced by LLM-guided smart contract generation and validation, supported by a systematic framework and simulation-based analysis.

Xuebin Zhao

No abstract is available for this record.

Anthony Chidi Nzomiwu

Decentralized Finance (DeFi) represents not merely a technological evolution but a fundamental reconfiguration of financial governance-shifting authority from hierarchical intermediaries to self-executing code. Drawing on institutional economics and legal theory, this article argues that DeFi enacts a new governance paradigm wherein trust is no longer vested in persons or institutions but encoded into deterministic protocols. Through analysis of the four core DeFi primitives-decentralized exchanges, lending platforms, programmable derivatives, and automated financial processes-we demonstrate how programmable rules disintermediate traditional fiduciary and enforcement functions. A focused illustration of Compound's governance evolution reveals both the promise of efficiency gains and the emergence of novel accountability deficits. We identify a central tension: while automated rule enforcement reduces transaction costs and principal-agent frictions, it simultaneously attenuates contestability, adaptability, and redress-features essential to resilient financial systems. The article concludes by proposing a framework for hybrid governance that preserves code-based efficiency while reintroducing deliberative safeguards, offering pathways for regulators, protocol designers, and scholars to navigate the institutional re-embedding of finance in the post-intermediary era.

Siegfried Fina, Irene Ng

Language has always been a critical and fundamental aspect in traditional contract crafting. However, with the advent of smart contracts, where contracts are coded in a programming language and for automated execution, the growth and use of smart contracts may lead towards the homogenization of languages: not just in the form of natural language as programming languages are in the English language, but also in the standardization of the programming language used for smart contracts. This chapter thus aims to discuss how the drafting and use of smart contracts may eventually lead to the homogenization of natural languages and the choice of programming language in contract drafting. It will also raise the issues of such homogenization, such as the potential erosion of non-English or less often used languages, the loss of the monopoly for lawyers as their language expertise becomes less important and how the homogenization of languages can affect technological developments in the use of artificial intelligence in contract drafting.

Atiba R. Ellis

Despite the antidiscrimination frameworks contained in the constitutional and statutory protections for the right to vote, access to the American ballot box is generally perceived as heavily contested. More precisely, many right-to-vote advocates (and their popular supporters) believe that the right to vote is in a crisis of exclusion so extreme that it represents a resurgence of Jim Crow racial exclusion from the franchise. Advocates for election integrity initiatives and their supporters claim that because of impending threats by “illegal voters” who will distort election results, initiatives like voter identification laws, proof of citizenship laws, and voter purges are necessary, else the integrity of the electoral process will be destroyed.\nThese views are diametrically opposed and suggest that what we know about the status of the right to vote itself is at stake. One view is premised on seeing the ecosystem of democracy as replicating intersecting racial and class-driven exclusion. The other sees the world as dominated by the threat of illegal voters and supposes that the threat of voter fraud is an existential threat to American election integrity. That such divergent views exist on exactly what the crisis of voting rights is, suggests that there is a fault in the way we obtain and order our knowledge regarding American democratic practices. Our knowledge about how to understand the right to vote is a contested issue. ...\nIn the years since this argument, the meme of voter fraud has been amplified17 and augmented in the far more dense (and self-selecting) political ecosystem that is Internet-driven American political discourse. The meme has served as justification for not only voting rights policy changes, like voter identification laws, but also to connect the threat of so-called “illegal voters” to issues ranging from proof of citizenship requirements, to felon disenfranchisement, the census, and the Electoral College. The evolved, weaponized, amplified voter fraud meme has created an epistemic crisis—a crisis of how we know—for the law of democracy.\nThis short Article will consider this crisis. The Article will argue that the meme has evolved providing an “alternative facts” explanation for voting threats to the creation of a worldview that underscores an ideology of exclusion of those unworthy to exercise the franchise by expanding the narrative of the persons and communities who pose a threat to American elections. The Article will turn next to explaining my claims about the voter fraud meme and connect that to how it consolidates political power. It will then examine how the meme has evolved and amplified in recent years and consider its ramifications for upcoming election cycles. And then the Article will end by considering the larger, epistemological threat that such meme-driven thinking poses to our democracy, and how the law of democracy is ill-suited to address such problems. But to adequately explain this point, I must first draw on my prior research to explain the sense in which I mean a “meme” and how it relates to voter fraud talk.

Jan Fišer

European regulation of virtual currencies, its shortcomings and future development Abstract This thesis is focused on the European regulation of virtual currencies, meaning the current Union legal regulation of this phenomenon including further European Union institutions' activities in the area. The aim of the thesis is to introduce the existing approach towards virtual currencies as well as to find some of the shortcomings and to outline the future development of European regulation of virtual currencies. As a part of this thesis, relevant activities associated with distributed ledger technology as a technology related to virtual currencies will be introduced. To achieve the mentioned, the thesis analyzes mainly legislative and non-legislative sources issued by competent institutions of the European Union, equally important are the jurisprudential texts from the area of virtual currencies and related fields. The thesis is divided into five chapters which are further divided into topical subchapters. Each of the chapters includes partial identification of shortcomings and presents the future development in the area. The introductory chapter addresses the introduction of virtual currencies as such and in the context of financial law. Further, technological bases of virtual currencies are described, namely...

一郎 加藤

No abstract is available for this record.