Blockchain Papers

Augustin Gridel

No abstract is available for this record.

A. Joseph Warburton

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.

Raghavendra Sai Akkinapragada

No abstract is available for this record.

Gina-Gail S. Fletcher, Veronica Root Martinez, Steven L. Schwarcz

No abstract is available for this record.

Steven L. Schwarcz, Regis Bismuth, Anne-Catherine Muller, Anne-Claire Rouaud · 17 authors

No abstract is available for this record.

David Krause

No abstract is available for this record.

Paul Atagamen Aidonojie, Godswill Owoche Antai, Esther Chetachukwu Aidonojie, Saminu Wakili Abacha · 5 authors

The rapid growth of the metaverse which is a virtual space that integrates augmentedreality, virtual reality, and blockchain technologies brought immense economicopportunities and challenges across the world. While developed nations increasinglyposition to leverage these opportunities, developing countries like Nigeria may faceunique obstacles in utilising the metaverse technology. It is in this regard, that thisstudy examines the legal and regulatory issues as it concerns the economic challengesposed by the metaverse in Nigeria's economy, indicating how regulatory gaps,infrastructure limitations, and inadequate legal frameworks can serve to impacteconomic participation in the growth of virtual spaces. Concerning this, the study willemploy the use of doctrinal methods of study, relying on primary and secondarysources of research materials. The data obtained from these sources were analysedusing a descriptive and analytical method of study. The study found that the conceptof metaverse has gained global recognition, and it could aid in the development of theNigerian economy. The study further found that several legal and social issues mayarise in utilising the metaverse concept in the Nigerian economy. Given the review ofcurrent legislation on virtual assets, decentralized finance, and immersive digitalinteractions, these challenges include data privacy, digital property rights, taxation,consumer protection, and cybersecurity. Hence, the study, therefore, concludes andrecommends that there is a need for Nigeria to implement a decent regulatoryapproach, considering both rights and interests when operating its economy throughmetaverse technology and economically maximizing the opportunities the metaversetechnology presents to Nigeria.

Waseem Kkhoso

No abstract is available for this record.

eligio haddad

No abstract is available for this record.

David Krause

No abstract is available for this record.

Pavani Aravalapalli

No abstract is available for this record.

Sushmita Chakraborty

No abstract is available for this record.

Dung Cao, Palaash Gang

No abstract is available for this record.

Athar Kharal, Sanaa Anjum, SyedA Yasmeen

No abstract is available for this record.

Dr Mu’azu Omeiza Musa, Professor Olugbenga-Bello Adenike, MBBS, PhD, Adah Patrick Eneojo, Dr Onoja-Alexander Mary Ojonema, MBBS, PhD FWACP · 7 authors

Strengthening Primary Health Care (PHC) financing, governance, and operational readiness is fundamental to achieving resilient health systems and sustainable health security in low- and middle-income countries. Between 2022 and 2025, the Kogi State Government implemented a package of PHC reforms comprising Decentralized Facility Financing (DFF), the Minimum Service Package (MSP), and Continuous Quality Improvement (CQI) interventions to improve service delivery, strengthen facility readiness, stabilize commodity supply systems, and expand equitable access to vulnerable and hard-to-reach populations. We evaluated the Health Systems for Health Security success coefficients in Kogi State using a facility month DHIS2 panel of n=96 PHCs (January 2019–December 2025) and BHCPF Monthly Report Forms (2024–2025). The quasi experimental mixed methods design combined an augmented two way fixed effects Difference in Differences (DiD) estimator for average treatment effects, Interrupted Time Series (ITS) segmented regression to decompose immediate (level) and sustained (slope) impacts, multilevel mixed effects models for heterogeneity, and bootstrap causal mediation to quantify operational pathways. Models adjusted for seasonality, HRH density, environmental risk, and facility fixed effects; inference used cluster robust standard errors and bootstrap confidence intervals. Primary analysis used R (4.3.2) with lme4, fixest, brms/rstanarm, INLA, MatchIt/WeightIt, CausalImpact, sf, spdep; confirmatory DiD and event study checks used Stata/MP 18.0. All code was versioned in Git and analysis notebooks and key outputs were archived. DFF with CQI produced statistically and programmatically meaningful gains across core BMPHS indicators: DPT3 +6.2 percentage points (95% CI 3.9–8.5); ANC1 +5.1 pp (95% CI 2.8–7.4); SBA +4.8 pp (95% CI 1.9–7.7); PNC +4.3 pp (95% CI 1.6–7.0). ITS decomposition for DPT3 showed an immediate level increase of +3.7 pp (95% CI 1.9–5.5) and a sustained slope of +0.12 pp/month (95% CI 0.06–0.18). Mediation analysis attributed large shares of the DPT3 gain to facility readiness, functional Ward Development Committees, tracer drug availability, and IPC compliance as the largest contributors. Predictable facility financing coupled with CQI and targeted investments in readiness, governance, and supply chain resilience yields rapid and sustained improvements in immunization and maternal health coverage. Policy priorities include protecting cold chain and tracer drug lines, institutionalizing WDC governance and IPC audits, and targeting surge HRH and outreach financing to high risk LGAs to close equity gaps. The findings demonstrate the predictability of decentralized financing combined with CQI, governance strengthening, outreach expansion, and operational readiness investments towards the improvement of PHC utilization, immunization coverage, maternal health services, and health system resilience. The study provided epidemiologic evidence to test integrated PHC financing reforms relevance in the strengthening of Health Systems for Health Security (HSFORSHS) in improving accessibility, equity, preparedness, surveillance functionality, and continuity of essential services in vulnerable populations.

Christopher Staples

No abstract is available for this record.

David Krause

No abstract is available for this record.

Sergei Solovev

Predicting short-term mid-price movements from limit order book (LOB) data is a fundamental problem in quantitative finance and market microstructure research, with direct applicability to both traditional exchanges and cryptocurrency markets—including centralized exchanges (CEXs) and emerging on-chain LOB protocols in decentralized finance (DeFi). We present three contributions to this domain. First, we propose DA-BiGRU-CNN, a domain-aware dual-branch architecture that decomposes LOB features into price and volume information channels, processes them through dedicated bidirectional GRU encoders with shared microstructure features, and fuses temporal representations via a multi-scale convolutional bottleneck (Conv1d with kernels k = 3,5,7). Second, we provide empirical evidence for a "feature sufficiency" hypothesis: a unidirectional GRU trained on 53 basic features achieves performance statistically equivalent to one trained on 219 extensively engineered features—including rolling statistics, exponential moving averages, and lag/difference features—suggesting that recurrent hidden states implicitly learn these temporal patterns. Third, we document a "negative ensemble effect" where combining sequential (GRU) and tabular (gradient boosting) models consistently degrades prediction quality, contradicting the widely-held assumption that model diversity improves ensemble performance. On a large-scale dataset of 12,165 LOB sequences (12.1M timesteps), our GRU baseline achieves a weighted Pearson correlation of 0.266, outperforming LightGBM by 58%, while our domain-aware architecture offers an architecturally principled alternative that naturally separates price dynamics from liquidity dynamics.