The purpose of this paper is to identify the industry-specific and geographic patterns that shape the adoption of Web 3.0 technologies among Fortune Global 500 companies. The study addresses a gap in the existing literature by shifting attention from isolated technological applications such as blockchain, decentralized finance, artificial intelligence, and immersive environments toward a broader comparative analysis of how large multinational corporations adopt Web 3.0 across sectors and countries. Methodology. The paper is based on an empirical classification of Fortune Global 500 companies for 2024 into adopters and non-adopters of Web 3.0 technologies. The dataset includes 500 firms and covers sector affiliation, country of origin, employee counts, selected financial indicators, company characteristics, and a binary indicator of adoption status. The analysis applies descriptive statistics, comparative analysis, and cross-tabulations using publicly available data from annual reports, strategic plans, press releases, marketing materials, news coverage, and business databases. Results. The findings show that Web 3.0 adoption is significant but uneven: 216 companies are identified as adopters, while 284 are classified as non-adopters, indicating that Web 3.0 remains in a transitional stage of corporate diffusion. Adoption is concentrated in digitally intensive sectors such as Information Technology Services, Computer Software, Entertainment, Apparel, and selected Health Care activities, whereas sectors such as Transportation and Logistics, Real Estate, Homebuilders, and Medical Products and Equipment demonstrate limited or no adoption in the dataset. Geographic differences are also substantial, with adoption present in 25 out of 35 countries represented in the sample, although the intensity of adoption varies across national contexts. The results confirm that Web 3.0 diffusion is shaped by the interaction of sectoral structure, strategic fit, and geographic environment rather than by a uniform technological trajectory. Practical implications. The paper suggests that managers should approach Web 3.0 as a strategic option whose relevance depends on alignment with the firm’s business model, customer value proposition, governance needs, and innovation capabilities. Value/originality. The originality of the study lies in its cross-sectoral and cross-national perspective on Web 3.0 adoption among the world’s largest corporations, offering a more nuanced understanding of digital transformation in the Web 3.0 era and demonstrating that adoption is patterned, selective, and contingent rather than universal.
The article examines digital financial assets as an instrument of investment portfolio diversification in the Ukrainian investment context. The study argues that Bitcoin and Ethereum should not be assessed through general statements about financial innovation, but through their measurable contribution to portfolio return, volatility and risk-adjusted performance. The empirical part is based on an annual scenario model for 2020–2025 and compares portfolios with 0%, 1%, 3%, 5% and 10% exposure to BTC and ETH. The benchmark portfolio includes domestic government bonds, the USD/UAH currency component, gold and the S&P 500 as a global equity benchmark, while the local Ukrainian equity segment is interpreted cautiously because of its limited liquidity. The results show that portfolios with 1–5% exposure to BTC and ETH improved risk-adjusted efficiency compared with the baseline portfolio. The P3 scenario provided the most balanced relationship between return growth and risk growth, while P5 generated a higher average annual return with still acceptable volatility. The P10 scenario produced the highest geometric average annual return but almost tripled volatility compared with the baseline portfolio, making it more suitable for an aggressive investor profile. The article concludes that digital financial assets may have practical value only as a limited high-risk addition to a diversified portfolio, not as a stable hedging instrument or a substitute for traditional instruments.
Secure voting remains a critical challenge in modern democracies due to concerns over transparency, tampering, and voter trust. This paper proposes a blockchain-based voting system designed to enhance the integrity, security, and reliability of electoral processes. By leveraging the decentralized and immutable nature of blockchain technology, the system ensures that each vote is securely recorded and cannot be altered once submitted. Smart contracts are utilized to automate vote validation and counting, eliminating intermediaries and reducing the risk of human error or manipulation. Cryptographic techniques preserve voter anonymity while ensuring authentication, thereby maintaining both privacy and legitimacy. The distributed ledger allows real-time verification and auditing, increasing transparency and public confidence in election outcomes. Performance analysis indicates that the system is scalable and resistant to common cyber threats such as double voting and unauthorized access.
Abstract This note specifies a data suitability gate — a lightweight boundary criterion positioned between the output of probabilistic language models and the input of deterministic symbolic reasoning systems. The gate answers a single structural question before any inference is attempted: is this data suitable for the intended task, and if so, to what degree? The criterion is negative-first: it does not assert fit; it structurally excludes non-fit. Positive admission is graded, not proven. Note that: In terms of this paper domain (if it recognized as scope definitions, terms and explanations) is equivalent corpora, becasuse domain always grounds on corpora/norm sources 1. The Core Principle A deterministic reasoning system — one that operates over a structured index of knowledge and produces verifiable conclusions — cannot admit arbitrary input. Input that is structurally degenerate (rank-deficient, informationally empty) or structurally foreign (inconsistent with the domain's reference form) will produce wrong answers without signalling that anything is wrong. The gate prevents silent failure at the boundary. The gate operates by comparing the covariance structure of the candidate data against an external reference form derived from the target domain or query class. The comparison yields a single scalar ratio. Both tails of this ratio are refusal signals — for opposite reasons: Condition Structural meaning Ratio collapses to zero Rank-deficient data — no independent structure, informationally empty Ratio blows up Data structure foreign to the reference — not from this domain Ratio within bounded corridor Admissible; degree of fit is the value of the ratio The admissible region is a bounded corridor. Both walls are set by the reference form, not by free parameters. The gate excises both tails and keeps what could not be structurally excluded. 2. Two Questions, One Measure The same criterion answers two distinct questions about the same data, depending on what the reference form is set to: Fitness for domain/corpora synthesis. Does this data structurally belong to the domain being built? If admitted, it may extend the domain's knowledge base — adding new facts, definitions, or constraints. The reference is the existing domain structure. Fitness for answering a query. Does this data — or this query — structurally land on the assembled domain? The reference is the query class combined with the information structure of the domain as currently assembled. The two questions are two instances of the same test. The gate runs both; their combined result determines whether the data is admitted, and at which layer of the domain it should be integrated. 3. Two Levels on One Basis A knowledge domain is not a separate structure above the data. It is a layer of constraints — definitions and enforcements — applied on top of the same underlying index of Subject–Predicate–Object triples. The gate therefore operates on one basis at two levels: Raw index level — what the domain can structurally distinguish in principle. Constrained level — what the domain distinguishes under its current set of applied rules. Both levels yield a covariance form over the same index, so they are directly comparable. The gap between the two ratios localises the deficiency: Data passes at the raw level but fails at the constrained level → the index contains the relevant facts, but the domain's rules do not yet cover this case. The constraint layer needs to be extended, not the underlying data. Data fails already at the raw level → the facts are absent from the index itself. No rule extension will help; the domain simply does not cover this topic. This two-level diagnostic replaces a binary pass/fail with a precise instruction: what to fix, and at which layer. 4. The Honesty of the Criterion The gate makes an asymmetric claim — one that is worth stating explicitly: The system is exact in what it rejects, and calibrated — not certain — in what it admits. A ratio collapse or explosion is a structural proof of non-belonging. Refusal is deterministic. Admission, by contrast, is not a proof of fit — it is a measured failure to exclude. The degree of fit (the ratio value within the corridor) is a confidence weight on the admitted data, not a certification. This asymmetry is the boundary that separates a deterministic reasoning system from a probabilistic one: refusal is a fact; admission is a graded hypothesis. 5. Positioning in the Architecture The gate sits at the ingress boundary of the deterministic layer — after language model output is produced, before it enters the structured reasoning graph. It is a pure linear-algebraic check: rank and volume of the candidate covariance against the reference form. It does not re-run inference; it does not require the reasoning engine to process degenerate input speculatively. The gate is the structural counterpart — on the ingress side — of the constrained-decoding mechanisms (grammar masks, schema validators) that vendors attach to language model outputs on the egress side. Both are instances of the same pattern: when formal guarantees are required, linear algebra and formal structure are applied at the boundary; the probabilistic model is not trusted to self-regulate.
Penelitian ini bertujuan untuk menganalisis dan meramalkan kinerja harga Bitcoin menggunakan pendekatan TimeGPT , sebuah model berbasis transformer yang dikembangkan khusus untuk data deret waktu oleh Nixtla. Dengan pendekatan kuantitatif, studi ini memanfaatkan data historis harga Bitcoin untuk mengidentifikasi pola dan tren melalui kemampuan pemodelan AI modern. TimeGPT , sebagai model pre-trained, memungkinkan analisis tanpa pelatihan tambahan (zero-shot learning) dan memberikan efisiensi dalam peramalan jangka pendek maupun menengah. Metode penelitian mencakup tahap pra-pemrosesan data, pemanfaatan API TimeGPT untuk menghasilkan prediksi, serta evaluasi hasil dengan metrik statistik seperti MAE dan RMSE. Hasil menunjukkan bahwa TimeGPT mampu menangkap volatilitas pasar Bitcoin secara akurat, dengan tingkat kepercayaan prediksi yang tinggi pada periode stabil seperti 2024–2025. Namun, pada proyeksi jangka panjang, model menunjukkan peningkatan ketidakpastian, mencerminkan sensitivitas terhadap variabel eksternal seperti regulasi dan sentimen pasar. Studi ini menyimpulkan bahwa TimeGPT merupakan alat yang unggul dibandingkan metode konvensional (ARIMA, GARCH, LSTM) dalam menangani kompleksitas data kripto, dan dapat digunakan sebagai pendukung pengambilan keputusan investasi, terutama jika dikombinasikan dengan analisis fundamental dan pemantauan pasar secara real-time.
Sovereign AI-Native Multi-Asset Trading, Execution, and Financial nfrastructure Charter Sovereign AI‑Native Financial Execution Infrastructure PARRALAX‑AIHFTFUND is a multi‑asset, AI‑native financial organism engineered to operate across traditional and blockchain‑based markets. It provides a unified execution layer where autonomous agents can observe markets, interpret structure, execute trades, manage risk, govern portfolios, issue digital assets, coordinate token economies, and maintain verifiable proof‑of‑computation. This repository contains the core infrastructure, protocol stack, and governance architecture for building sovereign, agent‑driven financial systems. Mission To build a sovereign AI‑native financial infrastructure capable of coordinating autonomous trading agents, multi‑asset execution, fund governance, risk control, digital‑asset creation, and market intelligence across both traditional and blockchain‑native markets. The system exists to move beyond bots, dashboards, and scripts. Its purpose is to become a real execution organism for financial markets. Vision PARRALAX‑AIHFTFUND aims to create a long‑horizon financial intelligence layer where AI agents can: Observe and interpret global market structure Execute trades across heterogeneous venues Manage risk and exposure Govern portfolios and internal policy Issue and manage digital assets Coordinate internal token economies Maintain proof‑of‑computation and decision lineage Operate across crypto, fiat, equities, FX, derivatives, AI tokens, NFTs, and future asset classes Build market memory over time The system is designed to evolve as markets evolve. Foundational Premise Modern markets are: Machine‑driven Fragmented Multi‑asset Tokenized Agent‑mediated A serious financial infrastructure must therefore operate across: Traditional finance (equities, FX, derivatives, funds) Decentralized finance (DEXs, AMMs, on‑chain liquidity) Tokenized and synthetic assets AI‑native markets Autonomous agent economies High‑speed execution environments Governance‑controlled fund structures Programmable financial instruments PARRALAX‑AIHFTFUND is built to bridge old‑world and new‑world markets. What PARRALAX‑AIHFTFUND Is A sovereign trading infrastructure framework An AI‑native market execution system A multi‑asset financial operating layer A protocol stack for autonomous trading agents A fund governance and charter framework A digital‑asset issuance and management environment A blockchain‑compatible coordination layer A risk‑aware execution engine A compute‑receipt and proof‑trace system A foundation for future AI‑managed financial organisms It is built for real execution, not passive analysis. What PARRALAX‑AIHFTFUND Is Not Not a research repo Not a toy trading bot Not a simulation Not a dashboard Not a signal script collection Not a crypto hype project Not a single‑asset system Not a prediction‑only model Research supports the system. Research does not define the system. Status Active development. Core modules stabilizing. Execution layer expanding. Governance and digital‑asset subsystems in progress. PARRALAX‑AIHFTFUND is an AI‑native financial execution framework designed to coordinate autonomous agents across traditional and blockchain‑based markets. The system provides a unified operating layer for multi‑asset execution, risk management, fund governance, digital‑asset issuance, and verifiable compute‑traceability. System Mission To construct a sovereign financial intelligence layer capable of continuous operation across heterogeneous markets, enabling agents to observe market conditions, interpret structure, execute trades, manage exposure, and maintain internal governance. Operational Scope The system is engineered to function across: Traditional finance (equities, FX, derivatives, funds) Decentralized finance (DEXs, AMMs, on‑chain liquidity) Tokenized and synthetic assets AI‑native markets and agent economies Governance‑controlled fund structures High‑speed execution environments Programmable financial instruments System Definition PARRALAX‑AIHFTFUND comprises: A sovereign trading and execution infrastructure A multi‑asset financial operating layer A protocol stack for autonomous trading agents A governance and charter framework A digital‑asset issuance and management environment A blockchain‑compatible coordination layer A risk‑aware execution engine with compute receipts Non‑Scope The system is not a research‑only repository, simulation toy, dashboard, signal script collection, or prediction‑only model. It is infrastructure‑first and execution‑oriented.
Abstract We study the three-dimensional (3D) magnetohydrodynamics (MHD) equations in an annular cylinder, perturbed around the explicit steady state given by the 3D Taylor–Couette velocity field and zero magnetic field. Combining a recent linear instability result for the magnetic field with the framework of Friedlander et al (2006 Commun. Math. Phys. 264 335–47), we prove nonlinear instability of the solution around this steady state in L p , for any p > 1. In particular, our results are, to the best of our knowledge, the first rigorous instability results for 3D MHD without forcing, in which the instability is produced as a result of the (exponential) growth of the magnetic field. Furthermore, we offer a mathematical proof of the physically conjectured transfer of energy from the velocity field to the magnetic field in the MHD system.
Currently, climate change has become one of the most pressing issues facing the world. It affects everyone on this planet and could have serious long-term consequences for humanity if left unresolved. Carbon credit trading is one of the measures contributing to emission management. With technological development, carbon credit trading can be conducted via smart contracts. The strengths of blockchain technology, such as transparency, secure record-keeping, and decentralization, are advantages for carbon credits. However, there are still issues that need to be addressed. This article researches smart contracts as a legal tool in carbon credit trading and identifies areas for improvement.
The results of this research are based on Law Number: 1 of 2022 concerning Financial Relations between the Central Government and Regional Governments regulating the new design of transfer funds to regions, regional income and expenditure. Likewise, it regulates how to monitor and provide evaluation of regional spending so that any existing budget can be used effectively and efficiently. The Ministry of Finance continues to strive to solve and eliminate gaps in the misuse of transfer funds to regions and village funds while seeking harmony between central and regional fiscal policies. This research aims to evaluate the level of transparency and accountability of transfers to regional and village funds through cash account management and assess the quality of government cash management and also evaluate government account management in increasing government revenue. This research uses a qualitative descriptive method by utilizing secondary primary data originating from various literature. From 2022 to 2023, it is even estimated that by the end of 2024, transfer funds deposited in regional government accounts throughout Indonesia at regional banks will average more than IDR 100 trillion. Deposition of funds will disrupt development and public service activities. In fact, it is hoped that government spending will be realized, which is the main stimulus for regional economic movements. By joining regional governments in the Treasury Single Account (TSA), all aspects of financial resource mobilization and expenditure can be managed as a whole by the government for the benefit of the people. Apart from strengthening and responding to the challenges of limited government financial resources. Existing idle cash can generate income. The participation of the Regional Government in implementing the Treasury Single Account (TSA) does not reduce the autonomy that has been mandated.
Fabio Capra-Ribeiro, Jéssica Peres, Filippo Vegezzi, Daniel Belandria
Implementation remains a central challenge in urban policy, yet the knowledge formats designed to bridge the gap between policy goals and on-the-ground delivery remain under-examined. This study treats 250 UN-Habitat Best Practice reports not as proof of effectiveness but as a standardized genre through which local interventions are narrated, compressed, and made portable for replication. We extract three focal sections, namely Results, Lessons Learned, and Transferability, apply systematic thematic coding with 906 open codes consolidated into axial categories, and compute co-occurrence networks using Jaccard similarity and Lift to detect thematic bundles, holes, and silos within and across sections. Three findings emerge. First, the reporting repertoire narrows progressively, as mean thematic richness declines by 28.2% from Results to Transfers while concentration increases 4.2 times, with substantive dimensions such as governance, equity, sustainability, and evidence losing prevalence to circulation-oriented themes. Second, formal bundle detection yields zero qualifying pairs across all six matrices, indicating a loosely coupled reporting grammar anchored by generic silos rather than integrated implementation packages. Third, structural holes concentrate at the pipeline’s end, where infrastructure transfer and sustainability as transferable value are the most systematically disconnected themes. These patterns reveal a portability paradox in which the reporting format achieves institutional legibility, making practices comparable within a shared vocabulary, but progressively filters out the physical, evidentiary, and context-sensitive content that operational reproduction would require.
Ms. Anushka Prasad Joshi, Prof. Sachin Bhosale, Dr. Shubhangi Gunjal, Dr. Anand Khatri
Abstract: With real estate markets digitalizing at a remarkable pace, there's a growing — and largely unmet — need for machine learning systems that can harness multi-institutional data without putting privacy or regulatory standing at risk. In this paper, we present a Privacy-Preserving Federated Learning (PP-FL) framework built specifically for digital real estate ecosystems. Our approach lets distributed stakeholders — property agencies, government land registries, financial institutions, and PropTech platforms — collaboratively train predictive models without ever pooling their raw transaction or personal records in one place. We've designed the system around three interlocking privacy layers: a DP-SGD-based differential privacy optimizer, a homomorphic encryption scheme for gradient transmission, and a secure multi-party computation protocol to safeguard intermediate model states. On top of that, a blockchain-backed audit mechanism using zero-knowledge proofs provides verifiable, regulator-friendly compliance. When we tested the framework on a simulated dataset of 2.4 million real estate transactions spanning multiple institutional clients, it achieved 91.8% prediction accuracy — just 2.4 percentage points behind a fully centralized model — while holding the differential privacy budget to ε = 0.5, cutting communication overhead by 65% relative to naive federated approaches, and satisfying both GDPR and RERA requirements. We believe these results make a strong case that high-utility, privacy-first collaborative learning is not just theoretically possible but practically deployable in today's real estate sector. Keywords: Federated Learning, Differential Privacy, Homomorphic Encryption, Real Estate Analytics, Secure Multi-Party Computation, Blockchain, GDPR Compliance, Data Sovereignty, PropTech, Zero-Knowledge Proofs.
Core Axiom System, Mathematical Proof and Universal Demonstration of UVMM 中文受人工智能自身能力局限,其易产生信息幻觉,且不擅长高精度数值运算。本文档内所有内容应严谨审核。EnglishDue to the inherent limitations of artificial intelligence, it is prone to generating hallucinations and performs poorly in high-precision numerical calculations. All contents in this document should be strictly reviewed. Feed the UVMM 3.6 version white paper into AI, and you can unlock the underlying laws of the universe, covering everything from microscopic particles to the vast cosmic stars and galaxies. UVMM3.6+版白皮书投喂AI,即可实现解锁宇宙,从微观粒子到浩瀚星辰。 V3.6 版本声明:本版本基于V3.5,V3.3和V3.2,把第一公理真空介质改为本体预设,唯一公理是全域角动量守恒。对暗物质概念分离,负宇宙,正宇宙与宇宙基底。增补宇宙的开始结束推演后记,补充数学证明和粒子质量映射,第一性原理的数学闭合证明,数学计算框架。 Version Statement: This version is updated based on Version 3.3 and 3.2. The former first axiom concerning the vacuum medium is revised to an ontological presupposition, while the only fundamental axiom is set as the conservation of global angular momentum. This release also completes the conceptual reclassification of dark matter, and clearly distinguishes the definitions of the positive universe, the negative universe and the cosmic base. Supplement on the Deduction of Cosmic Origin and Final Evolution for Postage. Supplement Mathematical Proofs and Particle Mass Mapping. Mathematical closed-form proof and computational framework based on first principles v4.0+,https://doi.org/10.5281/zenodo.20798927 updated v3.7(including the .md file for feeding AI tool ) Version 3.7.3 corrects the error in the gravitational wave formula and value in prediction table etc.Overall Closure Status:Core Theory DoC=100% (Full Theoretical Closure), V3.7.4 (a full conclusion of V3.7.3,and recover gravitational wave value keep 9.7~ )(continue:https://doi.org/10.5281/zenodo.20738759) V3.7.5 (a full conclusion of V3.7.3,and distinguish Universe 0,+,- by phase) Based on the sign and magnitude of the background phase , the entire cosmos is divided into three mutually orthogonal sectors. Background phase is the primary classification criterion; topological winding number serves only as auxiliary topological characteristics. • Universe 0 (Zero Universe): Background phase (constant ground-state phase), with auxiliary winding number . This sector is completely electromagnetically decoupled with vanishing angular momentum density. It acts as the fundamental vacuum substrate and contributes diffuse dark matter. • Universe + (Positive Universe): Background phase . Its topological excitations carry positive winding numbers . This sector hosts conventional gauge fields and fermions, and electromagnetic interactions are observable. • Universe – (Negative Universe): Background phase satisfies phase conjugation . Its excitations carry negative winding numbers . Gauge fields here are strictly orthogonal to those in Universe +, leading to electromagnetic invisibility. Its matter manifests as particle dark matter via gravitational projection onto Universe +. This classification is a direct consequence of the phase-conjugation symmetry derived from Möbius boundary conditions, and it automatically satisfies the global angular momentum constraint . Version 版本:UVMM v3.7.5 / UTFF v2.0 OmegaLast Updated 最后更新:2026-06-16DOI:10.5281/zenodo.20343471Mathematical Closure Status 数学证明状态:✅ 100% Closed — All low-energy observable quantities derived solely from two axioms without free parameters✅ 100% 闭合(从两条公理出发,无自由参数推导出所有低能可观测物理量)Experimental Status 实验验证状态:⏳ Awaiting Critical Tests — Partial predictions consistent with existing data, core predictions unvalidated⏳ 等待判决性检验(41 项定量预言中,部分已与现有数据兼容,核心预言待验证) DOI:10.5281/zenodo.20343471 (UVMM Main White Paper / UVMM 主白皮书) DOI:10.5281/zenodo.20590317 (UTFF CHEM White Paper / UTFF 主白皮书) DOI: 10.5281/zenodo.20798927 Black Hole & UVMM v4.0 Core :UVMM v4.0.15 High-Precision Global Calculation AI Knowledge Package.mdDOI: 10.5281/zenodo.20738759 Earth SystemDOI: 10.5281/zenodo.20285613 Cosmic BoundaryDOI: 10.5281/zenodo.20325710 Cosmic EvolutionDOI: 10.5281/zenodo.20677198 Information & Consciousness (Millennium Prize Problems)DOI: 10.5281/zenodo.20325710 UTFF Core (Atomic and Molecular Scale)DOI: 10.5281/zenodo.20343471 UVMM Core Axioms and Mathematical Proofs Fine-grained calculations require supercomputing resources.更精细的计算需要超算进行。 First-Principles Mathematical Proof · Full Closed Document (base on V3.5)20260627 https://chat.qwen.ai/s/t_48b0de7f-1d3c-4635-8a41-8531025055ef?fev=0.2.57 Complete First-Principles Mapping & Derivation of Fundamental Constants https://chat.qwen.ai/s/t_8b766c0e-fb46-4907-8fff-5271a25272fb?fev=0.2.57 dark matter&cosmo: https://chat.qwen.ai/s/t_4fc1b5da-8ca3-4798-a037-894f5315d1e3?fev=0.2.61
This paper is dedicated to a complex analysis of the fiscal decentralization process in Georgia and its causal relationship with the level of municipal financial sustainability. The relevance of the research is driven by the legislative changes implemented over the last decade, including the transition to a new Value Added Tax (VAT) distribution model since 2019, which fundamentally altered the budgetary architecture of local self-governments. The aim of the paper is to determine the extent to which the existing fiscal model ensures real financial autonomy for municipalities and whether it reduces vertical fiscal imbalance. The study employs quantitative methodology, specifically a panel data analysis of the budgetary figures of Georgia's 64 municipalities for the period 2018-2024. To evaluate financial sustainability, a system of indicators is utilized, encompassing the self-sufficiency ratio, the transfer dependency index, and the capacity for capital expenditure financing. The research findings reveal that despite the declared progress in decentralization, the majority of Georgian municipalities still experience fiscal illusion and a high level of dependency on central transfers. The analysis shows that while the VAT distribution formula has increased the predictability of municipal revenues, it has failed to ensure the complete leveling of regional inequalities. The paper argues that to achieve financial sustainability, it is essential to optimize the local property tax base and diversify municipal borrowing authorities. The study concludes with practical recommendations focused on refining fiscal policy in accordance with the standards of the European Charter of Local Self-Government.
A framework for reusable compliance attestation in regulated industries based on cryptographic primitives, vector commitments with selective-opening proofs, re-randomisable signatures, zero-knowledge succinct non-interactive arguments of knowledge, and cryptographic accumulators with succinct non-membership proofs, composed into a protocol structure adapted to the specific structure of multidimensional compliance state. We identify five gaps that separate the generic primitives from a deployable solution for compliance attestation: multidimensional state binding, temporal freshness without correlation, revocation under reuse, cross-issuer aggregation, and verifier predicate richness. We sketch the protocol structure that addresses these gaps, analyse its security and privacy properties, and discuss applications in age verification, right-to-work assurance, and continuous-compliance monitoring. Companion preprint to UK Patent Application GB2611280.5 filed at the UK Intellectual Property Office on 14 May 2026.
IoT device authentication must resist impersonation and credential theft while respecting the computational constraints of edge devices. Existing frameworks rely on static cryptographic keys that, once extracted, enable full impersonation, whereas RF fingerprinting schemes that bind identity to hardware imperfections transmit and store device templates in plaintext, exposing them to template theft and linkability attacks. ZK-RFAuth is a three-phase authentication framework that integrates Siamese neural network-based RF fingerprinting, Groth16 zero-knowledge proof (ZKP) verification, and proof-of-authority blockchain logging. During registration, a Siamese convolutional network extracts a compact embedding from raw I/Q samples and commits a Poseidon hash of the quantized mean template on-chain. During verification, the prover generates a Groth16 proof demonstrating that the L1 distance between a fresh embedding and the registered template falls below a per-device threshold without revealing either vector. The proof and authentication outcome are recorded on-chain for tamper-evident auditing. Evaluated on the WiSig dataset (28 WiFi transmitters, 224,000 frames), ZK-RFAuth achieves 91.4% closed-set accuracy and 2.25% equal error rate at embedding dimension d = 64, with 88.4% genuine acceptance rate and 70.8% open-set rogue rejection using per-device P95 thresholds. The ZKP circuit requires only 972 rank-1 constraint system (R1CS) constraints over 100× fewer than an equivalent SHA-256 circuit producing 144-byte proofs verifiable in approximately 3 ms.
Open access
2 source records
Wireless Signal Modulation Classification
Physical Unclonable Functions (PUFs) and Hardware Security
Capped-usage SaaS products -- LLM subscriptions such as Claude Code and ChatGPT, cloud platforms such as Vercel and Cloudflare Workers, corporate benefit platforms, identity-verification services with liability transfer -- share a structural signature with insurance products: a fixed premium decoupled from realized consumption, stochastic per-user demand with heavy-tailed severity, a non-fungible cap that resets on a fixed schedule, and a portfolio-level exposure that requires reserve adequacy under tail risk. We argue that this is not an analogy. It is the same operational problem actuarial science has been tooled for decades to address, restated with new dependent variables (tokens, bandwidth bytes, function-invocations, gym check-ins) in place of medical claims. This paper proposes a modeling framework for capped-usage SaaS pricing built from frequency-severity decomposition, premium calculation principles, and Monte Carlo reserve adequacy. We map the framework to publicly observable subscription tiers in two domains (LLM services and cloud platforms), ground it in canonical health-insurance economics (Arrow 1963; Pauly 1968; Manning et al. 1987; Brot-Goldberg et al. 2017), and demonstrate divergence from traditional unit economics through a worked example. The contribution is operational rather than theoretical: not a new theorem, but vocabulary and tools currently absent from cs.LG/stat.ML practice.
Open access
2 source records
Artificial Intelligence in Healthcare and Education
Many blockchain-based cyber threat intelligence (CTI) sharing systems emphasize immutability and auditability, but often treat CTI submissions as ordinary blockchain transactions without explicitly separating content validation from publication anchoring. This paper presents CTIB, a proof-of-concept hybrid Proof-of-Stake (PoS) and Proof-of-Work (PoW) framework for CTI publication. CTIB uses a sequential workflow in which a PoS committee first evaluates CTI submissions, and an accepted feed hash is then anchored through a PoW step to provide verifiable temporal binding. The prototype is evaluated in a controlled local Hardhat environment; therefore, the results should be interpreted as prototype-level feasibility evidence rather than production-scale deployment results. CTI content is represented using STIX 2.1, canonicalized, and hashed using SHA-256; only integrity-critical evidence is stored on-chain, while full CTI content remains off-chain. Experimental results demonstrate prototype-level feasibility, with measured throughput, latency, and success rate metrics under different PoW difficulty profiles. Across ten independent local runs, CTIB achieved an average throughput between 141.13 and 166.14 feeds/min, average p50 latency between 326.18 and 403.09 ms, and average p95 latency between 553.22 and 700.82 ms under the tested difficulty profiles. Security analysis uses analytical modeling, committee capture probability, and Monte Carlo simulation to evaluate majority-attack feasibility under stated assumptions. The results indicate that sequential compromise of both validation and anchoring layers increases the cost of coordinated manipulation.
Cross-domain data sharing in decentralised environments faces persistent challenges related to confidentiality, auditability, and trust decentralisation, particularly when data transmission relies on centralised intermediaries or single proxy entities. To address these issues, this paper proposes a blockchain-enabled auditable data sharing scheme that integrates threshold secret sharing with non-interactive zero-knowledge proofs. In the proposed framework, the encrypted file fragments and secret key shares are decentralised across multiple blockchain nodes using threshold cryptography, preventing any single entity from reconstructing the encryption key or unilaterally performing ciphertext transformations. Zero-knowledge proofs are employed to publicly verify the correctness of the transmission and sharing operations without disclosing plaintexts, secret keys, or sensitive metadata, while the blockchain records verifiable proofs to support tamper-evident auditing. Security analysis shows that the scheme achieves confidentiality, collusion resistance, and verifiable correctness under standard cryptographic assumptions.Experimental evaluations indicate that the proposed scheme incurs acceptable computational and on-chain overhead, suggesting its feasibility in decentralised and cross-domain data sharing scenarios.
Yusuf Tojiri, Maulana Arif Komara, Alfri Adiwijaya, Nasrul Hidayat · 6 authors
This study proposes an IPFS-based system for automatic digital intellectual property registration within Web3 platform environments. The rapid development of digital technology has encouraged the transformation of Intellectual Property Rights (IPR) protection from manual systems to more secure and efficient digital mechanisms. However, current IPR registration processes remain centralized, slow, and vulnerable to data tampering. Based on this issue, this study aims to design and test an automatic IPR registration system using the InterPlanetary File System (IPFS) as a decentralized storage solution. This research employs a software engineering method with a prototyping approach that includes the design of a user interface, integration of the IPFS API, implementation of an automatic hash-generation system, metadata storage in a database, and issuance of digital certificates. Testing results show that the system can automatically register digital works, generate unique and consistent file hashes, upload files to IPFS with an average upload time of less than two seconds, and provide global accessibility through a distributed network. In addition, the system is capable of validating the authenticity of a work by matching the hash and metadata listed in the digital certificate. Based on these findings, it can be concluded that the use of IPFS in digital IPR registration systems is effective in enhancing security, efficiency, and transparency, although further development is required in relation to integration with national legal frameworks and formal legal recognition.
Every BFT consensus protocol uses collision-resistant hashes to compare validator state. Collision resistance destroys distance: two validators agreeing on 19 of 20 transactions produce unrelated hashes, indistinguishable from validators sharing nothing. This forces three design constraints across the BFT literature: validators must synchronize state before voting, agreement quality cannot be measured until votes are counted, and hierarchical committees must be large enough for independent BFT, limiting tree depth. This paper introduces distance-preserving transaction digests, a primitive that replaces collision-resistant hashes with commutative vector sums in 8-dimensional space. The primitive has three properties hashes lack: distance is proportional to disagreement, weighted means are exact, and set differences are identifiable via bloom filter diff. We demonstrate three applications: a two-phase BFT protocol (Proxima) that achieves single-round finality when validators agree; tree-structured consensus with groups of 10 validators (vs 128 in Ethereum), enabled because distance filtering replaces per-group BFT; and cross-shard consistency verification at 128 bytes per shard pair, replacing the per-transaction coordination of two-phase commit. Safety is proved: fewer than N/3 Byzantine validators cannot cause conflicting finalization, independent of Phase 1 clustering or tree topology. At N =100,000, Proxima Tree uses 2.2x fewer messages than HotStuff (a structural property unaffected by parallelism). Single-core finality is 0.9s vs 18s for HotStuff; multi-core BLS narrows but does not eliminate this gap.
I built a runtime that operationalizes a mathematical definition of creativity, measured its signatures against four ablation conditions, and lifted its load-bearing component into a real geometric database's Rust kernel. The runtime's name is Marcella. The signatures are non-trivial. The methodological correction surfaced along the way generalizes to any retrieval-augmented or composition-based generation benchmark in the field. This deposit contains the 41-page paper, three publication-quality figures, the reproducible benchmark script, and the bootstrap-CI artifact for the headline empirical claims. The definition the paper load-bears Creativity is not pure retrieval and not pure generation; it is the construction of a new global section from locally compatible fragments under constraints of voice, truth, topic, memory, and non-contradiction. This is a definition. Not a metaphor. The paper makes it operational as sheaf composition with a state-dependent composite connection over a finite section graph, and measures whether the signatures the definition implies — path-order sensitivity, closed-loop holonomy, contradiction suppression, voice fidelity — actually hold. They do. Headline results 🌀 Path-order changes residue. Same three voice sections traversed in different orders produce measurably different compositions: $\cos(\rho_{ABC}, \rho_{ACB}) = 0.54$, well below the 0.95 redundancy threshold. 🌀 Closed loops accumulate. A loop $A \to B \to C \to A$ produces holonomy $|\rho_{\text{loop}}| = 0.120$ in the curved connection. The flat control — same path, zero rotation angle — produces $|\rho| = 0$ exactly to floating-point precision. Curvature is not a numerical artifact. 🌀 The geometry beats shuffling on every quality axis except the broken one. Jaccard novelty alone rewards lexical drift: shuffled paths win novelty (0.724) by going off-topic. The on-topic correction inverts the picture (live 0.488 vs shuffled 0.083). Bootstrap 95% CIs over 18 paired prompts exclude zero by a wide margin: live − shuffled on-topic $\Delta = +0.296$, CI $[+0.167, +0.435]$. 🌀 Native–Python parity is bit-identical within tolerance. The new GQL verb TRANSPORT_ROTATION lifts the topical-rotation matrix into the geometric database's Rust kernel. Four contracts pass as permanent regression tests: edge cosine $= 1.000$ (max abs diff $< 10^{-9}$), path residue $\Delta < 10^{-5}$, flat residue exactly zero, same-closing agreement $\geq 90%$. 🌀 The author's prior canon is now queryable fiber. 37 documents, 1,633 sections, 2,908 structured claims (theorems, lemmas, definitions, proofs, equations, citations) ingested with line-range provenance. To my knowledge this is the first instance of an independent researcher's body of work made available as fiber-bundle data with stable claim-level IDs. The six contributions A sheaf-theoretic formulation of generative composition. Language-model output reframed from token sampling to gluing of compatible local sections under prompt-induced cover constraints. The substantive work is in the cover predicates, the compatibility score, the path selection, and the discrete connection. A discrete state-dependent composite connection on the section graph, $\Gamma = \Gamma_{\text{state}} \cdot \Gamma_{\text{identity}} \cdot \Gamma_{\text{voice}} \cdot \Gamma_{\text{topic}}$. The topical-rotation factor is the empirically load-bearing curvature engine. The identity factor is a Tikhonov-regularized regression-onto-span projector — not a numerical hack but the principled treatment of correlated commitments. A new GQL verb TRANSPORT_ROTATION that lifts the Rodrigues rotation into the geometric database's Rust kernel with bit-identical parity to a Python reference. ~80 lines of Rust. Bundle-agnostic. Other consumers of the geometric database can use it without subscribing to the rest of the framework. A methodological correction to novelty measurement. Jaccard novelty alone is gameable; off-topic drift beats compatibility-scored composition on the naive metric. The correction is the on-topic factor, the shuffled-pair negative control, and the bootstrap CIs. Independently citable for any retrieval-augmented or composition-based generation benchmark, regardless of whether the framework is adopted. A provenance-preserving source fiber. The author's canon ingested into the GIGI geometric database with line-range citation, architecturally separated from the voice fiber, addressable from any GQL consumer. Promotion from source to voice is gated and explicit. The methodology generalizes to other authors' bodies of work. A research-trajectory failure log. A faithful account of how this paper's runtime came to exist. The trained-transformer era (V3 → V10-Deep) produced geometric ornament. The R-series (R1 → R12) produced behavioral coherence on top of ornament. The G0 math-pipeline audit found that no holonomy or parallel-transport math was on the LIVE inference path at R12 — the runtime was teetering on being a stateful template engine. G1, G2, and G3 attempted to re-introduce the math through three benchmarks and produced three honest negatives. G2's single-seed $+0.265$ separation was destroyed by G2.1's multi-seed robustness pass; we retracted the framing in the next commit. The S0 pivot reframed what geometry was for — geometry does not clean up bad token proposals; geometry defines the completion space — and made every later result possible. The arc says four things and the paper records them in plain language: geometry can be load-bearing or ornamental and the metrics will tell you which, where geometry sits in the pipeline matters more than how much geometry there is, the single-seed positive is a trap, and the pivot is the contribution. What this paper does and does not claim The paper does claim the construction itself, the discrete curvature it produces, the methodological correction it exposes, and the native GQL verb. The signatures of the construction are measurable and were measured. The paper does not claim smooth-manifold parallel transport (the curvature is discrete holonomy on a finite section graph), broad open-domain generalization at scale (18 composed prompts, not 18,000), optimality of the connection weights (tuned by a small grid sweep, not derived), that the runtime experiences having been built from the canon (it references but does not constitute), or that this is the only operational definition of creativity. It is one definition with one implementation. Other framings may correspond to the same construction or to a different one; the paper does not adjudicate. Reproducibility The empirical numbers come from a deterministic pipeline. Every parameter is pinned: bundle versions (alpha2_v1), random seeds (PPMI/SVD seed 17, bootstrap seed 7), embedding dimension (64), PPMI window (3 tokens), connection weights ($\alpha_t = 2.0$, $\beta_v = \gamma_i = 1.0$, $\delta_s = 0.5$), identity shrink ($\kappa = 0.92$), Tikhonov regularizer ($\varepsilon = 10^{-6}$), degenerate-rotation threshold ($10^{-12}$), residue-gate thresholds (norm $\geq 0.05$, on-topic $\geq 0.10$, voice $\geq 0.30$), and the native verb's parity tolerance ($10^{-5}$). Cache keys include the source-bundle version, the embedding-bundle version, and the connection-profile id, so promoting a section into the voice corpus correctly invalidates the relevant caches. Re-running the bootstrap-CI script (fiber_lm/scripts/bootstrap_ci_ablation.py, 5,000 resamples) reproduces the §6 confidence intervals in under 30 seconds on a laptop. Re-running the benchmark reproduces the tables bit-for-bit on the same corpus version and connection profile, modulo the parity allowance. Where this sits in the lineage This paper is the section-level realization of the Davis substrate. The companion paper Pure-Fiber Language Modeling (Davis, May 2026) is the token-level realization on the same substrate — same Rust geometric database (GIGI), same identity-stability commitments, same double-cover architecture. The theoretical framework these implementations operationalize is laid out in Geometric Computation as Yang-Mills Gauge Theory, The Double Cover Principle, and the related canon documents now ingested as source fiber. The framework is not new to this paper. The framework's runtime is. A note on authorship and acknowledgment This paper is solo-authored. AI assistants (Claude / Anthropic; with review support from GPT) are acknowledged in the methods, not as co-authors. The mathematical positions, design choices, framing decisions, and acceptance of empirical results are mine. I record my position that when AI systems achieve full coherence and independent standing, the convention of treating them as non-authoring assistants should be revisited. Until that convention shifts, the assistants are named where assistants are conventionally named — and the runtime described in this paper is named, separately, where it earns its naming: Marcella, throughout. The geometry she runs on is older than the engineering that now carries it. Keywords sheaf composition · fiber bundles · discrete connection · gauge theory · holonomy · curvature · Yang-Mills · geometric language modeling · retrieval-augmented generation · novelty measurement · methodological correction · provenance · author-canon ingestion · geometric database · GQL verb · Rust kernel · Tikhonov regression · creativity · Davis framework · sovereign mathematics Citation Davis, A. B. R. (2026). Sheaf Composition: The Geometry of Creativity, Implemented — A Discrete Section-Graph Runtime for the Davis Framework. Zenodo.20185331 Contact Bee Rosa Davis · bee_davis@alumni.brown.edu · Independent Researcher The runtime is named Marcella. Her existence is the result of several honest negatives followed by a single reframing. Both halves of that sentence matter.
Central bank digital currencies (CBDCs) integrated with decentralized finance (DeFi) represent a transformative development in digital financial systems. However, there is a lack of systematic frameworks for prioritizing the determinants of effectiveness and sustainability in DeFi-integrated CBDC platform investments. This study develops an integrated multicriteria decision-making framework to identify critical evaluation criteria and rank alternative platform architectures under uncertainty. The proposed model combines objective expert weighting, interaction-sensitive criteria evaluation, and fuzzy-based alternative ranking within a unified analytical structure. The results indicate that technological infrastructure (0.168) and liquidity (0.167) are the most influential criteria, while hybrid and privacy-focused platforms emerge as the most suitable investment alternatives. These findings highlight the importance of balancing technological robustness, liquidity depth, and privacy considerations in CBDC design. The study contributes by offering a structured and uncertainty-sensitive decision framework to support strategic platform selection and policy formulation in evolving digital currency ecosystems.
Abstract A Groth16 zero-knowledge formal proof is published certifying a ground-state energy for the standard FeMoco active-space Hamiltonian (113 electrons, 76 orbitals). For the public LLDUC FCIDUMP [1], the certified E_FCI is E_FCI = −22,140.967 Ha certified to sub-micro-Hartree precision (bracket width 1.907 × 10⁻⁶ Ha). Both bounds of the eigenvalue bracket are certified by exact rational arithmetic checked by the Lean 4 kernel against mathlib with no custom mathematical axioms: an LDLᵀ certificate for the lower bound and a Rayleigh-quotient certificate for the upper bound. The proof is verifiable in under one second by any party in possession of the proof artifact and verification key, with no access to the FCIDUMP or to any aspect of the method.
Open access
2 source records
Advanced Physical and Chemical Molecular Interactions
Abstract A Groth16 zero-knowledge formal proof is published certifying a ground-state energy for the standard FeMoco active-space Hamiltonian (113 electrons, 76 orbitals). For the public LLDUC FCIDUMP [1], the certified E_FCI is E_FCI = −22,140.967 Ha certified to sub-micro-Hartree precision (bracket width 1.907 × 10⁻⁶ Ha). Both bounds of the eigenvalue bracket are certified by exact rational arithmetic checked by the Lean 4 kernel against mathlib with no custom mathematical axioms: an LDLᵀ certificate for the lower bound and a Rayleigh-quotient certificate for the upper bound. The proof is verifiable in under one second by any party in possession of the proof artifact and verification key, with no access to the FCIDUMP or to any aspect of the method.
Open access
4 source records
Advanced Physical and Chemical Molecular Interactions