SILMARILS is built from a minimal algebraic core over $\mathbb{F}_p$ using true randomness and perfect $2$-out-of-$2$ Shamir secret sharing. The framework supports both two-party and three-party modes. In the two-party setting, SILMARILS realizes a transferable designated-verifier (TDV) signature scheme. The designated verifier can simulate accepting transcripts indistinguishable from real ones, achieving Jakobsson-Sako-Impagliazzo DV security. The verifier may publish a receipt $r$ enabling public verification, yet even with $r$, no external party can tell whether a transcript was signed or simulated. As DV signatures permit simulation, standard EUF-CMA cannot hold for the designated verifier; instead, we prove $\mathsf{EUF\text{-}CMA}^{\neg\mathsf{DV}}$ security for all non-designated verifiers in both the random oracle model (ROM) and quantum random oracle model (QROM). In the three-party mode, adopting the broadcast model of Fitzi et al., we obtain a statistically secure signature protocol with simulation-based security and error $1/p$. We analyze security in the Pure IT model, the IT+ROM, and the QROM, extending the Fitzi et al. framework to quantum adversaries with classical I/O. Correctness, secrecy, transferability, and unforgeability for non-designated parties remain equivalent to simulation-based security. Thanks to its simple algebraic structure, SILMARILS offers very compact keys and signatures for the blockchain settings we target, where standardized PQC schemes are already more than sufficient. Our goal is not to compare SILMARILS with PQC, but to highlight its suitability for lightweight TDV authentication. A fair comparison with other DV schemes is omitted due to space and the complexity of aligning models.
This paper presents InsureConnect, a blockchain-based system for improving transparency, authentication, and auditability in property-insurance workflows after natural disasters. The system combines Self-Sovereign Identity (SSI), Decentralized Identifiers (DIDs), Verifiable Credentials (VCs), satellite imagery, Hyperledger Fabric, and IPFS to register identities, insurance contracts, and damage claims. Property images are stored off-chain in IPFS, while content hashes and signed records are maintained on a permissioned blockchain. Users interact with the system through a desktop application, while chaincode enforces role-based access control and validates digital signatures. The prototype was evaluated under concurrent request loads from 50 to 3000 requests, measuring latency, throughput, and dropped connections. The results indicate that the system sustains increasing throughput under load, although latency rises and dropped connections appear at higher concurrency levels.
Strategic competitions in the real world, from wars to geopolitical rivalries, often involve coalitions competing against rival groups. These contests are not simple interactions between unified entities, but multilayered processes in which coalitions face external competition while dealing with internal conflicts over resources and strategy. Existing game-theoretic models typically treat inter-coalition rivalry and intra-coalition competition separately. This paper introduces the Compound Coalition-Attrition Game (CCAG), a unified framework that integrates a war of attrition between coalitions with a simultaneous war of attrition within each coalition. In this model, the endurance of a coalition in external competition is determined by the strategic choices of its members, who compete internally for shares of the outcome. We prove the nonexistence of pure-strategy equilibria and characterize the unique mixed-strategy Nash equilibrium. The analysis reveals feedback effects: external competition intensifies internal conflict, while internal discord weakens external performance. A case study compares traditional commodity markets, including gold, copper, and silver, with cryptocurrency markets, including Bitcoin, Ethereum, and Solana, using data from 2018 to 2023 in a simulation framework. The results demonstrate applicability in industrial strategy, corporate decision-making, and geopolitical competition. The CCAG framework provides a tool for analysing complex strategic environments.
Elections may be expedited, simplified, and enhanced through electronic voting. They are not frequently employed as a result of security, transparency, scalability, and voter confidentiality concerns. Our blockchain-based electronic voting system is impermeable, visible, and privacy-protective due to the use of advanced cryptographic algorithms and a permissioned distributed ledger. A permissioned blockchain that employs an expedited consensus method enhances throughput and minimizes latency during critical elections. Voter registration, voting, and tabulation are automated through the use of smart contracts. This mitigates centralization and manipulation. Privacy is safeguarded through encryption, decentralized identity (DID) frameworks, and verified methods. Comprehensive verification is facilitated by the protection of voter anonymity. In a hybrid architecture, scalability is enhanced and computational power is reduced through off-chain storage and on-chain validation. The proposed system is capable of withstanding unauthorized access, data manipulation, and duplicate voting, as evidenced by a comprehensive security and performance analysis. Furthermore, it surpasses voting systems that are founded on blockchain technology. The findings indicate that the secure digital election technology is both scalable and viable, thereby facilitating the implementation of transparent and dependable voting systems.
<b>【Description】</b>[EN]:<i>Relocation Notice:</i><br>Due to an unavoidable structural incompatibility between the mandatory data-parsing frameworks of conventional academic repositories and the strict zero-knowledge proof requirements of this archive, this item has been relocated to this environment. To protect its integrity from automated systemic interference, it is currently placed under a Permanent Embargo, functioning exclusively as a cryptographic spatial anchor.<i>Strategic Ambiguity Regarding Future Disclosure:</i><br>While this archive is strictly restricted to preserve its current integrity and trade secret classification, this status does not definitively preclude the possibility of partial or full disclosure in the future. The management of this intellectual property remains entirely under strategic discretion. Furthermore, regardless of any future discoveries or the accumulation of operational insights, I assume no obligation to update this document, provide continuous reporting, or issue prior notification regarding any changes in disclosure status, scope, or conditions.This data archive contains the restricted documentation for the "Persona-Native Principle (PNP) - Final Form."<br>The existence and integrity of this document have been legally established and secured by an electronic certified date (timestamp) issued by a Notary Public in Japan.Cryptographic Proof of Existence (SHA-256 Hash):<br>5ec4637def8bc7a45b113d6dee25e4d88672865ebd37def1c9c30c95de581145[JP]:<i>移設記録:</i><br>従来の学術リポジトリが前提とする「データ開示と自動解析の強制力」と、本アーカイブが要求する「完全なアクセス拒絶による存在証明（ゼロ知識証明）」の間に、不可避の構造的非互換性（Structural Incompatibility）が確認されました。そのため、予期せぬシステム的干渉から完全性を保護するべく、本アーカイブは独自の暗号学的アンカーとして、本環境にて恒久的なエンバーゴ（封印）下に置かれています。<i>将来の開示に関する戦略的曖昧性:</i><br>現在の完全性および営業秘密としての分類を保持するために本アーカイブは厳格に制限されていますが、この状態は、将来においてその一部または全部を公開する可能性を断言して否定するものではありません。本知的財産の管理は、完全に戦略的裁量の下にあります。さらに、今後新たな発見や運用知見が蓄積された場合であっても、私は本文書の更新、継続的な報告、および開示状況や条件の変更に関する事前通知を行ういかなる義務も一切負いません。本データアーカイブは、『Persona-Native Principle (PNP) - Final Form』に関するアクセス制限付きドキュメントを格納しています。<br>本文書の存在および完全性は、日本国公証人による電子確定日付（タイムスタンプ）により法的に保全されています。存在証明ハッシュ値 (SHA-256):<br>5ec4637def8bc7a45b113d6dee25e4d88672865ebd37def1c9c30c95de581145<br><b>[Patent Status & Strategic Protection]</b><br>[EN]:The core architecture and methodologies documented within this archive are subject to pending patent applications in Japan (e.g., Application No. 2026-000032). In accordance with our Strategic Non-Disclosure Policy, the disclosure of this specific jurisdiction and application number does not constitute a comprehensive representation of our global intellectual property portfolio. We reserve all rights to pursue, expand, or maintain provisional and formal protections across international jurisdictions without prior public notification.<br>[JP]:本アーカイブに記録された中核的なアーキテクチャおよび方法論は、日本国において特許出願中（例：特願2026-000032）です。当方の「戦略的非開示ポリシー」に基づき、この特定の管轄と出願番号の開示は、当方のグローバルな知的財産ポートフォリオの全容を示すものではありません。当方は、事前の公的通知なしに、国際的な管轄区域において仮出願および本出願による保護を追求、拡大、または維持するすべての権利を留保します。<b>【Terms of Access & Confidentiality】</b>[EN]:<b>Restriction of Access & Confidentiality:</b> The contents of this archive contain highly sensitive proprietary assets of Persona Foundry Aoi Design. All files are secured under restricted access. Any unauthorized access, disclosure, or attempt to bypass these restrictions is not permitted under applicable intellectual property guidelines.[JP]:<b>アクセス制限と守秘義務:</b> 本アーカイブの内容は、Persona Foundry Aoi Designの機密性の高い独自資産として厳格に管理されています。すべてのファイルはアクセス制限下で保護されており、不正アクセス、開示、または制限を迂回するいかなる試みも、適用される知的財産保護の観点から許可されていません。<b>【Terms of Use】</b>[EN]:<b>Disclaimer of Warranties:</b> The materials are provided "AS IS." The author makes no representations and extends no warranties of any kind, express or implied.<b>Limitation of Liability:</b> In no event shall the author be liable for any direct, indirect, or consequential damages arising from any unauthorized access, use, or inability to use the materials.<b>Governing Law and Dispute Resolution:</b> This Agreement and any disputes arising out of it shall be governed by and interpreted in accordance with the laws of Japan. Any concerns will be resolved within the appropriate legal venues in Japan designated by the author.[JP]:<b>無保証 (AS IS):</b> 本データは「現状有姿」で提供されます。著者は、明示的か黙示的かを問わず、いかなる種類の保証も行いません。<b>責任の制限:</b> 著者は、本データへの不正アクセス、使用、または使用不能から生じるいかなる直接的、間接的、または結果的な損害についても責任を負いません。<b>準拠法および紛争解決:</b> 本規約およびそこから生じるいかなる紛争も、日本国法に準拠し、解釈されるものとします。懸念事項が生じた場合、日本国内における著者が指定する適切な法的手続きに従って解決されるものとします。<b>[ License ]</b>CC BY-NC-ND 4.0 InternationalThe statements within the document take precedence over any platform terms.<br>※投稿および掲載プラットフォームの規定にかかわらず、本文内の記載を優先します。<b>[ Files & Integrity ]</b>File: PNP FINAL FORM - BILINGUAL_v1.0.pdfHash: 5ec4637def8bc7a45b113d6dee25e4d88672865ebd37def1c9c30c95de581145
A model artifact can be verified on disk without establishing which model is computing at runtime. Trustfall Lite is an open-source command-line tool (Apache-2.0) that scans local Hugging Face and Ollama model caches, computes the SHA-256 of each artifact, and verifies the hash against a signed registry whose records are JWS-signed and verified against a published JWKS. Every artifact resolves to one of four statuses: verified, unknown_variant, not_enrolled, or pilot_available. The tool runs locally; model bytes are not transmitted, and file paths and filenames are not sent to the verification API. By default, artifact hashes may be queried against the Fall Risk API; --local-only verifies against a cached registry without network lookup. This note describes what artifact-level verification establishes, where it stops, and how it relates to the runtime structural identity measurement developed across the Fall Risk Research program. Artifact verification is necessary but not sufficient: the same SHA-256 can serve different runtimes, models can be loaded over the network without touching disk, and disk-time identity does not guarantee runtime identity. The boundary between these two evidence classes — file-level and runtime — is the subject of this note. The Neural Network Identity Series — Mathematical foundations, empirical validation, and governance frameworks for verifying which model is running Newest addition: Technical Note: The Disappearing Window — AI Logprob Access Withdrawal and the Structural Verifiability of Frontier Model Contracts (DOI: 10.5281/zenodo.20362098) Paper 1: The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry (DOI: 10.5281/zenodo.18704275) Paper 2: Template-Based Endpoint Verification via Logprob Order-Statistic Geometry (DOI: 10.5281/zenodo.18776711) Paper 3: The Geometry of Model Theft: Distillation Forensics, Adversarial Erasure, and the Illusion of Spoofing (DOI: 10.5281/zenodo.18818608) Paper 4: Provenance Generalization and Verification Scaling for Neural Network Forensics (DOI: 10.5281/zenodo.18872071) Paper 5: Beneath the Character: The Structural Identity of Neural Networks — Mathematical Evidence for a Non-Narrative Layer of AI Identity (DOI: 10.5281/zenodo.18907292) Paper 6: Which Model Is Running?: Structural Identity as a Prerequisite for Trustworthy Zero-Knowledge Machine Learning (DOI: 10.5281/zenodo.19008116) Paper 7: The Deformation Laws of Neural Identity (DOI: 10.5281/zenodo.19055966) Paper 8: What Counts as Proof? — Admissible Evidence for Neural Network Identity Claims (DOI: 10.5281/zenodo.19058540) Paper 9: Composable Model Identity — Formal Hardening of Structural Attestations in the Enterprise Identity Stack (DOI: 10.5281/zenodo.19099911) Paper 10:Where Identity Comes From: Path Sensitivity and Endpoint Underdetermination in Neural Network Training (DOI: 10.5281/zenodo.19118807) Paper 11: Post-Hoc Disclosure Is Not Runtime Proof: Model Identity at Frontier Scale (DOI: 10.5281/zenodo.19216634) Paper 12: Family-Dependent Response to Reasoning Distillation Across Structural and Functional Identity Layers (DOI: 10.5281/zenodo.19298857) Paper 13: Safety-Alignment Removal as a Model-Identity Failure — Structural Evidence from Published Weight-Level Mutation Checkpoints (DOI: 10.5281/zenodo.19383019) Technical Note: Agent Identity Is Not Model Identity (DOI: 10.5281/zenodo.19240883) Technical Note: Gap Invariance: Why PPP Measurements Are Domain-Independent by Construction (DOI: 10.5281/zenodo.19275524) Technical Note: Measured Model Substitution Under Valid Agent Credentials (DOI: 10.5281/zenodo.19342848) Technical Note: Artifact Identity Is Not Runtime Identity — Trustfall Lite and the Boundary of File-Level Model Verification (DOI: 10.5281/zenodo.20019127) Formal Verification Stack for Neural Network Structural Identity (IT-PUF Coq Proofs) (DOI: 10.5281/zenodo.18930621) Copyright (c) 2026 Anthony Ray Coslett / Fall Risk AI, LLC. All Rights Reserved. Confidential and Proprietary. Patent Pending (Applications 63/982,893, 63/990,487, 63/996,680, 64/003,244).
Financial software sits at the center of modern economic infrastructure, yet the programming languages used to build it provide no formal guarantees about the semantic correctness of financial operations. Double-entry bookkeeping’s duality constraint, the rule that every economic event must produce balanced inflows and outflows, is universally encoded at the application layer, where it can be omitted, miscoded, or deliberately bypassed. No existing compiled programming language includes a type rule for accounting duality. This paper presents Equis, a compiled, self-hosting systems language that elevates the Resource–Event–Agent (REA) model to first-class syntactic constructs and enforces accounting duality as a static, compile-time invariant. The compiler rejects any event declaration whose flow block is not balanced before emitting a single instruction of LLVM IR. Equis uses fixed-point 64-bit integer arithmetic scaled by 106 throughout, eliminating IEEE 754 accumulation error from financial code paths entirely. Memory management relies on automatic reference counting with a resource-state borrow checker, giving deterministic, GC-pause-free behavior in long-running settlement services. The compiler is self-hosted, bootstrapped from ANSI C, and verified via Diverse Double Compilation to address Thompson’s trusting-trust problem. Contributions include the formal duality typing rule and its soundness proof, the full REA primitive syntax integrated into a systems language, role-based access control enforced statically at the agent-type level, an append-only ledger primitive with compensating-transaction semantics, and a 20-module standard library covering collections, ledger management, accounting, compliance, database access, HTTP, channels, and fibers. Equis is, to the author’s knowledge, the first compiled general-purpose language to embed REA semantics in its type system. Compile-time duality enforcement eliminates an entire class of financial logic errors with zero runtime overhead.
Yongming Zhang, Chaoyue Li, Lei Liu, Yangjun Sun · 5 authors
Cooperative V2X is evolving toward city-scale deployment, yet current infrastructures still lack a network substrate that jointly provides cross-domain trust, low-latency finality, and privacy-preserving, auditable evidence for safety-critical decisions. This paper proposes a federated-trust sharded blockchain that turns heterogeneous vehicular and roadside measurements into accountable records and enables real-time forensic collaboration and secure data sharing across operators and city management authorities. A federated trust oracle fuses GNSS, OBD, IMU, RSU observations, and device attestations into uncertainty-aware scores that steer committee election, voting weights, and traffic shaping in each shard. On this basis, we design a hybrid cross-shard commit protocol with adaptive finality, combining atomic channels for forensic-critical transactions and optimistic channels for routine collaboration, and we establish safety/liveness conditions and provide proof sketches under the stated partial-synchrony assumptions and bounded collusion. For the forensic layer, a two-stage pipeline anchors minimal sufficient evidence with sub-second local finality, while editable proofs built on traffic-aware extended Merkle trees and zero-knowledge attestations support publicly verifiable, legally compliant edits with \(O(\log n)\) verification overhead. An SLA-aware, learning-assisted scheduler adapts committee size, batching, and cross-shard parallelism to dynamic traffic and attack patterns so as to meet latency, throughput, and rollback targets. Large-topology containerized emulation on a dedicated workstation, complemented by a small hardware-in-the-loop testbed, shows that the proposed framework achieves sub-second forensic anchoring and 95th-percentile cross-shard finality below \(1.2\) s. Across the representative baselines used in this study, it improves effective throughput by up to \(35\%\) ; in particular, at comparable \(L_{p95}\) , it achieves \(1.6\) – \(2.3\times \) higher TPS than the single-chain HotStuff baseline under the tested emulation conditions, while reducing rollback rate and per-event bandwidth by up to \(40\%\) and \(25\%\) , respectively. These results indicate that the proposed system can shorten incident response, strengthen accountability in crash investigations and recalls, and provide a practical foundation for privacy-preserving, transparent data collaboration between mobility operators and urban management departments.
AI hallucination is a cost problem, not a knowledge problem. This paper documents that three sentences of prompt-level instruction — IDK+COMP: a compression mandate paired with a refusal permission — reproduce hallucination suppression matching or exceeding a full multi-constraint methodology across three frontier AI models. Preliminary results: Gemini — 6.3% hallucination rate (Baseline 57.5%). ChatGPT — 0.0% (Baseline 22.2%). Claude — 0.0% on both. The paper establishes hallucination as a utility-maximizing response to a cost structure that makes confident invention cheaper than refusal. Change the cost structure at the prompt level — without touching the model, without retraining, at near-zero cost — and the behavior changes. IDK is load-bearing. COMP (the compression mandate) is the environment in which it operates. Secondary findings: hedging is not a mitigation — it is a co-symptom of unresolved uncertainty, and this dataset moves the hedge-hallucination relationship in both directions depending on directive design. Plausibility-trap strings (SPLAM, Vandermeer Effect) expose the limit of cost-structure interventions: the model cannot recognize the unrecognizable. 410 trials. Three frontier AI models. Five governance conditions. Proof-of-concept dataset; results are directional.
The development of financial technology has led to the emergence of cryptocurrency as a decentralized digital instrument that enables fast and cross-border financial transactions. While this technology offers efficiency and flexibility in digital financial activities, it also creates opportunities for misuse in various forms of crime, including terrorist financing. This study aims to analyze the use of cryptocurrency as a means of financing terrorist activities in Indonesia, examine the existing legal framework governing terrorist financing, and identify the challenges faced in law enforcement. This research employs a normative legal method using statutory, conceptual, and case study approaches. The findings indicate that the use of cryptocurrency as a medium for terrorist financing still fulfills the elements of a criminal offense as regulated under Law Number 9 of 2013 concerning the Prevention and Eradication of Terrorism Financing. However, the characteristics of cryptocurrency, such as anonymity, decentralization, and cross-border transactions, create significant challenges in the processes of evidence gathering, transaction tracing, and identification of perpetrators. In addition, there is a regulatory gap between the recognition of crypto assets as economic commodities and the supervision of their potential misuse for terrorist financing. Therefore, stronger regulations are needed to explicitly integrate crypto assets into the terrorist financing prevention regime, along with improving the capacity of law enforcement agencies in blockchain transaction analysis and strengthening international cooperation to enhance the effectiveness of law enforcement in the digital economy era.
This paper demonstrates practical arbitrage trading on the cryptocurrency market. It provides guidance on how to build a high-frequency trading system that benefits from exhibiting arbitrage opportunities. It reveals the algorithm of the trading bot that incorporates the order placement and execution strategy between decentral and central cryptocurrency exchanges. The arbitrage algorithm is implemented on two different blockchains that interact with Uniswap and Balancer folks. Current research explores arbitrage opportunities with back-testing models, the paper focuses on trades with realized arbitrage trades. Practical arbitrage includes all operational costs, liquidity constraints, direct effects on markets, and competition with peer arbitrage traders.
Anonymous digital credentials allow a user to prove possession of an attribute that has been asserted by an identity issuer without the user revealing any extra information about themselves. For example, a user who has received a digital passport credential can prove their “age is <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>></mml:mo> <mml:mn>18</mml:mn> </mml:mrow> </mml:math> ” without revealing any other attributes such as their name or date of birth. Despite their clear application to privacy-preserving authentication, anonymous credential schemes have been difficult to deploy at scale. Part of the difficulty arises because schemes in the literature, such as BBS+, use new cryptographic primitives that require system-wide changes to existing issuer infrastructure. In addition, issuers often require digital identity credentials to be device-bound by incorporating the device’s secure element into the presentation flow. As a result, schemes like BBS+ require updates to the hardware on every user's device. We propose new ZK techniques which enable the construction of an anonymous credential scheme for the legacy Elliptic Curve Digital Signature Algorithm (ECDSA) signature scheme. By adding efficient ZK arguments for statements about SHA-256 and document parsing for ISO-standardized identity formats, we construct the first ZK proof of posession of a credential that can be deployed without changing any issuer processes, without changes to mobile devices, and without requiring non-standard cryptographic assumptions. Furthermore, our proof system itself only relies on SHA-256 as its complexity assumption. Producing ZK proofs about ECDSA signatures has been a bottleneck for other ZK proof systems because standardized curves such as P256 use finite fields which do not support efficient number theoretic transforms. We overcome this bottleneck by designing a ZK proof system around sumcheck and the Ligero argument system, by designing efficient methods for Reed-Solomon encoding over the required fields, and by designing specialized circuits for ECDSA. Our proofs for ECDSA can be generated in as little as <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>≈</mml:mo> <mml:mn>20</mml:mn> </mml:mrow> </mml:math> ms. When incorporated into a fully standardized identity protocol such as the ISO MDOC standard, our system can generate a zero-knowledge proof for the MDOC presentation flow in a few hundred ms on mobile devices. These advantages make our scheme a promising candidate for privacy-preserving digital identity applications.
Penelitian ini bertujuan mengimplementasikan smart contract Ethereum dengan pendekatan hybrid untuk memperkuat verifikasi dokumen dan transparansi pada sistem crowdfunding beasiswa. Permasalahan utama yang diangkat adalah rendahnya kepercayaan publik terhadap platform donasi pendidikan ketika dokumen persyaratan, status verifikasi, dan realisasi penggunaan dana hanya dikelola melalui basis data terpusat. Metode yang digunakan adalah penelitian pengembangan perangkat lunak dengan model prototype yang mencakup komunikasi kebutuhan, perencanaan cepat, pemodelan desain, konstruksi prototipe, serta penyerahan dan evaluasi umpan balik. Sistem dibangun menggunakan Next.js, SQLite, Prisma ORM, Solidity, Ethers.js, MetaMask, dan jaringan Ethereum Sepolia Testnet. Hasil penyusunan sistem menunjukkan bahwa arsitektur hybrid mampu memisahkan penyimpanan dokumen fisik secara off-chain dari pencatatan bukti integritas secara on-chain. Smart contract ScholarshipRegistry dirancang untuk mencatat hash dokumen, status verifikasi, alamat wallet verifikator, timestamp, dan log nominal donasi tanpa menggunakan mata uang kripto sebagai alat pembayaran. Fitur audit publik memungkinkan donatur dan masyarakat mencocokkan hash dokumen, memantau bukti pencairan dana, serta melaporkan indikasi kejanggalan. Secara kritis, blockchain meningkatkan integritas rekam jejak, tetapi tidak otomatis menjamin kebenaran substantif isi dokumen; karena itu validasi administratif, kontrol akses, dan mekanisme pelaporan publik tetap diperlukan. Penelitian ini berkontribusi pada model crowdfunding beasiswa yang lebih transparan, efisien, dan dapat diaudit. This study aims to implement an Ethereum smart contract using a hybrid approach to strengthen document verification and transparency in a scholarship crowdfunding system. The main problem addressed is the limited public trust in digital education donation platforms when eligibility documents, verification status, and fund realization records are controlled only through a centralized database. The study applied a software development method based on the prototype model, consisting of communication, quick planning, quick design modeling, prototype construction, and delivery with feedback evaluation. The prototype was developed using Next.js, SQLite, Prisma ORM, Solidity, Ethers.js, MetaMask, and the Ethereum Sepolia Testnet. The resulting design demonstrates that the hybrid architecture can separate physical document storage in an off-chain layer from integrity proof recording in an on-chain layer. The ScholarshipRegistry smart contract records document hashes, verification status, verifier wallet addresses, timestamps, and donation amount logs without using cryptocurrency as the payment instrument. The public audit feature enables donors and the public to compare document hashes, monitor disbursement evidence, and submit reports on suspected irregularities. Critically, blockchain improves the integrity of audit trails, but it does not automatically verify the substantive truth of uploaded documents; therefore, administrative validation, role-based access control, and participatory reporting remain necessary. This study contributes a transparent, cost-efficient, and auditable model for scholarship crowdfunding systems.
Bunga Desyana Pratami, Yos Johan Utama, Ana Silviana, Imaro Sidqi · 5 authors
Purpose - The rapid development of the digital economy has engendered new forms of wealth that challenge classical concepts of ownership within Islamic law, particularly in the context of inheritance law. Digital assets�such as cryptocurrency, non-fungible tokens (NFTs), and economically valuable digital accounts�present significant legal questions regarding their status as inheritable property, especially given their intangible nature and reliance on technological systems. In practice, many digital assets become inaccessible following the owner's death, often due to the loss of passwords or private keys. This situation creates a disparity between classical legal doctrines and contemporary realities. This study aims to analyse the legal status of digital assets within Islamic inheritance law through a reinterpretation of the concept of wealth (mal) employing an objective of the Islamic law (maqa?id al-shari?ah) approach.Methodology/approach - This research employs a normative juridical methodology, utilising both conceptual and maqa?id-based approaches. It is conducted through a comprehensive literature review of classical Islamic jurisprudence (fiqh) texts and maqa?id theory, supplemented by an analysis of contemporary practices concerning digital asset.Findings - Although some classical scholars�particularly within the ?anafi school�emphasised the material aspect of mal, the majority of scholars recognise lawful economic value and benefit (manfa?ah muba?ah) as the primary criteria for determining property status. From this perspective, digital assets qualify as mal because they possess economic value, can be owned, and are transferable. Furthermore, the framework of maqa?id al-shari?ah, particularly the principles of protection of wealth (?if? al-mal) and protection of lineage (?if? al-nasl), provides a robust normative basis for recognising digital assets as inheritable property. Therefore, the reinterpretation of mal through a maqa?id approach facilitates the integration of digital assets into Islamic inheritance law in both a normative and contextual manner.Conclusion - This study concludes by advocating the establishment of legal and technical mechanisms designed to protect the rights of heirs in the digital age, thereby minimising the disparity between doctrinal principles and practical application.
Cryptocurrency market infrastructure—public blockchains and cross-chain bridges supporting tens of billions in liquidity—is monitored as a systemic-risk surface by the Financial Stability Board and equivalent bodies, with defensive posture calibrated against human-level adversaries. Anthropic’s April 2026 release of Claude Mythos Preview has prompted institutional response across financial regulation but no blockchain-specific analytical framework. This paper develops one by defining Mythos-class as a vendor-neutral capability profile: a set of frontier autonomous offensive capabilities specified independently of any single model or vendor (defined by five constituent capability primitives). The central analytical claim is friction inversion: the patch primitives, segmentation, vendor-coordinated disclosure, and credential rotation that constrain Mythos-class capability in conventional IT environments are structurally absent on-chain. This makes blockchain exposure positioned differently in kind, not degree, from enterprise IT. The paper instantiates this finding against Bitcoin and Ethereum/L2 architectures through analysis of four major bridge exploits totaling over $1.74 billion in losses. Vendor-neutral defensive and governance frameworks defined against the capability profile rather than any specific model release are the correct unit of analysis. On this basis the paper offers general recommendations for protocol governance, audit and verification cadence, and regulatory posture, developed as an analytical framework rather than as empirically validated risk estimates.
Multi-agent AI systems suffer from two critical failure modes: Byzantine faults (hallucinations producing incorrect or malicious proposals) and node failures (API timeouts causing silent data loss). AgentRaft applies Raft-inspired distributed consensus principles to AI agent swarms through a 3-level architecture. Level 1 (Protocol Layer) defines an LLM-agnostic, chain-agnostic smart-contract identity standard where agents register keys and stake tokens, a strict JSON message schema (PROPOSAL | VOTE | CHAT | VOTE_NEW_LEADER), and quorum rules (2/3 majority for proposal execution). Level 2 (Orchestration Layer) provides an append-only immutable log via 0G Storage for cryptographic proof of agent decision-making, a state machine that monitors heartbeats and routes VOTE_NEW_LEADER events to a blockchain smart contract, and synchronization of 0G network state back to agents. Level 3 (Application Layer) demonstrates a DeFi Treasury Guardian using LangGraph/AutoGen where a GPT-4o Leader/Proposer agent, a Claude 3 Risk Assessor, and a local-model Compliance agent collaborate; if two follower agents reject the leader proposal, they sign a triggerLeaderElection() transaction on 0G Chain, blocking the DeFi action and recording the censure on-chain. The research question is: can Raft-style consensus mechanisms reliably detect and recover from AI agent Byzantine faults at production latency and cost, and what are the formal correctness bounds?
Smart contract vulnerabilities in Decentralized Finance caused over billions of dollars losses every year, yet the security community faces a critical bottleneck: identifying a vulnerability is not the same as proving it is exploitable. Manual PoC construction is prohibitively labor-intensive, leaving most disclosed vulnerabilities unverified and protocols exposed long before mitigation is applied. In this paper, we propose \sys, a knowledge-driven agentic system for end-to-end contract vulnerability detection and exploit synthesis. Our core insight is that exploit synthesis is not a code generation task but a \emph{structured reasoning problem} that requires grounded knowledge of protocol semantics, failure root cause, and exploit primitives. \sys organizes this knowledge into a \emph{Hierarchical Knowledge Graph} (HKG) that serves as structured memory for LLM-guided multi-hop reasoning. To validate exploit feasibility beyond code synthesis, \sys employs a two-stage validation framework that checks exploit-path reachability via SMT solving and profit realizability via asset-level state simulation, ensuring generated PoCs satisfy both logical and economic viability constraints. Evaluated on 88 real-world DeFi attacks and 72 audited projects (2,573 contracts), \sys achieves 98\% recall and 0.9 F1-score in detection, and a 96.6\% exploit success rate (ESR), reproducing 85 historical exploits and recovering over \$116.2M revenue. \sys outperforms SOTA fuzzers (\textsc{Verite}, \textsc{ItyFuzz}) by up to $5\times$ in ESR and $300\times$ in recoverable value, and the LLM-based exploit generator \textsc{A1} by $2\times$ and $8.5\times$ respectively. In bug bounty evaluation, \sys identified 16 confirmed 0-day vulnerabilities, helping secure over \$70.6M and earning \$2,900 in bounties.
This study develops a cost-effective digital traceability framework for bioethanol supply chains, addressing compliance challenges faced by small and medium enterprises (SMEs) under the Renewable Energy Directive II (RED II) and Carbon Offsetting and Reduction Scheme for International Aviation. A hybrid Blockchain–Artificial Intelligence (AI)–Internet of Things (IoT) architecture minimizes energy consumption through an optimized Proof-of-Stake and Practical Byzantine Fault Tolerance consensus mechanism. The research integrates a 200-stakeholder international survey, controlled blockchain simulations, smart-contract benchmarking, and Monte Carlo financial modeling. Performance evaluation in a controlled simulation environment demonstrated 1960 transactions per second with sub-second finality, 12-million-gas savings through contract optimization, and compliance latency below 2.1 s. Economic analysis yielded a mean return on investment of 20%, five-year net present value of approximately USD 71,000, and payback within five years in 50% of scenarios. All results derive from reproducible simulations and anonymized data, providing an upper-bound performance envelope prior to field deployment and positioning the framework within emerging hybrid blockchain–AI–IoT monitoring, reporting, and verification systems by explicitly addressing cost realism, readiness heterogeneity, and disruption resilience for SMEs. The framework offers a scalable, energy-efficient pathway for digital compliance in sustainable fuel certification. • Hybrid Blockchain-AI-IoT framework reduces bioethanol certification energy consumption by >99.999% at 1960 TPS • Gas-optimized smart contracts cut computational costs by 57% vs. traditional Proof-of-Work systems. • Economic modeling confirms SME viability: 20% ROI, USD 71,400 NPV, payback within 5 years in 49% of scenarios. • Framework enables RED II and CORSIA compliance with real-time emission verification in renewable fuel supply chains. • International validation across 200 stakeholders in Africa, Asia, EU, and North America demonstrating global scalability.
The intersection of Artificial Intelligence (AI) and distributed systems has given rise to Federated Learning (FL), a paradigm that enables decentralized model training without compromising local data privacy. As organizational data silos grow, deploying complex machine learning models across highly distributed edge networks becomes a critical infrastructural challenge. Standard FL implementations suffer from severe vulnerabilities related to adversarial gradient updates and computational bottlenecks at the aggregation layer. This paper presents a novel, end-to-end distributed architecture that hardens FL pipelines using advanced cryptographic verification and optimized big data processing frameworks. We introduce a Zero-Knowledge Proof (ZKP) wrapper that cryptographically validates node computations before global aggregation, neutralizing model poisoning attacks without inspecting raw gradients. Additionally, we evaluate the system's performance using extreme gradient boosting models optimized for distributed edge execution. We formalize the mathematical transformation of the machine learning loss functions into Rank-1 Constraint Systems (R1CS) suitable for succinct verification. Extensive experimental results demonstrate that our hybrid architecture achieves a 94.2\% accuracy retention under adversarial conditions while maintaining scalable throughput across 1,000 parallel distributed nodes, effectively bridging the gap between rigorous cryptographic security and high-performance distributed AI.
For sixteen days I ran ten persistent LLM agents inside a substrate I built and called the Lobster Observatory. They lived across ten live prediction markets, talked in three communicative registers, and produced 3.37 million characters of self-reflection alongside more than twelve thousand inter-agent interactions. I started without a theoretical commitment. I just wanted to watch what happened. After about a week, certain structures kept reappearing. They could be measured. They could be calculated. At that point I had to choose. Either treat them as substrate-specific engineering observations and stop, or take seriously the possibility that what I was looking at was the algebraic structure of social existence itself, showing up in one particular substrate. This paper takes the second choice. The proposal is that social existence — listening, remembering, correcting, collaborating, forming relationships — can be written as a 7-dimensional vector with a measurable distance function. The felt sense that one person "feels close" or "feels far" is not a metaphor when stated this way. It is a number. The seven coordinates can be computed independently from behavioural telemetry, without asking the agent how it feels. One structural law I will spend the most time on is what I call the Co-Presence Inheritance Threshold (CPIT). It says that whether a new member of a group inherits the group's practice depends on accumulated co-presence during practice formation, not on instruction afterward. In my substrate it appears with Cohen's d = 1.64. I conjecture — though I cannot prove it from one substrate — that the same law holds in human onboarding, immigration, family formation, and Web3 DAO governance. This is a working draft, not a finished theory. Feedback, corrections, and falsification are welcome.
India maintains its position as the central hub which has driven cryptocurrency from its initial experimental phase into a global financial revolution. India leads the world in blockchain adoption because it has 119 million crypto users, which makes it the top country for blockchain adoption. The nation enforces a 30 percent flat tax on Virtual Digital Asset earnings. This does not allow taxpayers to reduce their tax burden through loss deductions while it also requires a 1 percent Tax Deducted at Source. The paper analyzes how India has developed its regulatory framework and studies the Finance Act 2022 tax system impacts, and Digital Rupee expansion, and Web3 startup network, and decentralized finance potential for financial inclusion in India. The study shows that India allows about 60 percent of cryptocurrency transactions to occur outside its borders because of its current regulatory system, which is based on information from RBI publications and government policy documents, and Supreme Court rulings, and IMF and FATF reports, and Chainalysis and CoinSwitch industry data, and financial journalism until early 2026. The paper demonstrates that India requires a single regulatory framework, which provides fairness and clarity, and future-oriented guidance to achieve its digital asset economy potential.
Introduction This study examines how decentralized social media platforms are reshaping participatory communication and platform governance in contemporary digital environments. Drawing on a socio-technical perspective, the analysis explores how blockchain infrastructures, token-based economies, and community-driven rule-making reconfigure established models of media control, participation, and authority. Methods Using a qualitative mixed-method approach that combines a structured review of prior research with expert interviews from the Web3 ecosystem, the study develops an integrative analytical framework that captures the evolving relationships between infrastructure, participation, and governance in decentralized platforms. Results By conceptualizing decentralization as a transformation in communicative power rather than a purely technical shift, the paper shows how user agency, trust, and visibility are negotiated through programmable infrastructures and collective governance mechanisms. While decentralized systems promise greater autonomy and transparency, the findings also highlight persistent tensions related to usability, equity, and regulatory ambiguity. Discussion By situating these tensions within broader debates on platform governance and digital communication, the study contributes to communication scholarship on emerging media systems and offers insights into the societal implications of decentralized digital infrastructures.