Blockchain-based electronic voting systems that use zero-knowledge proofs (ZKPs) have been proposed as good candidates to provide both transparency and privacy of ballots. However, a fundamental challenge remains unmet in all existing schemes: the secure generation and protection of the voter's cryptographic secret key.In this paper, HME-KG (Hybrid Multi-Source Entropy Key Generation) is presented, a new credential derivation method which utilizes a cryptographically secure random salt, the national identity number of the voter and a per-device Client Device Secret (CDS) to derive a deterministic, brute-force-resistant secret key. HME-KG is integrated into BAVS-ZK, a complete anonymous blockchain voting framework employing AES-256-GCM encrypted credential storage, a Circom-based Groth16 zk-SNARK voting circuit, and on-chain nullifier verification via Ethereum Sepolia smart contracts. Security analysis demonstrates that HME-KG achieves voter determinism, cross-voter uniqueness, single-source failure resistance, and collision resistance under the security assumptions of SHA-256. Experimental evaluation on a 10,000-voter simulation confirms a 0.9998 scalability coefficient, 1.2-second proof generation, and 306,720 gas per vote—a 38.6% reduction compared to the Open Vote Network baseline. To the extent of current literature, BAVS-ZK is the first blockchain e-voting system to provide a complete, formally specified, and experimentally validated voter credential derivation and protection scheme.
In this thesis, I investigate the existence, magnitude, and evolution of regional overnight return anomalies in Bitcoin. Using high-frequency BTC/USDT data spanning August 2017 to March 2026, I construct session and overnight return components for three regional pseudo-sessions, based on local stock exchange trading hours – Asia (TSE), Europe (Xetra/LSE), and the United States (NYSE/Nasdaq). I document that Bitcoin exhibits a significant overnight premium in the Asian pseudo-session over the full sample, which persists after controlling for realised volatility, trading volume, and illiquidity. No significant premium is found for Europe or the US over the full sample. Notably, holding Bitcoin exclusively during Asian trading hours would have produced a negative cumulative return over a period in which the price of Bitcoin appreciated significantly. Second, the premium is not constant over time; it is strongest during speculative, retail-dominated phases and compresses during bear markets, consistent with the Adaptive Markets Hypothesis. Third, I examine how the introduction of US spot Bitcoin ETFs affected the premium using a difference-in-differences analysis, finding that the overnight premium increases in the US region, while the Asian overnight premium collapses to statistical insignificance. Finally, I find that a simulated trading strategy based on the Asian overnight premium underperforms a passive buy-and-hold benchmark under standard retail fee structures, consistent with the limits-to-arbitrage hypothesis. The findings extend the overnight drift literature to a continuously traded asset and provide direct empirical evidence for geographically segmented price discovery in cryptocurrency markets.
Bitcoin has two cryptographic layers. SHA-256 secures mining and the hash chain — it has no periodicity, no rhythm, nothing for the quantum Fourier transform to detect. ECDSA secures signatures — it has rhythm, and Shor's algorithm breaks it. The foundation is quantum resistant. The signatures are not — but signatures are a software upgrade. The hash rate is not. Bitcoin is a shadow-mirror coupling: single hash (shadow, local, independent) coupled to blockchain (mirror, global, irreducible) through proof of work, with a self-regulating coupling constant κ ≈ 128,748 measured across 2,906 days and 12 orders of magnitude. Extended construction from Shadow & Mirror: Complementarity of Computation and Consciousness (Ross, 2026).
We present a novel application of the V-transform — introduced by the author in 1989 — to the theory of the Riemann zeta function. Assuming the Riemann Hypothesis (RH), we derive explicit closed-form expressions for the sums $$S_1=\sum_{k=1}^\infty\frac{1}{\gamma_k^2+1/4}, \qquad S_2=\sum_{k=1}^\infty\frac{1}{(\gamma_k^2+1/4)^2},$$ where $\gamma_k$ denotes the imaginary part of the $k$-th nontrivial zero of $\zeta(s)$. For $S_1$ we give a new proof of the classical formula first verified numerically by Keiper (1992). For $S_2$ we obtain the compact expression $$S_2 = 3 + (\ln 2\pi)^2 - 2\ln 2\pi + \ln\pi + \gamma - \frac{\pi^2}{24} + 2\zeta''(0),$$ with $\zeta''(0) = -2.006356\ldots$ the second derivative of $\zeta$ at $0$. This formula, while implicit in the sum-rule framework of Lehmer (1988) via the relation $S_2 = Z(2) + 2S_1$, does not appear explicitly in this form in the literature. Numerical verification against the first $10^5$ Odlyzko zeros confirms the result with a relative error of $0.04\%$. We further investigate the alternating analogues $$T_1=\sum_{k=1}^\infty\frac{(-1)^k}{\gamma_k^2+1/4}, \qquad T_2=\sum_{k=1}^\infty\frac{(-1)^k}{(\gamma_k^2+1/4)^2},$$ obtaining numerical values $T_1 = -0.003733\ldots$ and $T_2 = -0.000021774\ldots$ via direct summation. These lead naturally to two new constants $\eta_\pi'(0)$ and $\eta_\pi''(0)$, whose analytic nature — whether expressible in terms of known transcendental numbers or special values of $L$-functions — is left as an open problem. The method is entirely tabular: it reduces the Hadamard product factorisation of $\eta(s) = (s-1)\zeta(s)$ to elementary convolutions via the trinomial formula (PA-13) of the V-transform, requiring neither explicit knowledge of individual zeros nor the full Hadamard expansion.
EN — This paper introduces proof-object dissociation as an architectural principle for certification systems. In the major families of existing approaches reviewed here — including trusted timestamping, zero-knowledge proofs, token-based certification models, public key infrastructures, commitment schemes, and proof-of-existence mechanisms — the proof remains structurally tied to the object, secret, or entity whose validity is being established. This paper argues that such coupling should be understood as a dominant architectural convention rather than as a logical necessity. EN — Under proof-object dissociation, a certification reference structure may be generated, preserved, and anchored independently of any future certified object. Certification is then achieved through a controlled activation mechanism that associates an already valid reference structure with a specific object, user, or context. At the architectural level, this shift makes possible a set of properties that are difficult or unavailable in coupled models: pre-certification independent of the future object, deferred activation, mutation or transfer of activation rights without regeneration of the reference layer, and validation without disclosure of confidential source elements. EN — The paper positions this proposal relative to existing certification architectures, outlines a general implementation-agnostic framework, and identifies a further operational capability termed the Blind Pre-Certification Layer (BPCL). FR — Cet article introduit la dissociation preuve-objet comme principe architectural pour les systèmes de certification. Dans les principales familles d'approches existantes examinées ici — notamment l'horodatage de confiance, les preuves à divulgation nulle, les modèles de certification fondés sur des jetons, les infrastructures à clé publique, les schémas d'engagement et les mécanismes de preuve d'existence — la preuve demeure structurellement liée à l'objet, au secret ou à l'entité dont la validité est établie. L'article soutient que ce couplage doit être compris comme une convention architecturale dominante plutôt que comme une nécessité logique. FR — Sous dissociation preuve-objet, une structure de référence de certification peut être générée, conservée et ancrée indépendamment de tout objet futur certifié. La certification est ensuite réalisée par un mécanisme d'activation contrôlée qui associe une structure de référence déjà valide à un objet, un utilisateur ou un contexte spécifique. Au niveau architectural, ce déplacement rend possible un ensemble de propriétés difficiles à obtenir ou absentes dans les modèles couplés : pré-certification indépendante de l'objet futur, activation différée, mutation ou transfert des droits d'activation sans régénération de la couche de référence, et validation sans divulgation des éléments confidentiels sources. FR — L'article situe cette proposition par rapport aux architectures existantes de certification, présente un cadre général agnostique quant à l'implémentation, et identifie une capacité opérationnelle supplémentaire nommée Couche de Pré-Certification Aveugle (BPCL).
Open Knowledge Archive: Proposal for Merit-Based Interdisciplinary Preprint Server Description This proposal outlines a novel approach to open scientific publishing that addresses three critical failures in the current academic system: institutional gatekeeping, disciplinary fragmentation, and binary validation models. Key Innovation: A concentric ring architecture where papers enter freely at the outer rim (zero gatekeeping) and move inward based on accumulated validation. The center represents maximum interdisciplinary verification—where fields converge rather than separate. The Problem: Traditional journals reject AI-assisted research based on writing style, not content quality Independent researchers face systematic barriers (institutional email requirements, credential-based filtering) Interdisciplinary work falls between disciplinary silos Binary accept/reject model provides no pathway for progressive validation The Solution: Ring-based validation (outer rim = unverified, inner rings = progressively validated) Domain slices (papers positioned by subject area, can span multiple fields) Merit determines position, not credentials or authorship method Completely open access (readers never pay) Implementation: Phase 1: $8,000 proof of concept using AI-assisted development (Claude Code)Sustainable through hybrid revenue model (minimal per-paper fees, institutional partnerships, donations) All code released under AGPL-3.0 (prevents proprietary forks) Structured as irrevocable non-profit (cannot be commercialized) This proposal is released under CC BY-NC-SA 4.0 to prevent commercial exploitation while enabling open collaboration. It represents infrastructure for the commons—research validation that serves knowledge, not profit. Includes: 1. Full architectural specification (ring/slice topology, validation pipeline) 2. Technical implementation plan (backend, frontend, moderation system) 3. Governance model (non-profit structure, anti-gaming provisions) 4. Financial sustainability model (revenue sources, cost projections) 5. Phase 1 budget ($8,000 for AI-assisted development) Status: Proposal stage. Seeking collaborators, volunteers, and initial funding.
The exponential growth of digital data has intensified reliance on cloud storage, yet conventional centralized architectures remain persistently vulnerable to unauthorized access, data tampering, and privacy violations. This paper presents a novel blockchain-driven approach for decentralized cloud storage that addresses these concerns through a multi-layered security mechanism. The proposed system fragments a user’s file into multiple independent blocks, encrypts each block using the AES-256 algorithm with PBKDF2-derived keys, and distributes them across distinct nodes of the InterPlanetary File System (IPFS). The corresponding IPFS hash addresses are then recorded on an Ethereum-based blockchain through a Solidity smart contract, ensuring immutability and tamper-resistance of the entire storage index. During file retrieval, the system queries the blockchain to collect all block hash addresses, fetches encrypted blocks from IPFS, reassembles them in the correct sequence, and delivers the decrypted output to the user. The implementation is built using Python, Django, Web3.py, and the Truffle/Ganache development environment, and has been functionally verified across all core user-facing modules.
Intherapidlyevolvingdigitallandscape,freelancing platforms face significant challenges due to a lack of transparency,trust,andcentralizedcontrol.Thispaperpresents the design and implementation of a blockchain-powered web- based project management system integrated with a visual data dashboard. The proposed system leverages Ethereum smart contractstoensuresecure,tamper-proofuserregistration,project posting, bidding,assignment, work submission, payment release, and rating. The backend is developed using Django, while blockchain integration is achieved via Web3.py, enabling secure and transparent interactions. The platform provides real-time analyticsonusers,jobstatus,fundmovement,andratingsthrough a dashboard. The solution enhances trust, transparency,and de- centralization,provingeffectiveforfreelanceprojectecosystems
Blockchain technology and decentralised finance (DeFi) are reshaping financial services by eliminating intermediaries, automating transactions through smart contracts, and expanding global access to capital. Initially designed for cryptocurrencies, blockchain has evolved into a transformative ecosystem that optimises resource management and democratises finance. This study explores the impact of blockchain and DeFi on financial services, focusing on adoption opportunities and challenges. It addresses key gaps in the literature, particularly platform interoperability, security in decentralised environments, and adoption in emerging markets. Using the PRISMA 2020 methodology, the research ensures a rigorous selection and critical evaluation of scientific articles to identify trends, barriers, and potential developments. Findings indicate that blockchain and DeFi can enhance financial inclusion, improve transparency, and strengthen decentralisation. However, they also present challenges such as regulatory uncertainty, technical complexity, and security risks. Overcoming these obstacles requires innovative solutions and strategic collaboration among governments, financial institutions, and technology developers. By shedding light on these dynamics, the study contributes to a deeper understanding of how blockchain and DeFi can reshape financial services, paving the way for a more inclusive, efficient, and secure financial ecosystem.
The rise of Decentralized Autonomous Organizations (DAOs) has contested conventional concepts of state sovereignty and political legitimacy based on the Westphalian order. Decentralized Autonomous Organizations (DAOs) function on blockchain networks, facilitating self-governance, collaborative decision-making, and resource distribution devoid of centralized control. This article examines the potential for DAOs to be acknowledged as politically legitimate sovereign organizations by comparing their governance frameworks to traditional state structures. This analysis utilizes international law, political philosophy, and blockchain governance literature to assess the ramifications of virtual nations on legal recognition, legitimacy, and the prospects of decentralized government.
This study aimed to examine the role of blockchain technology in transforming digital marketing within the emerging Web3 environment, with a specific focus on its impact on consumer trust and marketing efficiency. The research primarily investigated the relationship between blockchain technology as the independent variable and digital marketing transformation as the dependent variable, while also considering consumer trust and marketing efficiency as key outcome variables. A quantitative research design was adopted, and data were collected from 250 respondents, including digital platform users and marketing professionals, using a structured questionnaire based on a 5-point Likert scale. Statistical analyses, including reliability, correlation, and regression, were conducted to test the proposed hypotheses and evaluate the relationships among variables. The findings revealed that blockchain technology had a significant positive impact on digital marketing transformation (β = 0.68, p < 0.001) and consumer trust (β = 0.72, p < 0.001). Digital marketing transformation significantly influenced marketing efficiency (β = 0.70, p < 0.001). The results also indicated that consumer trust played a mediating role in enhancing marketing efficiency, highlighting the importance of transparency and data security in digital environments. The study provides practical implications for organizations by emphasizing the adoption of blockchain-based marketing systems to improve transparency, reduce operational inefficiencies, and strengthen consumer trust. It also highlights the strategic importance of decentralized platforms in shaping the future of digital marketing. References Basal, M., & Şarkbay, Ö. F. (2026). Web3-driven digital marketing and consumer protection. Frontiers in Blockchain. https://doi.org/10.3389/fbloc.2026.1726047 Beck, R., Müller-Bloch, C., & King, J. L. (2018). Governance in the blockchain economy. Journal of the Association for Information Systems, 19(10), 1020–1034. https://doi.org/10.17705/1jais.00518 Bottoni, P., Gessa, N., Massa, G., Pareschi, R., Selim, H., & Arcuri, E. (2020). Intelligent smart contracts for innovative supply chain management. Frontiers in Blockchain, 3, 535787. https://doi.org/10.3389/fbloc.2020.535787 Casino, F., Dasaklis, T. K., & Patsakis, C. (2019). A systematic literature review of blockchain-based applications. Telecommunications Systems, 71(2), 183–210. https://doi.org/10.1007/s11235-018-0457-5 Chenn, A. (2024). Blockchain marketing analytics: A conceptual framework. SSRN Electronic Journal. https://doi.org/10.2139/ssrn.5239010 Frizzo-Barker, J., Chow-White, P. A., Adams, P. R., Mentanko, J., Ha, D., & Green, S. (2020). Blockchain as a disruptive technology for business. Journal of Business Research, 116, 297–307. https://doi.org/10.1016/j.jbusres.2020.05.014 Huang, R., Chen, J., Wang, Y., Bi, T., & Zheng, Z. (2023). An overview of Web3.0 technology: Infrastructure, applications, and popularity. IEEE Access. https://doi.org/10.1109/ACCESS.2023.3274512 Ilyas, D. (2024). Revolutionizing digital marketing with blockchain technology: An empirical investigation of Pakistani SMEs. IBT Journal of Business Studies, 20(1), 65–90. https://doi.org/10.46745/ilma.jbs.2024.20.01.03 Köppelmann, L., & Blask, T. B. (2024). Web3 marketing for enterprises: A systematic literature review. SSRN Electronic Journal. https://doi.org/10.2139/ssrn.4864000 Kshetri, N. (2018). Blockchain’s roles in strengthening cybersecurity. Telecommunications Policy, 42(4), 273–283. https://doi.org/10.1016/j.telpol.2017.09.003 Kumar, A., & Brar, V. (2024). Digital marketing and role of blockchain in digital marketing industry. International Journal of Advanced Research, 1(7), 383–387. https://doi.org/10.61359/11.2206-2438 López Rodríguez, A. M. (2025). Consumer protection in blockchain-based metaverses. Frontiers in Blockchain. https://doi.org/10.3389/fbloc.2025.1675735 Melnyk, A. (2024). Marketing evolution: From traditional to Web 3.0. DOAJ Journal, 10(5), 273–281. https://doi.org/10.30525/2256-0742/2024-10-5-273-281 Puthal, D., Malik, N., Mohanty, S. P., Kougianos, E., & Yang, C. (2018). The blockchain as a decentralized security framework. IEEE Consumer Electronics Magazine, 7(2), 18–21. https://doi.org/10.1109/MCE.2017.2776459 Rafiq-uz-Zaman, M. (2023). The impact of digital literacy on students’ learning outcomes: A comprehensive review. Inverge Journal of Social Sciences, 2(2), 194–205. https://doi.org/10.63544/ijss.v2i2.210 Rafiq-uz-Zaman, M. (2025). The integrated skill-based education framework (ISEF): An empirically grounded model for reforming skill-based education in Pakistan. Global Social Sciences Review, X(III), 157–167. https://doi.org/10.31703/gssr.2025(X-III).14 Rejeb, A., Rejeb, K., & Treiblmaier, H. (2020). Blockchain technology in marketing. Industrial Marketing Management, 90, 343–356. https://doi.org/10.1016/j.indmarman.2020.07.020 Saberi, S., Kouhizadeh, M., Sarkis, J., & Shen, L. (2019). Blockchain technology and its relationships to sustainable supply chain management. International Journal of Production Research, 57(7), 2117–2135. https://doi.org/10.1080/00207543.2018.1533261 Sanghvi, M., Ubarhande, P., Chandani, A., Pathak, M., Wagholikar, S., Bagade, S., & Atiq, R. (2026). Trends in blockchain in finance. Frontiers in Blockchain. https://doi.org/10.3389/fbloc.2026.1730387 Sharma, C. (2025). Mapping the evolution of digital marketing research. Information, 16(11), 942. https://doi.org/10.3390/info16110942 Stallone, V., Wetzels, M., & Klaas, M. (2021). Applications of blockchain technology in marketing. Blockchain Research and Applications, 2(3), 100023. https://doi.org/10.1016/j.bcra.2021.100023 Supraveen, U. J., Srivastava, D., Sharma, Y. K., Sharma, G., Kulkarni, N., & Joseph, C. (2025). Blockchain and marketing: Enhancing consumer trust and transparency. Economic Sciences Journal. https://doi.org/10.69889/wwv40184 Tan, T. M. (2024). A blockchain-based approach to marketing transformation. Journal of Business Research, 172, 114143. https://doi.org/10.1016/j.jbusres.2024.114143 Tapscott, D., & Tapscott, A. (2017). Blockchain revolution. MIT Sloan Management Review. https://doi.org/10.7551/mitpress/11481.001.0001 Thomason, J. (2026). Ethics and governance in Web3. Frontiers in Blockchain. https://doi.org/10.3389/fbloc.2026.1832534 Treiblmaier, H. (2019). Toward more rigorous blockchain research. Frontiers in Blockchain, 2, 3. https://doi.org/10.3389/fbloc.2019.00003 Wan, S., Lin, H., Gan, W., Chen, J., & Yu, P. S. (2023). Web3: The next internet revolution. IEEE Transactions. https://doi.org/10.1109/TNSE.2023.3261234 Xiangjuan, J. (2025). Integration and innovation of blockchain in Web3.0. World Wide Web. https://doi.org/10.1007/s11280-024-01319-7 Yli-Huumo, J., Ko, D., Choi, S., Park, S., & Smolander, K. (2016). Where is current research on blockchain technology? PLOS ONE, 11(10), e0163477. https://doi.org/10.1371/journal.pone.0163477
G. Prabakaran, Dharani Priya M, Jumana Fathima S, Keerthini R · 5 authors
The pharmaceutical supply chain is complex and often faces challenges such as lack of transparency, counterfeit medicines, and inefficient tracking. This project proposes a blockchain-based pharmaceutical supply chain management system using smart contracts to ensure secure and transparent operations. Each medicine batch is recorded on the blockchain with a unique ID, allowing all transactions from manufacturer to pharmacy to be tracked in a tamper- proof manner. The system also enables patients to verify the authenticity of medicines and detect counterfeit products. Additionally, a drug recall feature allows manufacturers to mark defective batches, preventing further distribution. By using blockchain technology, the proposed system improves traceability, enhances security, and ensures trust among all participants in the supply chain
Money laundering in cryptocurrency networks poses persistent challenges for financial intelligence units due to the pseudo-anonymous architecture of blockchain systems and the limited effectiveness of conventional rule-based detection methods. This study introduces chaos theory and recurrence quantification analysis (RQA) as a novel framework for characterizing temporal behavioral dynamics in Bitcoin money laundering transactions. Analyzing 46,564 labeled transactions from the Elliptic Bitcoin Dataset spanning 2009-2018, we construct aggregate time series for illicit and licit transaction volumes across 49 discrete temporal steps, corresponding to the dataset’s inherent graph-based snapshot structure, and apply phase space reconstruction techniques to compute three RQA metrics: determinism (DET), laminarity (LAM), and entropy (ENTR). Results reveal paradoxically higher determinism in illicit transactions (38.24% vs. 16.67% for licit), substantially elevated laminarity (35.80% vs. 0.00%), and greater entropy (0.45 vs. 0.00%), indicating that sophisticated obfuscation strategies inadvertently introduce detectable deterministic signatures. Augmenting conventional graph-based features with RQA metrics significantly enhances Random Forest classification performance, reaching near-optimal levels (F1 = 1.000, AUC = 1.000) within the evaluated dataset environment, with entropy emerging as the single most discriminative predictor. While these exceptional results reflect the high fidelity of chaos-based features in capturing structured laundering patterns from this period, they serve as a benchmark for the theoretical potential of nonlinear analysis in blockchain forensics. These findings demonstrate that temporal complexity features offer a powerful diagnostic tool for real-time monitoring and detection of systemic financial crime in evolving cryptocurrency ecosystems.
Reasoning distillation does not leave uniform traces across target base families. In the current sample, we measure structural and functional identity across reasoning-distillation derivatives in three base-architecture families (Llama, Qwen, and Mistral) at five model scales (1.5B to 70B). Structural displacements are family-graded: Mistral-family targets show scars of 7,701–8,518 times the acceptance threshold, Llama-family targets show 2,858–4,583 times, and Qwen-family targets show 141–516 times — a sixty-fold range across three families, with the third-family result persisting under an independently trained derivative using different training data. Functional consequences do not track structural magnitude uniformly: Llama derivatives show decisive functional hierarchy breaks, Qwen derivatives remain within their base neighborhood, and Mistral — despite having the loudest structural scar — shows only marginal functional displacement. The functional departure is low-rank at every tested scale but varies in character: G₁-dominant in Llama and Qwen families, with a sign-oscillating morphology in Mistral that suppresses centroid-level G₁ signal while preserving per-prompt dominance. The stiffness parameter at the measurement site is inversely ordered with structural scar magnitude across all three families. Fisher curvature, previously proposed as a candidate mechanism at small scale, does not order scar magnitudes correctly at production scale across families. These findings change how derivative identity claims should be interpreted: the expected displacement depends on the architectural context of the distillation, and the structural and functional layers can decouple — a model may show the loudest structural scar in the dataset while absorbing the functional perturbation. The Neural Network Identity Series — Mathematical foundations, empirical validation, and governance frameworks for verifying which model is running Newest addition: Technical Note: The Disappearing Window — AI Logprob Access Withdrawal and the Structural Verifiability of Frontier Model Contracts (DOI: 10.5281/zenodo.20362098) Paper 1: The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry (DOI: 10.5281/zenodo.18704275) Paper 2: Template-Based Endpoint Verification via Logprob Order-Statistic Geometry (DOI: 10.5281/zenodo.18776711) Paper 3: The Geometry of Model Theft: Distillation Forensics, Adversarial Erasure, and the Illusion of Spoofing (DOI: 10.5281/zenodo.18818608) Paper 4: Provenance Generalization and Verification Scaling for Neural Network Forensics (DOI: 10.5281/zenodo.18872071) Paper 5: Beneath the Character: The Structural Identity of Neural Networks — Mathematical Evidence for a Non-Narrative Layer of AI Identity (DOI: 10.5281/zenodo.18907292) Paper 6: Which Model Is Running?: Structural Identity as a Prerequisite for Trustworthy Zero-Knowledge Machine Learning (DOI: 10.5281/zenodo.19008116) Paper 7: The Deformation Laws of Neural Identity (DOI: 10.5281/zenodo.19055966) Paper 8: What Counts as Proof? — Admissible Evidence for Neural Network Identity Claims (DOI: 10.5281/zenodo.19058540) Paper 9: Composable Model Identity — Formal Hardening of Structural Attestations in the Enterprise Identity Stack (DOI: 10.5281/zenodo.19099911) Paper 10:Where Identity Comes From: Path Sensitivity and Endpoint Underdetermination in Neural Network Training (DOI: 10.5281/zenodo.19118807) Paper 11: Post-Hoc Disclosure Is Not Runtime Proof: Model Identity at Frontier Scale (DOI: 10.5281/zenodo.19216634) Paper 12: Family-Dependent Response to Reasoning Distillation Across Structural and Functional Identity Layers (DOI: 10.5281/zenodo.19298857) Paper 13: Safety-Alignment Removal as a Model-Identity Failure — Structural Evidence from Published Weight-Level Mutation Checkpoints (DOI: 10.5281/zenodo.19383019) Technical Note: Agent Identity Is Not Model Identity (DOI: 10.5281/zenodo.19240883) Technical Note: Gap Invariance: Why PPP Measurements Are Domain-Independent by Construction (DOI: 10.5281/zenodo.19275524) Technical Note: Measured Model Substitution Under Valid Agent Credentials (DOI: 10.5281/zenodo.19342848) Technical Note: Artifact Identity Is Not Runtime Identity — Trustfall Lite and the Boundary of File-Level Model Verification (DOI: 10.5281/zenodo.20019127) Formal Verification Stack for Neural Network Structural Identity (IT-PUF Coq Proofs) (DOI: 10.5281/zenodo.18930621) Copyright (c) 2026 Anthony Ray Coslett / Fall Risk AI, LLC. All Rights Reserved. Confidential and Proprietary. Patent Pending (Applications 63/982,893, 63/990,487, 63/996,680, 64/003,244).
The order-statistic gaps that underlie PPP-residualized functional identity measurement are exactly invariant to log-softmax transformation, exactly equivariant under positive scaling (including temperature), and exactly invariant to any position-independent constant shift applied to the logit vector. These are not empirical approximations — they are mathematical identities that hold for any logit vector over any vocabulary size. The result has been formally verified in Coq (GapInvariance.v: 5 theorems, 2 axioms, 0 Admitted). It retroactively strengthens the empirical API-wall finding reported in earlier work: the order-statistic gap geometry measured through API logprobs does not merely "survive" the log-softmax transformation — it is mathematically immune to it. Any deviation attributable to the API boundary must come from truncation, quantization, or coverage limitations, not from the probability-domain transformation itself. Why this matters. Earlier work showed empirically that PPP-based measurements remained stable when models were accessed through APIs that expose log-probabilities instead of raw logits. This note upgrades that result from empirical robustness to mathematical invariance. It removes the probability-domain transformation itself from the list of plausible failure modes. If an API-based PPP measurement deviates from a weights-based measurement, the cause must lie in truncation, quantization, coverage limitations, or the model — not in log-softmax. The API wall is narrower than previously understood, and the space of plausible objections to API-domain model identity measurement has shrunk by one major category. Supplementary Material. This note is accompanied by GapInvariance.v, a Coq proof file that formally verifies the five gap-invariance theorems described in §2: constant-shift invariance, positive-scale equivariance, affine scaling, log-softmax invariance, and general position-independent shift invariance. The file proves 5 theorems from 2 named axioms (OS1 and OS2), with no unresolved obligations (Admitted), and compiles cleanly under the Rocq Prover 9.1.1 (the current release of the Coq proof assistant, compiled with OCaml 5.4.0). It is available for download as a supplementary file attached to this record. The Neural Network Identity Series — Mathematical foundations, empirical validation, and governance frameworks for verifying which model is running Newest addition: Technical Note: The Disappearing Window — AI Logprob Access Withdrawal and the Structural Verifiability of Frontier Model Contracts (DOI: 10.5281/zenodo.20362098) Paper 1: The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry (DOI: 10.5281/zenodo.18704275) Paper 2: Template-Based Endpoint Verification via Logprob Order-Statistic Geometry (DOI: 10.5281/zenodo.18776711) Paper 3: The Geometry of Model Theft: Distillation Forensics, Adversarial Erasure, and the Illusion of Spoofing (DOI: 10.5281/zenodo.18818608) Paper 4: Provenance Generalization and Verification Scaling for Neural Network Forensics (DOI: 10.5281/zenodo.18872071) Paper 5: Beneath the Character: The Structural Identity of Neural Networks — Mathematical Evidence for a Non-Narrative Layer of AI Identity (DOI: 10.5281/zenodo.18907292) Paper 6: Which Model Is Running?: Structural Identity as a Prerequisite for Trustworthy Zero-Knowledge Machine Learning (DOI: 10.5281/zenodo.19008116) Paper 7: The Deformation Laws of Neural Identity (DOI: 10.5281/zenodo.19055966) Paper 8: What Counts as Proof? — Admissible Evidence for Neural Network Identity Claims (DOI: 10.5281/zenodo.19058540) Paper 9: Composable Model Identity — Formal Hardening of Structural Attestations in the Enterprise Identity Stack (DOI: 10.5281/zenodo.19099911) Paper 10:Where Identity Comes From: Path Sensitivity and Endpoint Underdetermination in Neural Network Training (DOI: 10.5281/zenodo.19118807) Paper 11: Post-Hoc Disclosure Is Not Runtime Proof: Model Identity at Frontier Scale (DOI: 10.5281/zenodo.19216634) Paper 12: Family-Dependent Response to Reasoning Distillation Across Structural and Functional Identity Layers (DOI: 10.5281/zenodo.19298857) Paper 13: Safety-Alignment Removal as a Model-Identity Failure — Structural Evidence from Published Weight-Level Mutation Checkpoints (DOI: 10.5281/zenodo.19383019) Technical Note: Agent Identity Is Not Model Identity (DOI: 10.5281/zenodo.19240883) Technical Note: Gap Invariance: Why PPP Measurements Are Domain-Independent by Construction (DOI: 10.5281/zenodo.19275524) Technical Note: Measured Model Substitution Under Valid Agent Credentials (DOI: 10.5281/zenodo.19342848) Technical Note: Artifact Identity Is Not Runtime Identity — Trustfall Lite and the Boundary of File-Level Model Verification (DOI: 10.5281/zenodo.20019127) Formal Verification Stack for Neural Network Structural Identity (IT-PUF Coq Proofs) (DOI: 10.5281/zenodo.18930621) Copyright (c) 2026 Anthony Ray Coslett / Fall Risk AI, LLC. All Rights Reserved. Confidential and Proprietary. Patent Pending (Applications 63/982,893, 63/990,487, 63/996,680, 64/003,244).
USE VERSION 23/24 Until I'm done updating. The Costello Constant (CC) Formula base (e/phi - 1/pi) and the Recursive Costello sequence it was extracted from that's governed by the Rule n(+1) = n + f(n), where f(n) is the Greatest Proper Divisor of n(-1); f(n1) = 1. Which locks into an OOE or OE cycle, When mapped onto the complex plan Y(ix) = (e/phi -1/pi)^(0±ix) and use x as a function of time to cretes a 3rd dimention frma a duel helix where intersection of the 2 spiraling lines cancel out from complete annihilation and return a value of zero when calculated, this helix is anchored to the origin by raising it to the power of zero, the even exponent of I is one helical arm, the negative value of I is the odd value helical arm. Points where they annihilate the x values are the zeta zeros value with a frequeny ~ 10.33715124… the slope of the sequence points on a semi logarithmic graph when they align perfectly straight… or the inverse of... when joining sequential odds treating the O O E cycles as only 2 values (plot points, both odds as one single unit, multiplied by the value of CC ~ 1.3616... gives the exact value zeta zero 1, in the sequence this is equivalent to the Attractor a10 (16) when looking at ratios between zero 1 and zero 2 as an x/y it matches exactly to (13+16+17/3)/(17/25/26) this number and it's simplest reduced form 268/183 also are the exact ratio of certain toma in chemicals. And te genes which map a certain protein. I assume other ratios between consecutive numbers and the sequence will reveal some wonders in the universe that have remained untold until this moment. I've been ignored for weeks now which has giving me the time to dive into a level of certainty beyond any shadow of a doubt. On the regular graph when treating odds consecutive as one and evens as one connecting all evens and connecting All Odds creates two distinct lines where are the formula of the Costello constant is right in the middle. Basically turning the Zeta zeros into an algebraic problem by connecting the dots odds and evens where intersects on the equation graphed is the location of the Zeta zeros. Mic drop. V6. Added details about the zero timing overlap with formula being dictated by timing of pair sequential numbers in the sequence being used. V7. Added Defining Costello Constant's Value, Definition, And Symbol. V8. Added Data Set Of Sequence Numbers As T Values V9. Eureka! Offset fixed! "^0 + it" is the golden key it's officially solved. The Costello spiral is the structure, The zeta zeros are mapping the features of it. V10. Added Needed Proof V11. Complete revamp fixing errors in construction. I'm a non-academic... I'm trying here... Alone... V12. Updated Formatting Pages 1 - 2 Finalized V13. Update Pages 1 - 3 Finalized, 4 - 7 Drafted V14. Finalized Doc 1 Current Version Is A Fully Closed Loop System Logic, It's Proof By Fundamental Law. Costello Spiral Diagrams Reflects Older .809... Helix Radius Matching Pre 1.0000 Radius Formula Reduction. "This Fundamental Law is scale-invariant; while earlier diagrams (0.809) and the finalized 1.0000 reduction represent different magnitudes, the underlying closed-loop logic and intersection intersections remain constant. The 1.0000 Unit Radius represents the simplest, normalized state of the Costello Spiral." One last note to whom it may concern... I did this completely independent starting from the ground up with no previous research into other publishments, I started with the desire to make a sequence that was novel, and just kept making connections one after another. I've watched a couple YouTubes in the past that had discussed vaguely The mystery of the Zeta zeros and that's about the extent of my outside knowledge. I didn't set out to discover the secret for it, my series ran into it by its nature itself. V15. Updated format to Latex, added much more vigorous math proof, order of logic still needs tweaking. V16. Added data point charts into Latex pdf. V17. Formatting Fixes V18. Added -1 somewhere... Oops V19. Added how the Costello Spiral solves the Collatz Conjecture too. V20. Added hypothesis of the twin Prime conjecture V21. Fixed Rooke Mistakes... Double Statements... Out of order stuffs.... V22. More Formatting Fixes. V23. Lots better, 25+ years sine education environment, first proof... Getting there... V24. Added formula for ratio relationship of factors to the zero spacing, but messes up my formatt big time... Lullz.. im fixing it. I hate all these loops I have to jump through honestly, taking away from time that I could just be diving further in the numbers as usual. I'm almost giving up a couple times I just went back to my paper notebooks. V25. Well maybe have about 10% of the information out now... Main problem is I don't know what's most important to show I don't know what the world knows or not... Like I don't know what to add next the list is too big... Semi-prime Costello sequence numbers that are close together align with Zeta zeros close together.. eg., 7171... So much work... I've tried showing my math and I get laughed at... I'mma just keep on pushing... It may not be conventional to add your thoughts or whatever... But I'm a break the fifth wall right now... From two weeks now I've tried reaching out... All skepticism.. it just hit me tonight... It's because it's all sounds too good to be true... I didn't know that... I'm trying to do too much at once... I mean on top of my work that I'm doing I had to learn the formal language... I've had to learn how to code... I've had to learn Python script so I can run my old numbers... And for 2 weeks now I've been pushing... To show people ONE of my creations. Maybe the world is just not ready.... .. .. . Maybe. It's hard to forget, everything I regret. So why do I neglect, the chances that I get, To make those things correct... When I've tried to reflect... I just lost more respect... How did i ever let my mindset behind set get so inept. While im On the subject if I may be direct. I digress... It is best to get the rest of my chest. Im blessed but made a mess whats more or less my nest. I feel i failed my quest, I have failed my own test. It's a sure bet soon I'll take my last breath. Back to work... V26. Gtting there... Please use V23 complete copy until i stop mesing up my work with copy pasts twice deleed everything. V Edition2 V27. New formatt next few additions should be coming back to back to back as I string the old with the new. Refer to V22/23 for older complete outline, V Edition2 V28. Brought over some data from my research pfd, order and simplification are needed. V Edition2 V29. Stitching in the dimensional transitions from the number line to a real plane to complex plane to the manifold. Still need smooth transitioning. V Ediion2 V30. Added a good chunk to complex/manifold section, I just want to get it uploaded, I still have to prune it and smooth it. And make sure the stuff at the end is stated the way it's supposed to before I can remove it. Editiom2 V31. Added 10.3 frequency of spiral is the slope of sequence on log xy. Deleted doubles. Edition2 V32 Added dada set at end, refining python code number generator to add next. Edition2 V33 Changed Description on Zenodo added some info to I - III, refer to Ver 23 in tandem as f now after reading to complete the info aquired. Lots more to come... Edition2 V33.2 Keep Pushing Unil The World Listens... Changed Sequence Formula Formatt of f(n) Fixed Order still have to move over more sections from research Pdf. Including making sure pdf reflects duel helix is intersecting as counter clockwise 1 string and clockwise the other, reforming old 180° opposition, to actual intersection. At 0° Edition2 V34. Updated High Precision Value Of Slope using 500 sequence Values, Added bar graph for delta 2 equalization, other minor adjustments. Edition2 V35. Fixing all formulas to compensate for the change of what f(a_n) is.. as befor the rule a_n+1 = a_n + f(a_n-1) when f(a_n) meant a_n's GPD.. but for clearity f(a_n) now means a_n-1's GDP... To remove a LAG extra thought... Royal pain but a necessity.... Almost done converting everything. Edition2 V36 Formalized Pages 1-2 of actual proof after index, added rigor and made it more succinct. Eution2 V37. Showed how 10.337... slight miss alignment snap perfectly to 10.333 and perfectly aligned to zz1 now that start up terms 1-9 are removed from calculations. Edition2 V38 Formed formulas using the costello constant for prime density and how many primes exist in any limit, gives exct answer at 1,000,000. Edition2 v39 Finalized pages 1-4 Edition3.1 Finalize Format Starting To Translate. Page 1 done, Page 2 in progress Edition3.2 Actual Professional Formatt Learned And Applied.Pae 1/2 almost good. Should be a quick transition building back a strong base from dra in previous versions. Edition3.3 Added .6 Parity Limit, Growth Factor & Graph. Edition3.4 Added Symmetry/2-adic Sections & Tables Edition3.5 added the singularit Edition3.6 Formatt ambiguities removed, added minor info, Organized Zenodo Ledger, Edition3.7 Unified formatt formatt & variables, added log/non lomgrph real graphs, n more. Edition3.8 Added Changed To Font/Formatt Added Graphs Other Minor Additions Edition3.9 Bulletproofed Logic up to Lambda parity Density 0.6, 2:3. Edition3.10 Defined Lambda and lambda, added parity density equations and table Edition3.11 Added High Precision Lambda Values, 2 Graphs (1 Custom Expanding Y Axis} Edition3.12 Learned Python... Wrote and added script for producing Verifiable Data, Include plain txt file and 2 Appendix to PDF with Program and sample data. Edition3.13 Streamlined f function by introduction of spa divisor set mapped to n. Defined Tau and some other minor stuffs. Edition3.14 Added plain txt documents of raw Latex Code And Python Sequence Engine Edition3.15 Added Infinit tetration of B = C,, LogB(C) =
Older versions more complete but.... Umm less complete. I'm hopefully putting the pieces back together for the final edition. The Costello Constant (CC) base (e/phi - 1/pi), and Costello sequence governed by n(+1) = n + f(n), f(n) is the Greatest Proper Divisor of n(-1); f(n1) = 1, mapped onto the complex plan Y(ix) = (e/phi -1/pi)^(0±ix) using x as a time function for an. added dimention, forms a single helix that bifurcrates into. duel helix where intersection of the 2 spiraling lines cancel out from complete annihilation at value of the first zero~(14) this helix is anchored to the origin by raising the base to the power of zero, The even exponent of i are one helical arm, the negative value of i is the odd value helical arm. Points where they annihilate the x values are the zeta zeros value with a frequeny ~ 10.33715124… the slope of the sequence on a semi logarithmic graph align perfectly straight… or the inverse of... when joining sequential odds treating the O O E cycles as only 2 values (plot points, both odds as one single unit, multiplied by the value of CC ~ 1.3616... gives the exact value zeta zero 1, in the sequence this is equivalent to the Attractor a10 (16) when looking at ratios between zero 1 and zero 2 as an x/y it matches exactly to (13+16+17/3)/(17/25/26) this number and it's simplest reduced form 268/183 also are the exact ratio of certain toma in chemicals. And te genes which map a certain protein. I assume other ratios between consecutive numbers and the sequence will reveal some wonders in the universe that have remained untold until this moment. I've been ignored for weeks now which has giving me the time to dive into a level of certainty beyond any shadow of a doubt. On the regular graph when treating odds consecutive as one and evens as one connecting all evens and connecting All Odds creates two distinct lines where are the formula of the Costello constant is right in the middle. Basically turning the Zeta zeros into an algebraic problem by connecting the dots odds and evens where intersects on the equation graphed is the location of the Zeta zeros. Mic drop. V6. Added details about the zero timing overlap with formula being dictated by timing of pair sequential numbers in the sequence being used. V7. Added Defining Costello Constant's Value, Definition, And Symbol. V8. Added Data Set Of Sequence Numbers As T Values V9. Eureka! Offset fixed! "^0 + it" is the golden key it's officially solved. The Costello spiral is the structure, The zeta zeros are mapping the features of it. V10. Added Needed Proof V11. Complete revamp fixing errors in construction. I'm a non-academic... I'm trying here... Alone... V12. Updated Formatting Pages 1 - 2 Finalized V13. Update Pages 1 - 3 Finalized, 4 - 7 Drafted V14. Finalized Doc 1 Current Version Is A Fully Closed Loop System Logic, It's Proof By Fundamental Law. Costello Spiral Diagrams Reflects Older .809... Helix Radius Matching Pre 1.0000 Radius Formula Reduction. "This Fundamental Law is scale-invariant; while earlier diagrams (0.809) and the finalized 1.0000 reduction represent different magnitudes, the underlying closed-loop logic and intersection intersections remain constant. The 1.0000 Unit Radius represents the simplest, normalized state of the Costello Spiral." One last note to whom it may concern... I did this completely independent starting from the ground up with no previous research into other publishments, I started with the desire to make a sequence that was novel, and just kept making connections one after another. I've watched a couple YouTubes in the past that had discussed vaguely The mystery of the Zeta zeros and that's about the extent of my outside knowledge. I didn't set out to discover the secret for it, my series ran into it by its nature itself. V15. Updated format to Latex, added much more vigorous math proof, order of logic still needs tweaking. V16. Added data point charts into Latex pdf. V17. Formatting Fixes V18. Added -1 somewhere... Oops V19. Added how the Costello Spiral solves the Collatz Conjecture too. V20. Added hypothesis of the twin Prime conjecture V21. Fixed Rooke Mistakes... Double Statements... Out of order stuffs.... V22. More Formatting Fixes. V23. Lots better, 25+ years sine education environment, first proof... Getting there... V24. Added formula for ratio relationship of factors to the zero spacing, but messes up my formatt big time... Lullz.. im fixing it. I hate all these loops I have to jump through honestly, taking away from time that I could just be diving further in the numbers as usual. I'm almost giving up a couple times I just went back to my paper notebooks. V25. Well maybe have about 10% of the information out now... Main problem is I don't know what's most important to show I don't know what the world knows or not... Like I don't know what to add next the list is too big... Semi-prime Costello sequence numbers that are close together align with Zeta zeros close together.. eg., 7171... So much work... I've tried showing my math and I get laughed at... I'mma just keep on pushing... It may not be conventional to add your thoughts or whatever... But I'm a break the fifth wall right now... From two weeks now I've tried reaching out... All skepticism.. it just hit me tonight... It's because it's all sounds too good to be true... I didn't know that... I'm trying to do too much at once... I mean on top of my work that I'm doing I had to learn the formal language... I've had to learn how to code... I've had to learn Python script so I can run my old numbers... And for 2 weeks now I've been pushing... To show people ONE of my creations. Maybe the world is just not ready.... .. .. . Maybe. It's hard to forget, everything I regret. So why do I neglect, the chances that I get, To make those things correct... When I've tried to reflect... I just lost more respect... How did i ever let my mindset behind set get so inept. While im On the subject if I may be direct. I digress... It is best to get the rest of my chest. Im blessed but made a mess whats more or less my nest. I feel i failed my quest, I have failed my own test. It's a sure bet soon I'll take my last breath. Back to work... V26. Gtting there... Please use V23 complete copy until i stop mesing up my work with copy pasts twice deleed everything. V Edition2 V27. New formatt next few additions should be coming back to back to back as I string the old with the new. Refer to V22/23 for older complete outline, V Edition2 V28. Brought over some data from my research pfd, order and simplification are needed. V Edition2 V29. Stitching in the dimensional transitions from the number line to a real plane to complex plane to the manifold. Still need smooth transitioning. V Ediion2 V30. Added a good chunk to complex/manifold section, I just want to get it uploaded, I still have to prune it and smooth it. And make sure the stuff at the end is stated the way it's supposed to before I can remove it. Editiom2 V31. Added 10.3 frequency of spiral is the slope of sequence on log xy. Deleted doubles. Edition2 V32 Added dada set at end, refining python code number generator to add next. Edition2 V33 Changed Description on Zenodo added some info to I - III, refer to Ver 23 in tandem as f now after reading to complete the info aquired. Lots more to come... Edition2 V33.2 Keep Pushing Unil The World Listens... Changed Sequence Formula Formatt of f(n) Fixed Order still have to move over more sections from research Pdf. Including making sure pdf reflects duel helix is intersecting as counter clockwise 1 string and clockwise the other, reforming old 180° opposition, to actual intersection. At 0° Edition2 V34. Updated High Precision Value Of Slope using 500 sequence Values, Added bar graph for delta 2 equalization, other minor adjustments. Edition2 V35. Fixing all formulas to compensate for the change of what f(a_n) is.. as befor the rule a_n+1 = a_n + f(a_n-1) when f(a_n) meant a_n's GPD.. but for clearity f(a_n) now means a_n-1's GDP... To remove a LAG extra thought... Royal pain but a necessity.... Almost done converting everything. Edition2 V36 Formalized Pages 1-2 of actual proof after index, added rigor and made it more succinct. Eution2 V37. Showed how 10.337... slight miss alignment snap perfectly to 10.333 and perfectly aligned to zz1 now that start up terms 1-9 are removed from calculations. Edition2 V38 Formed formulas using the costello constant for prime density and how many primes exist in any limit, gives exct answer at 1,000,000. Edition2 v39 Finalized pages 1-4 Edition3.1 Finalize Format Starting To Translate. Page 1 done, Page 2 in progress Edition3.2 Actual Professional Formatt Learned And Applied.Pae 1/2 almost good. Should be a quick transition building back a strong base from dra in previous versions. Edition3.3 Added .6 Parity Limit, Growth Factor & Graph. Edition3.4 Added Symmetry/2-adic Sections & Tables Edition3.5 added the singularit Edition3.6 Formatt ambiguities removed, added minor info, Organized Zenodo Ledger, Edition3.7 Unified formatt formatt & variables, added log/non lomgrph real graphs, n more. Edition3.8 Added Changed To Font/Formatt Added Graphs Other Minor Additions Edition3.9 Bulletproofed Logic up to Lambda parity Density 0.6, 2:3. Edition3.10 Defined Lambda and lambda, added parity density equations and table Edition3.11 Added High Precision Lambda Values, 2 Graphs (1 Custom Expanding Y Axis} Edition3.12 Learned Python... Wrote and added script for producing Verifiable Data, Include plain txt file and 2 Appendix to PDF with Program and sample data. Edition3.13 Streamlined f function by introduction of spa divisor set mapped to n. Defined Tau and some other minor stuffs. Edition3.14 Added plain txt documents of raw Latex Code And Python Sequence Engine Edition3.15 Added Infinit tetration of B = C,, LogB(C) = C, LogC^(1/C)=B,
In Germany, real estate is commonly referred to as ‘Betongold‘ (English: ‘concrete gold’). This term reflects the fact that real estate is seen as a store of value and inflation hedge, similar to the commodity gold. These attributes have led to the transformation of real estate from a utility object into a capital investment and, in some cases, into a speculative asset. As a consequence of this transformation, macroeconomic developments on the capital market have significant impact on the real estate market (e. g. the past phase of low interest rates led to a historic real estate boom in Germany). The recent rise in interest rates is changing the preferences of private and institutional investors with regard to investment opportunities. In this context, the asset class real estate is competing with other asset classes. In this paper the value storage capacity of real estate and its transformation into a financial asset is explored. In particular, the effects of monetary policy on the real estate markets and valuation of real estate are considered. Furthermore, real estate is compared with the asset classes gold and bitcoin, which are mainly used for their capability to store value and preserve purchasing power in inflationary monetary systems. The aim is to assess the suitability of these asset classes as a store of value and inflation protection based on characteristics such as durability, preciousness, ease of storage, stability of value, rarity/scarcity and liquidity. The specific characteristics (and advantages and disadvantages) of the individual asset classes are analysed and compared.
Abstract: The global payments landscape is undergoing a structural transformation driven by the convergence of Digital Finance (DF) technologies and Artificial Intelligence (AI). This integration marks a shift from isolated digital payment systems toward interconnected, intelligent, and highly automated financial infrastructures. AI functions as the core intelligence layer across digital rails - including Distributed Ledger Technology (DLT), Central Bank Digital Currencies (CBDCs), stable coins, and mobile networks - optimizing payment routing, enabling real - time fraud detection, and automating compliance obligations such as AML / KYC. The result is enhanced straight-through processing rates exceeding 99%, reduced cross - border transaction frictions, improved liquidity management, and democratized access to enterprise - grade payment capabilities through API - enabled FinTech platforms. However, rapid adoption introduces new systemic challenges, including algorithmic bias, data privacy vulnerabilities, explains ability concerns, and heightened third - party concentration risks. Emerging regulatory frameworks increasingly emphasize transparency, governance, and explainable AI (XAI), as evidenced in supervisory innovations such as the BIS Project Noor. While digital - AI convergence improves efficiency and fosters financial inclusion, uneven technological capacity risks widening the digital divide without deliberate inclusive design and shared digital infrastructure. This study synthesizes global trends, technological architectures, governance models, and strategic imperatives underpinning AI - enabled payment ecosystems. It highlights a future defined by programmable finance, real - time cross - border rails, intelligent automation, and collaborative regulatory innovation - establishing the foundations for secure, ethical, and scalable digital financial systems worldwide. Keywords: Digital Finance, Artificial Intelligence, Global Payment Systems, Block Chain, Distributed Ledger Technology, Cross - Border Payments, CBDCs, AI Governance, Explainable AI (XAI), Regtech, Straight - Through Processing, Financial Inclusion, Programmable Money, Fintech Infrastructure
Wireless medical sensor networks (WMSNs) enable continuous patient monitoring by transmitting sensitive physiological data over open wireless links. Given the resource-constrained nature and large-scale deployment of such networks, authentication mechanisms must be both lightweight and privacy-preserving. Moreover, due to the frequent turnover of patients and devices in hospital environments, timely member revocation is crucial to prevent discharged or compromised entities from injecting forged reports that could mislead medical diagnosis. Although existing pairing-free certificateless aggregate authentication schemes are efficient, they often suffer from critical security and privacy vulnerabilities. Recently, an efficient certificateless authentication scheme with revocation has been proposed. However, our analysis reveals that the scheme presents the following security vulnerabilities: (i) member witnesses can be recovered from public information, (ii) revocation checks can be bypassed via identity grafting attack, and (iii) user identities can be linked due to the long-term use of static pseudonyms. To address these issues, we propose a security-enhanced certificateless aggregate authentication protocol with revocation for WMSNs. Our design enforces strong identity-membership binding to resist grafting attacks, employs a non-interactive zero-knowledge membership proof to preserve witness secrecy, and adopts dynamic pseudonym rotation to achieve unlinkability. We provide formal security proofs and comprehensive performance comparisons. The results indicate that, at the same security level, our protocol achieves more efficient signature verification while maintaining communication overhead comparable to existing schemes. In addition, the overhead introduced by our revocation mechanism remains constant, making it well suited for large-scale WMSNs deployments with frequent membership changes.
Federated Learning (FL) is an approach that allows numerous users to train a single machine learning model with the oversight of a central server, and with their training data stored locally on their devices. The approach is relevant in alleviating the risks associated with violations in data privacy. It is a process by which a pool of clients collaborates towards solving machine learning problems, with a central coordinator being the one who coordinates the entire process. The paper will review the latest advances in privacy-preserving federated learning and discuss it in the context of machine learning. It assesses privacy-related solutions, which are already in existence, such as secure aggregation, meta-learning, blockchain technology, decentralized training, searchable encryption, and data privacy mechanisms and zero-knowledge proofs. Federated learning (FL) is an emerging technology that can be used in the realm of the intelligence of the Internet of Things. However, the information that is model-related can be shared in FL and reveal the sensitive data of the participants. In this regard, we propose a new privacy-preserving FL framework, which is founded on a new chained secure multiparty computing technique, which we call chain-PPFL. The scheme we are proposing is based mostly on two mechanisms: 1) a single-masking mechanism, which protects the information that is exchanged between participants in a serial chain frame and 2) a chained-communication mechanism, which allows the masked information to be communicated between participants in a serial chain frame. We run large-scale experiments with respect to simulation by comparing the training accuracy and the leak defence to other state-of-the-art schemes with two publicly available data sets (MNIST and CIFAR-100). We established data sample distributions (IID and NonIID), and training models (CNN, MLP and L-BFGS) in our experiments. The experiment results show that the chain-PPFL scheme can offer a realistic privacy preservation (which is the same as the various privacy with ϵ to near zero) to FL at the cost of communication, and without compromising the accuracy and convergence rate of the training model.
Authorization tokens in distributed systems are typically context-free: a cryptographically valid token carries no binding to the specific transaction for which it was issued. This enables reuse and cross-context presentation attacks that are undetectable at the cryptographic layer. In regulated financial infrastructure, cross-border payments, and autonomous agent systems, transaction-scoped enforcement is a hard requirement that existing standards leave unaddressed. We introduce the first formal security model for policy-bound transaction tokens. We define the syntax of a policy-bound transaction token scheme over a formal transaction context space and introduce three game-based security notions: transaction binding (TB), which simultaneously resists forgery and cross-context reuse; existential unforgeability under chosen-context attack (EUF-CCA); and unlinkability (UNL). We prove that TB strictly implies EUF-CCA, establish a formal separation between TB and UNL, and identify the inherent tension between unlinkability and auditability. We construct a scheme parameterized by any EUF-CMA-secure signature scheme and a random oracle, and prove that it achieves transaction binding security with a tight reduction requiring no rewinding. We then address the complementary privacy problem by formalizing zero-knowledge compliance privacy (ZK-CP) and constructing an enhanced scheme that augments transaction-binding tokens with a non-interactive zero-knowledge proof of policy compliance. We prove that the enhanced scheme simultaneously achieves TB security and ZK-CP, and show how it integrates with decentralized identity (DID) systems to enable fully privacy-preserving authorization where the verifier learns only whether compliance is satisfied. We give a concrete instantiation using Ed25519 and SHA-512, derive bit-security parameters, analyze performance costs, and discuss deployment considerations including regulatory alignment with PSD2, MiCA, DORA, the GENIUS Act, SEC token taxonomy, and FinCEN BSA requirements.
The article presents an analysis of concurrent execution issues and delivered performance in large-scale distributed applications deployed in cloud-native environments. The relevance of this direction is driven by the accelerated diffusion of the microservice paradigm and container-orchestration practices, within which classical synchronization and coordination approaches often become the dominant factor behind throughput degradation and latency growth. The text identifies baseline patterns of state management and state processing and then examines–at a detailed level–the causes and enabling conditions of data races in asynchronous execution loops. A separate emphasis is placed on the specificity of Kubernetes operators and on the requirement of idempotent reconciliation cycles as a key prerequisite for predictable system behavior under repeated triggers, partial failures, and mismatches between the observed and desired state. The research goal is formulated as the development of recommendations aimed at reducing latency and increasing reliability under concurrent access to shared resources and shared entities. To achieve this goal, methods of systems analysis are applied, architectural-pattern modeling is performed, and retrospective reflection on recurring failure patterns observed in production systems. The theoretical foundation relies on works devoted to distributed ledgers, while the applied part is supported by operational guidelines and engineering practices for running NoSQL solutions. The outcome is a description of the distinctive properties of a model for handling concurrent requests, designed to improve the resilience and controllability of distributed-component behavior. The findings presented in this work are expected to be of practical interest to system architects, DevOps engineers, and researchers working in the field of distributed computing.