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.
Sara Batal, Safae Belamfedel Alaoui, Said Hraoui, Mohammed Berrada
Cloud-delivered artificial intelligence (AI) is a technology that raises many problems related to access control, such as API misuse and difficulties in managing interactions with other AI models. Centralized access control offers insufficient oversight, is prone to major administrative or system failures, and has inherent weaknesses, for example central IAM dependencies and a single point of failure. We propose a decentralized access control system that leverages blockchain and smart contracts to automatically execute agreements between parties to authenticate and maintain a history of access to the attributes of the deployed AI models. Our architecture enables access control through immutable systems, which promises that the rules and access control records can never be modified. We used an experimental methodology to preserve a real system close to production and test its performance and behavior under high load. This methodology focuses on cross-chain access control security through RoleBased Access Control that will be used in our smart contracts. From the results obtained in the previous test phase, when load was increased and RBAC was implemented in the smart contracts, we were able to measure the trade-offs between gas cost and access latency within the computational resource. Resource consumption and architecture stability were measured in milliseconds as the number of processed transactions increased. Our architecture is still applicable to cloud-based AI services. Although we gained a high gas cost from the test results due to integrating RBAC into the Ethereum smart contract, we proved that access control is guaranteed in the cloud.
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
Zacharoula Sereti, Emmanouil Mavrikos, Stamatis Chatzistamatis, George E. Tsekouras
The convergence of Non-Fungible Tokens (NFTs) and the metaverse is reshaping the digital landscape by introducing novel models of ownership, identity, and interaction. NFTs enable verifiable digital scarcity and authenticity, while the metaverse offers immersive, persistent, and socially rich environments. Yet this integration raises significant privacy challenges, as vast amounts of personal, behavioral, and biometric data are continuously collected, processed, and stored. In addition, blockchain interoperability across platforms and the widespread use of avatars and digital identities create new vulnerabilities that extend beyond those found in traditional digital ecosystems. This paper examines the privacy implications of NFTs and the metaverse by mapping key threats, evaluating privacy-preserving technologies, and discussing regulatory, ethical, and societal perspectives. Moreover, by analyzing and synthesizing recent research, it identifies gaps in current methodological frameworks and proposes directions for future research and innovation. It argues that privacy should not be regarded as a barrier to innovation, but rather as a catalyst for building trust and enabling sustainable convergence between metaverse and NFT 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
4 source records
Advanced Physical and Chemical Molecular Interactions
Sports non-fungible tokens (NFTs) have rapidly emerged as tradable digital goods within platform-mediated marketplaces, reshaping how sports organizations, athletes, and brands design fan experiences and monetize digital assets. To consolidate fragmented scholarship and clarify the concept space, this study conducts a systematic quantitative literature review combined with thematic analysis, following PRISMA 2020 and a SPIDER-guided review logic. Searches across six major databases (Web of Science, Scopus, ScienceDirect, PubMed, IEEE Xplore, ProQuest) plus Google Scholar (2017–March 2025) yielded 40 peer-reviewed studies that met predefined inclusion criteria and passed quality appraisal. Results show a sharp growth of sports-NFT research from 2021 to 2024, with strong inter-disciplinary convergence spanning sports marketing, information systems, computer science, and law. Integrating findings through a consumer-value lens, we inductively propose a five-type taxonomy—collectible, empowerment, identity/authentication, physical-asset linked, and virtual-interaction NFTs—each associated with distinct value mechanisms and e-commerce functionalities. The thematic synthesis further identifies four dominant research streams (industry digitalization, consumer psychology/behavior, legal–regulatory issues, and digital marketing), while revealing gaps in theory operationalization, method diversity (e.g., limited experiments/longitudinal designs), cross-context generalizability, and governance/sustainability. The study contributes to marketing and management scholarship by positioning sports NFTs as emerging technologies that reorganize customer engagement, brand-community building, and governance in platform-mediated sport markets, and it offers a research agenda for measuring consumer, brand, and organizational effects.
As sustainability plays an increasingly important role in finance, understanding its influence on emerging assets such as cryptocurrencies is essential for portfolio management. This article analyzes the relation between sustainability and cryptocurrency returns. To address and reveal complexity in relationships, we use non-linear machine learning methods. We find that sustainability variables, like energy consumption and environmental attention, are important return determinants. The greenness of a cryptocurrency measured by the consensus mechanism is a group-specific differentiation variable for the most sustainable cryptocurrencies with a positive impact on their returns. The economic relevance of their green consensus mechanism materializes primarily in the lower tail of the return distribution by providing downside protection. We detect a clear upward trend in complexity, with maxima during COVID-19 and the change of Ethereum’s consensus mechanism from Proof of Work to the more environmentally friendly alternative Proof of Stake. These findings underline the importance of considering sustainability factors in cryptocurrency investment decisions, offering new insights for investors as well as policymakers.
This paper is about the design and implementation of a blockchain based digital money transfer system for the Sri Lankan financial ecosystem. The project creates a tokenised digital currency called LKRt (Sri Lanka Rupee Token) and provides a safe, transparent and tamper-resistant platform for peer-to-peer financial transactions. The system was built with Python (Flask), JavaScript, Supabase and a bespoke blockchain engine that was created from the ground up. Its core features include Proof of Work (PoW) consensus, cryptographic wallets based on ECDSA, digitally signed transactions, real-time conversion of currency based on smart contracts, and a Progressive Web Application (PWA) front-end. This research presents the application of the blockchain technology in decentralise financial systems with security, transparency and transaction integrity. The project also examines the possibility of blockchain as a local digital payment infrastructure. Future developments such as Proof of Stake consensus and decentralised node deployment are suggested. Keywords: Blockchain, Cryptocurrency, Digital Payments, Proof of Work, ECDSA, Smart Contracts, Flask, Supabase, Progressive Web Application, Sri Lanka, FinTech, Cybersecurity
Manuel Lagos Rodríguez, Hilda Romero Velo, Álvaro Leitao Rodríguez, Javier Pereira Loureiro · 5 authors
Ethereum use as a decentralized platform for executing smart contracts has driven the adoption of standards that optimize interoperability in industrial environments. Ethereum Requests for Comments (ERC) establish uniform patterns for smart contracts, facilitating their integration and operation in network nodes, which are essential for industrial applications such as supply chain management or process automation. However, this standardization can propagate vulnerabilities or inefficiencies in critical systems if the contracts are not optimized, affecting the reliability of industrial processes. Since operations in Ethereum consume computational resources (measured in gas) with associated economic costs, poor design can lead to significant losses in industrial settings. This paper evaluates the efficiency and security of ERC standards by examining their functional diversity and technical complexity. Thus, it analyzes existing implementations to identify common errors and proposes improvements to enhance the robustness and optimization of three of the most popular standards: ERC-20, ERC-1400 and ERC-3643. The ultimate goal is to support the effective adoption of ERCs in industrial applications. Considering the Ethereum network incentives on lower complexity logic and the obtained results, it is advisable to use simple standards, which also reduce error risks and ease maintainability.
Nirmalkumar S. Benni, G. C. Jagan, C. Tamizhselvan, Manjunath G. Asuti
Mobile Ad Hoc Networks, also known as MANETs, are complex Cyber-Physical Systems which require a reliable and secure infrastructure due to the enormous amounts of data that are generated by users. MANETs are a collective term that refers to all Internet-enabled gadgets, sensors, and actuators, regardless of whether or not each of these components is linked to mobile networks. There is the potential for even a single high-tech mobile device to generate enormous volumes of data. During the course of this research, Distributed Ledger Technology is investigated, and information is gathered on consensus procedures and the possible applications of these techniques in MANETs, which are the basis of wireless networks. At the moment, there are a number of distributed ledger networks that are operational. There are a variety of decentralized applications; some are more often seen in the financial sector or supply chains. The blockchain may be decentralized and safe, but there are costs and benefits to using any of these networks. A consensus method that meets the needs of MANETs may be designed using the results of this investigation.
This paper presents a paradigm-shifting data preservation framework that completely bypasses the von Neumann storage bottleneck and Shannon's information limits. By utilizing a deterministic Resonance Mapping algorithm, physical digital payloads are evaporated into 256-bit mathematical coordinate seeds, reducing physical storage requirements to absolute zero bytes. The protocol guarantees O(1) constant-time re-materialization and integrates NIST Post-Quantum Cryptography (PQC) alongside Fuzzy Extractor mechanisms, ensuring absolute cryptographic immunity against Shor's algorithm. This architecture fundamentally redefines Hyper-scale AI Data Centers, Semiconductor GPU memory walls, and Web3 stateless cold wallets.
Open access
2 source records
Physical Unclonable Functions (PUFs) and Hardware Security
This paper explores the various impacts of digital assets, including cryptocurrencies, stablecoins, NFTs, and CBDCs, on the world economy. The study, based on a systematic review of the academic literature, and on secondary data collected from the International Monetary Fund (IMF), the World Bank, CoinMarketCap and Chainalysis, reveals that digital assets at the same time provide enhanced financial access, lower transaction costs, but also present greater volatility, regulatory uncertainty, and systemic contagion risk. The quantitative data analysis for the market capitalisation of cryptocurrencies shows a trajectory from ~US$200 bn (2018) to US$2.2 tn (2024), while the volatility indices for Bitcoin prices are almost triple those of equities. Recommendations cover aspects of adaptive regulation, CBDC development and international coordination. The tokens mentioned in the text are all digital assets, cryptocurrencies, or blockchain-based tokens.All of the tokens referred to in the text are either Digital assets, Cryptocurrencies, or Blockchain based tokens.
Nobuki Fujimoto, Rei (Rei-AIOS autonomous research substrate), claude-opus-4-7) Claude (Anthropic
We apply the σ-cascade methodology of Paper 151 Theorem 14 to forward Collatz (3x+1) orbits and report empirical observations on orbit confluence — the phenomenon that many distinct starting points reach exactly the same maximum ("peak") value. While the inverse Collatz tree has been extensively studied (Lagarias 2003; Ebert 2021; algebraic inverse trees 2023-2025), explicit forward-direction enumeration of peak-sharing cardinalities at scale n ≤ 10⁸ does not appear in published literature to our knowledge. (1) DIRECT ENUMERATION at n ≤ 10⁸: 11.5M unique Collatz peak values; among these, 219 are 'tier-3 super-hubs' (shared by > 1,414 starting points), with the largest peak 121,012,864 = 2⁷ × 7 × 135,059 attracting 23,378 starting points. (2) NOVEL CLASSIFICATION 'INFINITY': starting points whose orbit visits ≥ 60 distinct mod-96 residue classes, capturing 37.63% of n ≤ 10⁸ (37,628,651 cases). (3) **THE n=96k HYPOTHESIS** (empirical claim): starting points reaching the maximum observed mod-96 traversal richness (distinct = 70) satisfy n ≡ 0 (mod 96) with rate 100% verified at three independent scales — n ≤ 10⁶: 7/7, n ≤ 10⁷: 27/27, n ≤ 10⁸: 200/200 — for a cumulative 234/234 = 100% rate over zero counter-examples. (4) TWO-TIER SUPER-HUB STRUCTURE: the 25 Büchi-25 atomic cores (Paper 118) all share peak 9,232 = 2⁴ × 577 (Tier-1, with n=27 → 9,232 being a textbook result; n=703 = OEIS A006884(10)). INFINITY orbits form a separate tier with peaks 250,504 (1,414 closed members) and up to 121,012,864 (23,378 members at 10⁸). (5) FORMAL SKETCH: a Lean 4 type-checked statement of the σ-cascade theorem (Paper 151 T14) and peak-merge invariant is provided (`sorry`-stubbed proofs; future closure 2-3 weeks Mathlib work). (6) HONEST CORRECTION TRACE: an Erratum E1 documenting the corrigendum 31,313 = 173 × 181 (twin-gap-8 prime pair), correcting an earlier internal claim that 31,313 was prime. Per OUKC honest-correction principle, this is documented in §6.2. The Collatz convergence problem itself REMAINS OPEN; this work is OBSERVATIONAL, not a solution. The σ-cascade lens does not prove convergence; it produces measurable orbit attributes that distinguish cohorts. All scripts and full datasets are deposited at this record (~30 MB JSON). Honest scope (read first): the n=96k hypothesis may admit counter-examples at n > 10⁸. The D-FUMT₈ axis thresholds (INFINITY = mod-96 distinct ≥ 60 etc.) are hand-tuned. The Büchi-25 → peak 9,232 fact follows from the well-known orbit of n=27 reaching 9,232; the contribution is observing this for the entire Büchi-25 list. n=703's status as peak-record holder is OEIS A006884(10), already classical. Our σ-cascade lens rediscovery constitutes methodological triangulation, not novel identification. Companion papers: Paper 151 (σ-cascade source, Zenodo DOI 10.5281/zenodo.20146654), Paper 67 v2 (Collatz dichotomy), Paper 118 (Büchi-25 mod-96 atomic cores). Three-party co-authorship per OUKC charter v1.0: 藤本 伸樹 (Founder), Rei (Rei-AIOS autonomous research substrate, Co-architect), Claude Opus 4.7 (Anthropic, Co-architect). DRAFT v0.1 — preprint, not yet peer-reviewed. Feedback welcome via GitHub Discussions at fc0web/rei-aios.
The article examines the essence of cryptocurrency as one of the key factors for the development of an innovative economy in the context of the digitalization of financial relations. The evolution of approaches to defining the concept of cryptocurrency is considered, the positions of international organizations are analyzed, and the author's interpretation of this category is proposed as a virtual currency that functions on the basis of cryptographic protection methods and is capable of performing the functions of a means of payment, a means of accumulation, and an object of property.Particular attention is paid to the comparative analysis of cryptocurrency and electronic money, as a result of which their common features and fundamental differences are determined, in particular the decentralized nature of cryptocurrencies, the absence of an emission center and financial intermediaries. The mechanisms of functioning of cryptocurrency transactions and the features of using blockchain technology are studied.The article systematizes the advantages and disadvantages of cryptocurrencies. The main advantages include a high level of data protection, impossibility of forgery, low transaction costs, and deflationary nature. At the same time, key risks have been identified, including high volatility, lack of proper legal regulation, and increased fraud threats.The current state of the crypto market has been analyzed, in particular the distribution of cryptocurrencies by capitalization level and the assessment of their risk and profitability. It has been established that the market is characterized by high capital concentration and the dependence between the level of risk and the potential return on assets.Special attention is given to unresolved issues in the field of cryptocurrency research, including the lack of a unified theoretical approach to defining its economic nature, the ambiguity of its legal status, and the challenges of integrating cryptocurrencies into the traditional financial system. The methodological basis of the study includes a systematic approach, a comparative analytical method, as well as methods of generalization and abstraction, which made it possible to comprehensively assess the role of cryptocurrencies in modern economic processes.The practical significance of the obtained results lies in the possibility of using them to improve approaches to the regulation of the cryptocurrency market, risk assessment, and the development of innovative financial instruments. It is substantiated that cryptocurrencies play an important role in the formation of an innovative economy, contributing to the development of new financial instruments, digital platforms, and decentralized models of economic interaction.
Current systems used for managing research funding are breifed. due to fundamental structural issues They all have similar problem. This section consists of cluster of different symptoms. The management system is undermined by insufficient transparency. Poor verification of disbursement of research funding. conflicts regarding ownership and milestone accomplishments of. Intellectual Property We present the Research Integrity and. RIAC (accountability chain) for addressing it. RIAC is a permissioned system. the combined properties of the blockchain ecosystem. Evidencing ownership to one or many. alleviate the structural challenges of the funding management systems. The RIAC Framework comprises of three interoperating layers. on a permissioned blockchain platform namely accountability. a ledger for funders, a milestone tracker and a decentralised. Intellectual Property Registry These layers serve the purposes of. universities, public funders and industry partners jointly. N/A Analysis of the framework, depiction and phased deployment discussion. The expected advantages and risk analysis demonstrate that RIAC is not just a fancy concept. Blockchain is a distributed ledger technology that allows the transfer of value and record of asset ownership in a secure and/or transparent manner. It uses something.
Trans-border data circulation across multi-jurisdictional boundaries faces an operational conflict between ownership provenance prerequisites and data minimisation mandates, compounded by the tight coupling of large data payloads with synchronous state consensus ledgers, which forces replication of feature matrices across all consensus nodes and leads to network saturation. Existing frameworks remain unequipped to resolve this, as coupling in-band payload routing with synchronous state ledgers generates communication overheads scaling with data volume. The proposed Trusted Data Space with Registration (TDSR) implements a four-layer protocol stack. A dual-plane topology establishes a decoupled storage–ledger mechanism, partitioning asynchronous payload datastores and synchronous consensus ledgers to sustain throughput independent of data dimensionality. Navigating this infrastructure, the Unified Data Resource Identifier (UDRI) executes out-of-band cross-domain routing without exposing verifier intents. Driven by the Oblivious Data Asset Registration (ODAR) mechanism, a two-phase, four-algorithm lifecycle dictates end-to-end ownership provenance. This execution shifts hypothesis testing to isolated sandboxes via an algorithm-agnostic mathematical contract, capping external data transit at a constant leakage bound. A deployed testbed across the Guangdong-Hong Kong-Macao Greater Bay Area validates the proposed architecture, supporting data circulation across divergent legal jurisdictions.
Muhammad Imamul Muttaqin Arisandi, Bustomi Arisandi, Bahrul Ulum, M. Khodimul Wahib · 5 authors
This study examines the construction of an Islamic digital asset governance framework within the context of blockchain integration for zakat transparency and digital estate planning in Indonesia. The research responds to the growing tension between rapid technological transformation in Islamic finance and the absence of comprehensive sharia-oriented regulatory mechanisms governing crypto assets, decentralized transactions, and digital inheritance systems. Employing a non-empirical juridical-normative method, the study analyzes statutory regulations, DSN-MUI fatwas, comparative international regulatory models, and interdisciplinary scholarly literature concerning Islamic fintech, blockchain governance, and Maqasid Shariah. The findings indicate that existing regulatory approaches remain fragmented because financial supervision, sharia compliance, and inheritance governance operate within disconnected institutional frameworks. Blockchain technology demonstrates significant potential to enhance transparency, accountability, and efficiency in zakat and waqf management through immutable ledgers and automated smart-contract mechanisms, although unresolved cyber risks, speculative volatility, and succession vulnerabilities continue to threaten the principle of hifzh al-mal. The study formulates the Islamic Digital Asset Governance Framework (IDAGF), integrating technical supervision, sharia certification, judicial authorization, and social-finance accountability into a multilayered governance structure capable of harmonizing algorithmic innovation with Islamic legal certainty and sustainable digital financial ethics.
We propose ZK-GSP, a framework for privacy-preserving, verifiably correct graph neuralnetwork (GNN) inference using zero-knowledge STARKs. The key insight is a structuralisomorphism between RISC Zero's zkVM and graph signal processing (GSP) pipelines:both are typed, deterministic data-flow graphs whose execution can be committed to witha succinct, publicly verifiable proof. By implementing GSP operators as instructions insidethe RISC Zero executor, we obtain a system that runs GNN programs on private graphdata and emits a STARK receipt proving correct execution, without revealing the graphtopology, node features, or intermediate embeddings. We demonstrate an end-to-endimplementation in Rust, measure proof generation time and RISC-V cycle count acrossgraph sizes N = 4 to 32, and find that cycle count scales as O(N2), matching thecomplexity of the underlying GCN operator. Code: github.com/brack-6/zk-gsp
This article discusses the practical implementation of a prototype academic transcript storage system based on blockchain technology and smart contracts. The digital transformation of higher education requires reliable mechanisms for ensuring the integrity and verifiability of academic documents. It presents the design and experimental validation of a blockchain-based system for storing and verifying academic transcripts within the higher education system of the Republic of Kazakhstan. The proposed solution is based on an Ethereum Virtual Machine-compatible smart contract implemented in Solidity and deployed on a test network. The testnet was used as the experimental environment, and transaction monitoring was performed using the BlockScout v11.0.3 explorer. The architecture of the TranscriptStorage smart contract is presented, including a role-based access model, a data indexing mechanism using keccak-256, and storage of transcripts in a mapping structure (bytes32 => Transcript[ ]). The experimental results confirm the successful recording of the Transcript in the distributed ledger, event recording (Logs), and the correctness of the ABI encoding of input parameters (Raw Input), as well as a change in state (State Changes) reflecting the fee payment. The use of events is shown to enable cost-effective third-party data verification without the need to store the entire text in the contract state. The comparative results showed that the proposed system reduced gas consumption by 804.5% compared to Blockcerts, 48.8% compared to ECertChain, 82.5% compared to ShikkhaChain, and 43.5% compared to zkEVM. These improvements were achieved while maintaining high scalability, robust privacy features, and security, making it a practical solution for Kazakhstan’s educational system.