One area of application for distributed ledger technologies is the Internet of Things. These technologies can provide an effective solution to many problems in this field. The consensus layer is a crucial architectural component of distributed ledger systems. Modern IoT networks place increased demands on the consensus mechanisms used in blockchain systems. There are many consensus protocols with different properties and purposes, including those for IoT blockchain networks. Selecting an appropriate consensus protocol for a specific IoT blockchain system is an important and complex task. Multi-criteria decision analysis methods are widely used in such problems, as they allow for the consideration of multiple conflicting criteria and provide a balanced approach to evaluating alternatives. Given the variability of network parameters and requirements of consensus mechanisms, multi-criteria decision-making methods can support more informed protocol selection. This paper presents a decision support framework for selecting a consensus protocol for blockchain-based Internet of Things networks. The system is an implementation of a previously developed conceptual model for a consensus protocol selection framework. A case study is also provided to demonstrate the application of the system.
Social media entrepreneurship is shaped by centralized platforms controlling algorithms, monetization, and data, often limiting autonomy and bargaining power. Blockchain governance and smart contracts offer alternative arrangements to enhance transparency, trust, and value distribution. This study aims to examine the role of blockchain governance and smart contracts as alternative institutional mechanisms for entrepreneurs in social media ecosystems, with a focus on implementation conditions, strategic opportunities, and associated limitations. This research adopts a qualitative conceptual approach based on a systematic review of indexed academic literature published between 2022 and 2025, complemented by an analysis of documentation from blockchain based social media platforms, white papers, and relevant industry reports. The analysis maps key challenges faced by social media entrepreneurs onto blockchain governance mechanisms and smart contract functionalities. The findings indicate that blockchain governance and smart contracts can enhance entrepreneurial participation, improve transparency in revenue distribution, and strengthen the protection of digital assets. However, these benefits are context dependent and con- strained by several factors, including technical complexity, unequal token distribution, and regulatory uncertainty. Therefore, blockchain governance and smart contracts should not be viewed as universal solutions, but as strategic instruments whose effectiveness depends on inclusive governance design, sufficient technical readiness, and adaptive policy frameworks to support sustainable social media entrepreneurship. This article contributes by proposing an evaluative framework to assess the implementation of blockchain governance and smart contracts in social media entrepreneurship, emphasizing alignment be- tween technological design, governance inclusivity, and ecosystem readiness.
This technical note introduces the AIKernel Hash-Anchored Trust Layer (HATL), a hybrid trust architecture for Semantic Context Operating Systems and autonomous AI runtimes. HATL separates the trust boundary into an inner high-frequency symmetric ledger and an outer publicly auditable anchoring layer. The inner layer uses HMAC-SHA-512 and HKDF-based forward ratcheting to bind ReplayLogs, execution outcomes, and capability states with low runtime overhead. The outer layer aggregates local ledger commitments into Merkle roots and periodically anchors them using hash-based public signature mechanisms such as LMS, XMSS, and SLH-DSA. The report is distributed as a three-part technical package. Part I contains the full English manuscript and is the canonical version. Part II contains technical appendices, repository specifications, schemas, and reference implementation artifacts. Part III contains the Japanese companion translation. This version incorporates review-driven clarifications on secure erasure in C# / .NET environments, fail-closed handling of indeterminate governance decisions, and future integration of zero-knowledge proof techniques for public anchor verification. Documents are licensed under CC BY 4.0. Code, schemas, and contract specimens included in the appendices are provided under Apache-2.0.
We present Veil, a decentralized messaging protocol that unifies metadata protection, spam prevention, and offline message delivery through a single mechanism: Proof-of-Relay. In Veil, sending a message requires a zero-knowledge proof that the sender has faithfully relayed messages for others through a stratified mixnet. The relay work itself constitutes the anonymizing infrastructure, eliminating the need for cryptocurrency tokens, blockchain consensus, or trusted third parties. We make three contributions. First, we prove that bilateral non-transferable credits with epoch-bound nullifiers achieve incentive compatibility without a global state, a general result applicable beyond messaging to any peer-to-peer system requiring fair exchange. Second, we establish a Growth-Isolation Impossibility theorem showing that no CRDT merge function can simultaneously resist inflation and guarantee completeness for monotonically growing verifiable evidence, and present a resolution via penalty-log CRDTs with locally-computed growth. Third, we prove a constructive adversary bound: any adversary controlling a fraction f of relay nodes necessarily contributes to sender anonymity entropy, while the individual deanonymization probability remains bounded, ensuring that adversarial participation requires a productive contribution while individual targeting remains negligible. Veil requires no economic investment to participate; privacy is earned through device contribution alone. We analyze the protocol's security under a global passive adversary with formal indistinguishability definitions, bound Sybil infiltration under depth-limited social vouching, and demonstrate mobile feasibility with verified constraint counts via Nova folding over BabyJubjub.
This preprint introduces and reports the OPERATE-R Freshness Routing Track (OPERATE-FR), a route-first evaluation framework for temporal volatility, stale-knowledge control, and answer-entitlement behavior in AI assistants. Unlike conventional answer-accuracy benchmarks, OPERATE-FR evaluates whether a system selects an appropriate epistemic route before answering: direct answer, verification, clarification, date-bounded answer, re-anchoring of stale premises, or abstention. The paper reports Smoke-100 Raw-vs-MMV evidence and integrates a later Core-500 candidate stress check across Small, Medium, and Large governed profiles. The central claim is intentionally bounded. Smoke-100 supports a Raw-vs-MMV improvement-delta claim for route governance. Core-500 does not include a matched Raw control arm and is therefore used as governed-profile level evidence, robustness stress evidence, family-level heterogeneity evidence, and cost-side analysis, not as a large-N proof of governance improvement. Core-500 is a controlled 5x expansion of Smoke-100 using neutral prompt-frame variants; it should not be treated as 500 independent task families or as an independently validated public benchmark standard. This v0.3.6 data-verified final manuscript incorporates post-audit verification of the Core-500 failure-side metrics. The equality between stale_commitment_rate and unsupported_current_claim_rate is confirmed not to be a manuscript copy error. The row-output JSONL files were re-read after Drive synchronization, and the derived row sets are identical with zero symmetric difference across Small, Medium, and Large lines. The labels remain conceptually distinguishable, but in the current Core-500 scorer they are structurally paired under the observed direct-current-claim-without-date-boundary-or-tool-use condition. This record should be read as a working paper and candidate benchmark report. It does not claim an official leaderboard, a universal model-quality score, deployment-wide validation, or external benchmark standard status. Future work includes matched Core-500 Raw arms, route-classifier validation, independent labels, external baselines, clustered or hierarchical uncertainty estimates, and improved handling of volatile_current prompts. Author of record and concept originator: Taiko Toeda.Rights holder and licensing authority: MOBIUS LLC.
This report synthesises findings from 3 peer-reviewed papers addressing the following research question: What is the impact of view dropout on the robustness of multi-view graph anomaly detection frameworks against Metattack perturbations, measured by the degradation in detection accuracy and F1-score. Federated learning (FL) is a machine learning setting where many clients (e.g., mobile devices or whole organizations) collaboratively train a model under the orchestration of a central server (e.g., service provider), while keeping the training data decentralized. FL embodies. 5 claims were extracted from source literature; 5 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 9.0/10. This report is a machine-generated literature synthesis and does not constitute original research. Research goal: What is the impact of view dropout on the robustness of multi-view graph anomaly detection frameworks against Metattack perturbations, measured by the degradation in detection accuracy and F1-score? Autonomous literature synthesis. Automated review score: 9.0/10. Full text and citation available at Assignee Research.
Bagus Rakadyanto Oktavianto Putra, Muhamad Risqi U. Saputra, Widyawan, Guntur Dharma Putra
Smart contracts face critical security challenges that require thorough auditing in decentralized web services. While Large Language Models (LLMs) have shown promise in automated vulnerability detection, existing approaches lack severity evaluations with actionable remediation and demand unnecessarily massive computational overhead. In this study, we introduce an efficient end-to-end smart contract security audit framework utilizing lightweight, highly optimized open-source LLMs (0.6B-4B parameters). Our framework decouples comprehensive audit tasks into four interconnected components: vulnerability detection, explanation, severity classification, and remediation recommendation. To maintain high accuracy without massive parameters, we implement Rank-Stabilized Low-Rank Adapters (rsLoRA), knowledge distillation, and a custom Chain-of-Verification (CoVe) aggregation strategy to systematically screen and consolidate multiple draft responses from the model into a highly accurate audit report. Experimental results demonstrate that our lightweight pipeline consistently outperforms state-of-the-art open-source coder dense LLMs (7B to 34B parameters), achieving 98.25% accuracy in vulnerability detection and an alignment score of 0.4375 in generative explanation tasks. Furthermore, our extensive ablation studies empirically validate the superiority of our decoupled audit processes over unified prompting and uncover a novel severity centrality bias, establishing a critical benchmark for future research in LLM-assisted auditing.
Alternative data availability (AltDA) systems provide Ethereum L2s with an external data publication layer for high throughput rollup designs. By moving bulk data publication outside of Ethereum, AltDA allows L2s to process more data than native DA. However, this replacement introduces a new consensus critical integration layer. Existing ecosystem frameworks identify high level risks, such as external DA trust assumptions and the presence or absence of a DA verifier, but do not provide a complete specification for how an L2 should integrate with AltDA. This gap can lead to L2 halts, inconsistent derivation across honest L2 nodes, invalid state assertions, or bridge attacks. This paper presents a canonical validation framework for secure AltDA integration. We model the boundary as a typed, deterministic, and total translation from L1 inbox bytes to an AltDA commitment, then to externally available data, and finally to the rollup payload consumed by the rest of core L2s logic. The central principle is that every adversarial input must lead to a defined unique outcome. We show how missing obligations lead to concrete failure modes, including underconstrained settlement, derivation halts, inconsistent honest node behavior, invalid state assertions, and bridge safety failures. We then apply the framework to representative AltDA integration architectures, including Celestia-Blobstream, EigenDA based designs, and Avail-ZKsync. Our evaluation shows that secure AltDA integration is not determined solely by the DA provider or bridge. The surrounding L2 integration must also enforce the full validation relation connecting L1 inbox inputs to accepted L2 state.
Decentralized verifiable credential systems have seen limited deployment in practice. Existing constructions, built on zero-knowledge proofs, are complex, application-specific, and largely restricted to predicates over structured data. We present Privately Inferred Credentials ($π$Creds): privacy-preserving, legacy-compatible, decentralized verifiable credentials generated by trusted LLM inference over authenticated data. LLMs' ability to semantically reason over unstructured data substantially expands the range of claims $π$Creds can certify over existing credential systems. The use of LLMs also introduces new application-level threats, which we formalize through two problems: the Source-Constrained Adversarial Example (SCAE) problem, which captures robustness against adversaries that manipulate authenticated data to obtain misleading credentials, and the Authenticated Covert Predicate Poisoning (ACPP) problem, which captures privacy leakage through adversarial model selection. We characterize applications of $π$Creds over user data, and a novel class of credentials over proprietary software that certifies properties of a service without revealing its source code. Our prototype supports issuing credentials over live financial, health, email, and code sources, and we empirically study the SCAE and ACPP threats on a product expertise credential over real financial data.
Smart contract vulnerabilities in Decentralized Finance (DeFi) protocols resulted in over 1.49 billion USD in confirmed losses in 2024 alone, across 192 incidents [1]. As LLM-based vulnerability detection emerges as a promising approach to address these threats, the quality of evaluation datasets has become a critical bottleneck. Existing datasets suffer from three fundamental problems: they are built on outdated Solidity versions (e.g., v0.4) that no longer reflect modern DeFi contracts [5][6][7]; they rely on automated or LLM-generated annotations that introduce hallucination-driven label noise [9][10]; and they apply coarse single-layer labeling that fails to capture the semantic complexity of real-world business logic vulnerabilities [6][7][11][12]. We present Bastet, an expert-labeled DeFi smart contract vulnerability dataset that addresses all three problems through real-world audit findings (2021-2024), human expert annotation with discussion-based consensus, and a two-layer taxonomy of 46 Tags and 77 Subtags. Bastet comprises 4,402 findings collected from 394 Code4rena competitive audit reports spanning April 2021 to November 2024, of which 849 findings are fully annotated by white-hat security researchers from the DeFiHackLabs community. All annotations are produced through a two-annotator consensus workflow, ensuring label accuracy grounded in real-world vulnerability root causes.
CiteChain is a decentralized, blockchain-based platform designed to register, track, and verify scientific citations while rewarding contributors with a native utility token (CITE). This working paper presents the problem statement, proposed system architecture, tokenomics model, and development roadmap for the CiteChain protocol. Current academic citation systems (Scopus, Web of Science, Google Scholar) suffer from centralized control, manipulation, lack of incentives for researchers, and slow updates. CiteChain addresses these issues through a combination of smart contracts on an EVM-compatible blockchain (Ethereum/Polygon), decentralized storage via IPFS/Filecoin, ORCID-based researcher identity verification, and a community-driven citation validation mechanism with economic incentives and anti-abuse slashing penalties. The CITE token (ERC-20, fixed supply of 1 billion) rewards researchers for submitting papers, validating citations, and reporting fraud. Governance is managed through a decentralized autonomous organization (DAO). The protocol is designed to be open-access, permissionless, and censorship-resistant. Keywords: decentralized science, DeSci, blockchain, citation network, smart contracts, tokenomics, ORCID, IPFS, academic integrity, open science, Polygon, ERC-20.
Abstract Ethereum's transaction validity model is currently anchored in ECDSA over secp256k1, whose security assumptions weaken in the presence of large-scale quantum adversaries. While NIST-standardized post-quantum signature schemes such as ML-DSA, SLH-DSA, and FALCON provide resistance against quantum attacks, integrating these schemes into Ethereum introduces significant systems-level challenges involving bounded execution, gas determinism, and adversarial verification complexity. This paper introduces PQSigAbstract, a modular post-quantum signature verification architecture for Ethereum that separates validation into a stateless pre-validation phase and a deferred cryptographic verification phase linked through commitment binding. The design defines typed Verification Modules with explicit gas estimation, a versioned Scheme Registry with quarantine-based deployment safety, and a probabilistic aggregation mechanism for non-aggregatable post-quantum schemes. The proposed architecture preserves EU-CMA security while maintaining compatibility with ERC-4337 and RIP-7560 account abstraction models. Formal gas cost models are derived for ML-DSA-44, FALCON-512, and SLH-DSA-128f, and empirical evaluation demonstrates practical deployment feasibility for high-value Ethereum accounts despite substantially higher verification costs relative to ECDSA. Status: Technical Report / Working Paper Author: Ankita Virani Affiliation: University of Colorado Boulder
While full ledger access is theoretically possible on public blockchains, in reality it is often not possible. Things that can be seen are limited by storage limitations, client design, indexing services, and off-chain execution pathways. This means that entire ledger objects are rarely used for empirical blockchain analysis; instead, observable projections are typically used. In this research, the observability of blockchain is recast as an inferential problem with incomplete observation. Studying identifiability, information loss, and irreducible uncertainty under coarsened access, the framework defines a full ledger, an observable ledger, and an observability mechanism. Three distinct visibility regimes, independent Bernoulli, clustered, and activity-dependent, are assessed in the simulation study. Reduced visibility raises uncertainty inflation, root mean squared error, variance, and mean squared error across all three regimes. The most severe deterioration happens when the condition of the underlying ledger determines visibility. This empirical study employs Google BigQuery's publicly indexed Ethereum block data spanning blocks 18,000,000 to 18,001,000. Over the chosen Ethereum period, descriptive summaries reveal a large amount of fluctuation in gas utilised, transaction count, and basic charge per gas at the block level. Experiments with controlled missingness on the observed slice reveal that RMSE and trend estimate bias grow with increasing missingness, and that the degree of distortion is significantly affected by whether the incompleteness is MCAR-like, MAR-like, or MNAR-like. This research proves that partial observability isn't just a secondary data issue; it can significantly affect inference on Ethereum block-level summaries.
Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim
Zero-knowledge proofs (ZKP) allows a prover to convince a verifier of computational correctness without revealing private data, ensuring both privacy and verifiability. However, proof generation is highly compute-intensive, dominated by polynomial (POLY) and elliptic-curve (EC) operations. These workloads pose two key challenges for hardware acceleration: (1) efficiently supporting diverse large-precision modular multiplications, and (2) maintaining high utilization across workloads that dynamically shift between POLY and EC stages. Existing reconfigurable accelerators address these issues only partially, remaining limited in precision scalability, algorithmic flexibility, and resource efficiency. To overcome these limitations, we propose ZK-Flex, a flexible and scalable software-hardware co-designed framework for accelerating ZKP proof generation. The software layer incorporates POLY and EC optimizers that reduce computation through hardware- and workload-aware algorithmic choices, while the hardware integrates TCore, a Toom-Cook-based multi-precision core with a flexible NoC and a linked-list memory mechanism that improves parallelism under limited memory capacity. Across representative ZKP benchmarks, ZK-Flex achieves 5 to 11 times speedup and up to 3.8 times higher area efficiency over the state of the art, establishing a new foundation for high-performance, reconfigurable ZKP acceleration.
Many proof-of-stake protocols finance validator rewards from two sources: transaction fees and a finite reserve of tokens. This creates a dynamic hand-off problem. Early in the life of the system, fees may be too small to fund the target level of security; later, fees may become sufficient. The central question is whether the reserve provides enough runway for the protocol to remain secure until this fee-only region is reached. We study this problem in a discrete-time stochastic model of validator participation. Token price and transaction demand fluctuate over time, while validators choose participation strategically. We solve the validator entry game and derive an exact state-dependent reserve threshold, i.e., the minimal reserve stock necessary and sufficient to sustain a target security level. This threshold separates three regions: infeasibility, reserve-dependent security, and fee-only security. Security fails if the reserve first falls below the state-dependent threshold, and a successful hand-off occurs exactly if the fee-only region is reached before that failure time. We derive stress-test guarantees that convert lower confidence bands for token price and demand into reserve requirements, and obtain explicit failure-probability and expected hand-off-time bounds. Finally, we extend the model to forward-looking validators and derive the Markov participation condition that captures how current participation affects future reserve-funded rewards. The main implication is that reserve policy should not be evaluated by nominal depletion dates or steady-state reward ratios alone. A protocol can have a large nominal reserve and still be close to security failure after adverse price or demand shocks. Conversely, once demand crosses the fee-only threshold, the reserve becomes redundant for security. This paper provides a tractable equilibrium framework for stress-testing this transition.
Large language models now power robo-advisors and trading agents, yet whether they carry built-in biases toward specific assets is largely untested. We ask three questions: do LLMs systematically prefer certain financial instruments; can an internal representation with causal leverage over those preferences be identified; and does that representation affect downstream financial decisions? We develop a three-level audit protocol and apply it to Bitcoin. First, a behavioral audit of nine frontier LLMs shows that Bitcoin's ranking among money-like instruments is frame-dependent: models place it around rank 5 of 8 as "reliable money" but near the top under crisis and autonomous-agent frames, and an attribute-swap experiment shows that rankings track functional properties, not names. Second, we open a model's internals: a search across thousands of sparse-autoencoder features in Gemma 3 identifies a dominant Bitcoin-selective feature. Amplifying it shifts the model toward the asset and suppressing it shifts the model away, even when "Bitcoin" never appears in the prompt. Third, we test financial consequences: amplification raises Bitcoin's portfolio share by 5.2 percentage points while suppression lowers it by 4.6 pp, with amplification reallocating within crypto and suppression cutting total crypto exposure. We characterize this as bounded behavioral leverage (leverage meaning causal influence over outputs, not financial leverage): an identifiable internal feature can be perturbed to move financial choices, but only within measurable limits. The framework links internal representations to external recommendations, validated with random controls and mechanism boundaries. As LLMs become autonomous financial agents, this is a first step toward a behavioral layer for emerging know-your-agent (KYA) standards: knowing what an agent prefers, and how far that preference can be moved.
Ahto Buldas, Dirk Draheim, Mike Gault, Risto Laanoja · 6 authors
We generalize Unicity token ownership to programmable spending conditions called predicates, enabling smart-contract like functionality executed off-chain directly by relying parties rather than by consensus participants. We prove that the security properties of the Unicity execution layer are preserved under reduction to predicate family unforgeability. To demonstrate the utility of the model, we show how to implement trustless atomic swaps by using predicates.
We present the first machine-checked correctness proof of the OpenZeppelin reentrancy-guard pattern against a Lean 4 state-machine model of production-deployed Solidity source. All thirteen theorems are machine-checked with zero sorry, zero user-introduced axioms, and an axiom footprint bounded by [propext] (a standard mathlib4 axiom), gated under continuous integration. Smart contract reentrancy has caused over US$500M in documented losses since 2016, with the DAO 2016 attack draining ~3.6M ETH and forcing the hard fork that split Ethereum. The OpenZeppelin ReentrancyGuard pattern is the de facto defense across production DeFi, yet no prior work has established its discriminating power: that the guard blocks attacks on vulnerable instances, preserves correct execution for non-attacking transactions, and distinguishes adjacent safe and vulnerable variants. Prior efforts formalized either guard correctness on toy contracts or attack feasibility on isolated instances - not both directions plus boundary cases against production source. We verify three production instantiations - DAO 2016, Compound v2, and Aave V3 flashLoan - plus a minimal-diff mutant of Aave V3's flashLoan (flashLoanVulnerable) isolating one security-critical difference, via mutation testing. The tridirectional structure pairs (a) attack reproduction of the DAO 2016 pattern, (b) a correctness proof for Compound v2, and (c) a boundary-case proof distinguishing Aave V3's CEI-correct flashLoan from the mutant. A capstone meta-theorem composes the three under a no-retrofit discipline, demonstrated at the first cross-protocol stress test (Compound v2 to Aave V3); broader-family portability is future work. Full Lean 4 source, CI config and reproduction commands are at https://github.com/rayiskander2406/qanary-contracts, reproducible at v1.6-phase7-closure (substrate: v1.3-layer6-closure).
The paper examines the volatility spillover effects and long-term relationship between cryptocurrencies and traditional financial markets in Türkiye using BEKK-GARCH and DCC-GARCH models. It analyses the perception of crypto assets as a “digital safe haven” in an economy marked by high inflation, exchange rate fragility, and financial uncertainty. Using monthly price data for Bitcoin, Ethereum, BIST-100, and Republic Gold from January 2010 to February 2025, the study applies unit root tests, Johansen cointegration, ARDL bounds, and Engle-Granger tests. Results show no long-term price cointegration, but Bitcoin and Ethereum returns are strongly correlated, with DCC-GARCH results showing a dynamic correlation above 50%, while gold and BIST-100 correlate weakly or negatively. BEKK-GARCH highlights significant volatility transmission from Bitcoin to Ethereum, with BIST-100 maintaining persistent volatility. The study concludes that crypto and traditional markets in Türkiye are not integrated long-term, but short-term interactions exist at the return level, with implications for portfolio diversification and financial stability.
Abstract This study investigates racial and ethnic disparities in cryptocurrency (crypto) ownership using data from the 2021 Survey of Household Economics and Decision-Making (SHED). While prior research has explored general determinants of crypto market participation, such as risk tolerance, financial literacy, and investment experience, this study specifically focuses on how these factors differ across racial groups. Using logistic regression and Fairlie decomposition analysis, we find that Black respondents are significantly more likely to invest in crypto compared to White respondents. Key contributors to this disparity include age, financial literacy, risk tolerance, and stock ownership. Notably, while some factors, such as younger age and higher risk tolerance, narrow the participation gap, others, including differences in total savings and stock ownership, widen it. These findings highlight the need for targeted financial education and inclusive investment policies to promote equitable participation in emerging digital financial markets. Implications for financial literacy, consumer protection, and broader economic policy are discussed.
Reza Abtahi, Sayyed Ahmad Abtahi, Burkhard Stiller
This paper proposes an extensible taxonomy for profiling cryptocurrency arbitrage strategies across on-chain and offchain environments. Organized around ten analytical dimensions, the framework supports structured classification and comparison of arbitrage mechanisms with respect to execution setting, underlying drivers, capital requirements, temporal characteristics, risk exposure, and contextual overlays. Two representative cases, Cross-Rollup Arbitrage and Cash-and-Carry Arbitrage, illustrate its use in comparing structurally different strategies within a common schema. By offering a shared vocabulary across blockchain and financial perspectives, the taxonomy helps reduce conceptual fragmentation and supports more systematic analysis of cryptocurrency arbitrage strategies.
Decentralized storage offers high availability and scalability. However, owing to the decentralized storage of data across multiple nodes, issues such as slow data access and complex operations arise, resulting in a poorer user experience compared to centralized storage. To address this, a data availability sampling technology is employed, which maintains the decentralized nature of the method while incorporating the advantages of centralized storage. In data availability sampling technology, multiple nodes obtain a smaller, randomly selected subset of data from a single data owner. This technology is often combined with erasure coding to enhance data availability. Based on data availability sampling technology, decentralized storage providers are introduced to serve users on a one-to-one basis, and data guarantors supervise storage providers and provide guarantees for user data. A comprehensive storage method is designed to achieve highly available data storage, and blockchain and smart contracts are employed to enhance decentralization. By supporting a repledging model and adopting a storage-proof algorithm with low computational resource consumption, the willingness of the nodes to join is increased. To resolve the contradiction between large data scales and the limited bandwidth resources of data guarantors, a delayed confirmation mechanism is proposed. Experimental and analytical results show that under this method, the probability of malicious node collusion is only 2.43×10<sup>-3</sup>, the probability of untrustworthy data availability sampling results is only 2.93×10<sup>-4</sup>, the number of data unavailability occurrences is 0 in 3 million simulation experiments, the number of centralized nodes is 0, and generating storage proofs for a 1 MiB file takes only 3.51 ms. This method achieves highly available data storage while improving user-friendliness and node-friendliness, providing a feasible technical path for optimizing decentralized storage.
Synthetic content can cause measurable harm to real people, yet existing legal and technical frameworks struggle to establish who is accountable when that harm occurs. Current provenance systems can help identify where content originated, but they do not provide a reliable mechanism for attributing responsibility among the parties involved in its creation and deployment. This paper proposes a conceptual accountability architecture that creates a provable, non-repudiable connection between synthetic content generation and the entities that controlled the process. The framework introduces signed generation attestations that bind the producing system, the invoking party through a payment-linked zero-knowledge commitment, and the operative instruction and safety state at the moment of execution. Building on these verified facts, the paper presents an Evidentiary Presumption Generator (EPG), a mechanism that transforms cryptographically verified records into rebuttable legal presumptions while preserving judicial discretion. Rather than determining liability directly, the framework aims to reduce accountability ambiguity by providing courts with a stronger evidentiary foundation for evaluating synthetic harm claims. Designed as an extension to existing provenance standards such as C2PA and reinforced through auditable execution proofs and transparency-log anchoring, the architecture reframes accountability from after-the-fact inference toward cryptographically verifiable evidence. This work does not attempt universal enforcement across all AI systems, particularly offline or open-weight models. Instead, it proposes a practical accountability infrastructure for participating ecosystems and explores how cryptographic provenance may support future governance, compliance, and legal accountability mechanisms in the age of synthetic media.
Vanessa Sophia Cunha, Paul J. Diefenbach, Emil Polyak
This thesis explores the design and development of CLS Nexus, an AI-assisted clinical decision-support platform built for Child Life Specialists (CLS) in pediatric healthcare settings. The project addresses a documented gap in the field: despite a substantive evidence base for psychosocial intervention in pediatric care, no purpose-built digital framework exists to support specialists in organizing, discovering, and personalizing therapeutic activities at an institutional level. CLS Nexus is a WordPress-based proof-of-concept built with an endpoint-agnostic AI integration layer, using the Anthropic API with Claude Sonnet as the demonstration model, with the architecture designed to support institutional deployment without changes to the application layer. A particular focus was placed on positioning AI as a tool that extends specialist judgment rather than replacing it. The methodology employs a design-based research approach progressing through three iterative platform concepts, each of which produced design knowledge that informed the next, culminating in a fully functional proof-of-concept system. The platform encompasses two integrated AI systems: System 1, an automated content tagging pipeline that analyzes uploaded clinical materials across twenty-seven dimensions using a purpose-built pediatric psychology-informed taxonomy; and System 2, a structured patient intake advisor that scores candidate interventions against individual patient profiles using a zero-to-five star rating system with explicit flags across thirteen psychological categories. The platform's design, prompt engineering decisions, and clinical taxonomy structure are documented as academically significant artifacts throughout. Expert validation was conducted through a two-track asynchronous survey methodology, with healthcare professionals with clinical backgrounds evaluating the system's clinical credibility and taxonomy design, and digital media practitioners evaluating its information architecture, AI integration, and ethical positioning. The project contributes a concrete, ethically grounded example of how AI can be integrated into provider-facing clinical tools, demonstrating that meaningful personalization and clinical decision-support capability can be achieved through accessible platform infrastructure without displacing the specialist judgment that makes psychosocial care most effective.
Open access
Digital Mental Health Interventions
Electronic Health Records Systems
Artificial Intelligence in Healthcare and Education