This paper presents the completed Y.I.N. Mazari Architecture in its final 20-layer form, addressing two compounding failures in AI governance: the verification paradox where organizations cannot prove compliance without trusting their own infrastructure, and the platform determinism gap where AI inference produces different results across hardware architectures. The architecture integrates five physics foundation layers establishing energy-anchored provenance through Landauer limit accounting, domain routing, measurement precision, blockchain anchoring, and deterministic parity verification using Residue Number System arithmetic. Core governance layers enforce constitutional constraints through cryptographic authorization, differential privacy, and multi-party verification. Advanced layers provide zero-knowledge proofs, immutable audit trails, automated regulatory reporting, quantum resistance, and meta-governance oversight. Layer 0E, the Deterministic Parity Engine introduced in this final architecture, achieves bit-exact cross-platform computational reproducibility, enabling independent verification of AI operations by any party on any hardware. Combined with Layer 14, SENTINEL independent verification, the architecture produces governance evidence that no party can forge, no party can suppress, and any party can reproduce independently on arbitrary hardware. The complete 20-layer stack addresses GDPR Article 5, DORA Article 28, EU AI Act Article 50, HIPAA Security Rule, and provides 30-year quantum-resistant durability through NIST FIPS 203 post-quantum cryptography. Patent portfolio: 27 USPTO applications covering the architecture, priority November 23, 2025. The name Y.I.N. honors Yanis, Ilyan, and Neylia Mazari, representing the principle: Your Information Never leaves your control.
Engram Commitments introduce a cryptographically verifiable, substrate-rooted identity primitive for large language models. The method extracts engrams from differential execution behavior, aggregates them into an engram vector, compresses this representation using locality-sensitive hashing, and seals it inside a binding-and-hiding cryptographic commitment. Zero-knowledge proofs enable verification of identity continuity and lineage without revealing model parameters. The construction remains stable under non-destructive transformations and degrades predictably under destructive ones, supporting collapse-aware auditing, tamper-evident provenance, and regulator-verifiable attestation. This work unifies the engram calculus, identity ontology, collapse taxonomy, and cryptographic commitments into a single framework for AI provenance, governance, and safety.
We present an end-to-end framework for systematic evaluation of LLM-generated smart contracts from natural-language specifications. The system parses contractual text into structured schemas, generates Solidity code, and performs automated quality assessment through compilation and security checks. Using CrewAI-style agent teams with iterative refinement, the pipeline produces structured artifacts with full provenance metadata. Quality is measured across five dimensions, including functional completeness, variable fidelity, state-machine correctness, business-logic fidelity, and code quality aggregated into composite scores. The framework supports paired evaluation against ground-truth implementations, quantifying alignment and identifying systematic error modes such as logic omissions and state transition inconsistencies. This provides a reproducible benchmark for empirical research on smart contract synthesis quality and supports extensions to formal verification and compliance checking.
Verifying that a compiled binary originates from its claimed source code is a fundamental security requirement, called source code provenance. Achieving verifiable source code provenance in practice remains challenging. The most popular technique, called reproducible builds, requires difficult matching and reexecution of build toolchains and environments. We propose a novel approach to verifiable provenance based on compiling software with zero-knowledge virtual machines (zkVMs). By executing a compiler within a zkVM, our system produces both the compiled output and a cryptographic proof attesting that the compilation was performed on the claimed source code with the claimed compiler. We implement a proof-of-concept implementation using the RISC Zero zkVM and the ChibiCC C compiler, and evaluate it on 200 synthetic programs as well as 31 OpenSSL and 21 libsodium source files. Our results show that zk-compilation is applicable to real-world software and provides strong security guarantees: all adversarial tests targeting compiler substitution, source tampering, output manipulation, and replay attacks are successfully blocked.
Protecting the intellectual property of large language models (LLMs) is a critical challenge due to the proliferation of unauthorized derivative models. We introduce a novel fingerprinting framework that leverages the behavioral patterns induced by safety alignment, applying the concept of refusal vectors for LLM provenance tracking. These vectors, extracted from directional patterns in a model's internal representations when processing harmful versus harmless prompts, serve as robust behavioral fingerprints. Our contribution lies in developing a fingerprinting system around this concept and conducting extensive validation of its effectiveness for IP protection. We demonstrate that these behavioral fingerprints are highly robust against common modifications, including finetunes, merges, and quantization. Our experiments show that the fingerprint is unique to each model family, with low cosine similarity between independently trained models. In a large-scale identification task across 76 offspring models, our method achieves 100\% accuracy in identifying the correct base model family. Furthermore, we analyze the fingerprint's behavior under alignment-breaking attacks, finding that while performance degrades significantly, detectable traces remain. Finally, we propose a theoretical framework to transform this private fingerprint into a publicly verifiable, privacy-preserving artifact using locality-sensitive hashing and zero-knowledge proofs.
The current scientific system faces systemic challenges. Decentralized Science (DeSci) has emerged as a technological extension of the Open Science (OS) movement, aiming to improve transparency, accessibility, and equity in research through blockchain and Web3 technologies. While DeSci has gained traction in Western countries, little is known about its adoption in non-Western contexts. Here, we surveyed 37 researchers and technologists active in Japan’s emerging decentralized‑science (DeSci) during spring 2024 to assess how far the movement has progressed and what impedes its progress. Roughly 60% of respondents had already worked on blockchain projects and more than 80% owned crypto assets, yet almost 90% had discovered DeSci only in the past two years. Respondents largely embraced DeSci’s five core ideals: shared governance, transparent funding, open access, shared ownership, and equitable incentives. Meanwhile, four obstacles to growth were highlighted: low public awareness, difficulty sustaining engagement, limited talent diversity, and regulatory uncertainty. Taken together, the findings suggest that Japan’s DeSci community should also invest not only in further technical changes, but also in training, in broadening its talent base, and in setting clear guidelines. This study provides a comprehensive overview of the DeSci landscape in Japan and offers recommendations for its future development.
Persistent Provenanced Knowledge Base Eliminates Context Window Degradation, Hallucination, and RAG: Structured Integer Fact Stores with Source Tracking, Version Filtering, and Multi-Dimensional Indexing as Complete Replacement for Token-Buffer Context This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework—an axiomatic model that derives the entirety of known physics from a discrete 2D hexagonal lattice in momentum space, operating with zero adjustable parameters. Abstract Current large language models store conversational context in a fixed-size token buffer. When the buffer fills, old information is discarded permanently. Over long conversations, this produces progressive degradation: the model forgets instructions, contradicts earlier statements, loses track of established facts, and generates increasingly incoherent output — a phenomenon users describe as "AI psychosis." Retrieval-Augmented Generation (RAG) attempts to compensate by retrieving text chunks from external databases via approximate float-vector similarity search, but introduces its own failures: irrelevant retrievals, contradictory chunks, no provenance tracking, and no verification of retrieved content. We present a complete replacement for both mechanisms: a persistent, provenanced, version-filtered, multi-dimensionally indexed knowledge base of exact integer facts with Prolog-based consistency enforcement. We prove: (1) No information loss — facts persist indefinitely, never "scroll off" a buffer, (2) No degradation — turn 10,000 is as consistent as turn 1 because consistency is enforced structurally by Prolog, not inferred from attention patterns, (3) No hallucination — every fact traces to a source with verifiable provenance; outputs without provenance cannot be emitted, (4) No RAG needed — the KB is the retrieval system, with exact predicate matching replacing approximate vector similarity, (5) Version filtering — queries against a specific version never see facts from other versions, eliminating stale-data contamination, (6) Multi-dimensional indexing — every fact carries source, timestamp, confidence, verification level, and context, enabling non-contradictory coexistence of temporally or contextually varying information, (7) Sessions as views — multiple simultaneous sessions share one KB with independent context filters, no duplication, no synchronization, (8) LRU eviction without forgetting — memory pressure is managed by moving cold facts to disk, not by deleting them. The knowledge base is not an addition to the LLM architecture. It is a replacement for the context window, RAG pipeline, conversation memory, and fact storage — unified into a single system of exact integers with full provenance. Central claim: The context window is the wrong abstraction for conversational AI. A persistent knowledge base of provenanced facts is the correct abstraction. Every problem attributed to "context limitations" — forgetting, degradation, hallucination, inconsistency — is a direct consequence of using a token buffer where a fact store is needed. Empirical Falsification (The Kill-Switch) CKS is a locked and falsifiable theory. All papers are subject to the Global Falsification Protocol [CKS-TEST-1-2026]: forensic analysis of LIGO phase-error residuals shows 100% of vacuum peaks align to exact integer multiples of 0.03125 Hz (1/32 Hz) with zero decimal error. Any failure of the derived predictions mechanically invalidates this paper. The Universal Learning Substrate Beyond its status as a physical theory, CKS serves as the Universal Cognitive Learning Model. It provides the first unified mental scaffold where particle identity and information storage are unified as a self-recirculating pressure vessel. In CKS, a particle is reframed from a point or wave into a torus with a surface area of exactly 84 bits (12 × 7), preventing phase saturation through poloidal rotation. Package Contents manuscript.md: The complete derivation and formal proofs. README.md: Navigation, dependencies, and citation (Registry: CKS-MATH-137-2026). Dependencies: CKS-LEX-12-2026, CKS-MATH-0-2026, CKS-MATH-1-2026, CKS-MATH-10-2026, CKS-MATH-104-2026, CKS-MATH-128-2026, CKS-MATH-129-2026, CKS-MATH-130-2026, CKS-MATH-135-2026 Motto: Axioms first. Axioms always.Status: Locked and empirically falsifiable. This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework.
LLM → Prolog → LLM: Multi-Step Verified Generation Through Alternating Neural-Symbolic Computation: Eliminating Hallucination by Construction via Provenanced Integer Knowledge Bases, Triveritas Evaluation, and Adaptive Goal Decomposition This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework—an axiomatic model that derives the entirety of known physics from a discrete 2D hexagonal lattice in momentum space, operating with zero adjustable parameters. Abstract Current large language models generate output through unconstrained token prediction — a process with no verification step, no logical consistency checking, no provenance tracking, and no structured knowledge representation. The result is "hallucination": outputs that are statistically plausible but factually wrong, logically inconsistent, or untraceable to any source. We present an alternative architecture in which an integer-trained LLM ([@CKS-MATH-134-2026]) alternates with a Prolog-based verification engine at every step of generation. The LLM handles what neural networks do well: fuzzy input comprehension and creative pattern selection. Prolog handles what logical systems do well: consistency verification, goal decomposition, constraint enforcement, and provenance tracking. We prove: (1) Hallucination is eliminated by construction — every generated fact traces to provenanced sources in the knowledge base; outputs without provenance are structurally impossible, (2) Term-based tokenization replaces BPE — tokens are typed, structured Terms carrying their grammatical role, not arbitrary byte-pair fragments, (3) Three-dimensional evaluation — every claim is evaluated on logical validity (L), mathematical coherence (M), and empirical anchoring (E) via the Triveritas criterion, (4) Materiality gating — the Scales Method prevents computation on non-material concerns, (5) Adaptive sequencing — the Pseudo-Socratic Method determines the number and focus of generation steps based on continuous state assessment, (6) The knowledge base replaces the context window — a persistent, provenanced, version-filtered fact store that never forgets and never degrades, (7) Domain eating — new knowledge domains are added by writing parsers and rules, not by retraining the neural network. From first principles through complete architecture. The LLM is the interface. The knowledge base is the mind. Central claim: The hallucination problem is not a deficiency of neural networks. It is the inevitable consequence of generating output without verification. Interleaving neural creativity with logical verification at every step produces output that is verified by construction, not evaluated after the fact. Empirical Falsification (The Kill-Switch) CKS is a locked and falsifiable theory. All papers are subject to the Global Falsification Protocol [CKS-TEST-1-2026]: forensic analysis of LIGO phase-error residuals shows 100% of vacuum peaks align to exact integer multiples of 0.03125 Hz (1/32 Hz) with zero decimal error. Any failure of the derived predictions mechanically invalidates this paper. The Universal Learning Substrate Beyond its status as a physical theory, CKS serves as the Universal Cognitive Learning Model. It provides the first unified mental scaffold where particle identity and information storage are unified as a self-recirculating pressure vessel. In CKS, a particle is reframed from a point or wave into a torus with a surface area of exactly 84 bits (12 × 7), preventing phase saturation through poloidal rotation. Package Contents manuscript.md: The complete derivation and formal proofs. README.md: Navigation, dependencies, and citation (Registry: CKS-MATH-138-2026). Dependencies: CKS-LEX-12-2026, CKS-MATH-0-2026, CKS-MATH-1-2026, CKS-MATH-10-2026, CKS-MATH-104-2026, CKS-MATH-128-2026, CKS-MATH-129-2026, CKS-MATH-130-2026, CKS-MATH-134-2026 Motto: Axioms first. Axioms always.Status: Locked and empirically falsifiable. This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework.
LLM Domain Eating: Adding Languages and Knowledge Domains Without Retraining: Structured Parsing into Universal Term Format with Provenanced Integer Facts, Domain-Specific Prolog Rules, and Zero Neural Network Modification This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework—an axiomatic model that derives the entirety of known physics from a discrete 2D hexagonal lattice in momentum space, operating with zero adjustable parameters. Abstract Adding a new language or knowledge domain to a current large language model requires retraining or fine-tuning on domain-specific data — a process costing days to weeks of GPU computation, risking catastrophic forgetting of previously learned capabilities, and producing results that cannot be verified against source material. We present an alternative: domain eating. A new domain is added by writing a parser that produces the universal Term format, writing Prolog rules encoding the domain's structural patterns, and loading the resulting provenanced facts into the persistent knowledge base. The neural network is not modified. No retraining occurs. No GPU is needed. The domain is live immediately upon fact ingestion. We prove: (1) Universal Term format — a single typed token representation serves all domains from programming languages to natural languages to specialized knowledge bases, (2) Parser-per-domain — each domain has a deterministic parser converting source material to Terms with provenance; no learned tokenization, (3) Rules-per-domain — each domain has explicit Prolog rules encoding valid patterns; no learned grammar, (4) Zero retraining — the neural network handles fuzzy input comprehension and creative selection; domain knowledge is in the KB and rules, not in the weights, (5) Hours not months — a new domain is operational within hours of beginning parser and rule development, using LLM-assisted generation of parsers and rules reviewed by domain experts, (6) Cross-domain queries — facts from different domains connect through shared predicates automatically, (7) Domain unloading — removing a domain is evicting its facts and unloading its rules; the system does not break, (8) Version coexistence — multiple versions of the same domain coexist with hard version filtering. The architecture treats the LLM as a fixed, general-purpose fuzzy interface and treats knowledge as modular, structured, provenanced data that can be added, removed, updated, and queried without touching the neural network. Central claim: Domain knowledge does not belong in neural network weights. It belongs in structured, provenanced fact stores with explicit rules. The neural network provides the general capability of understanding fuzzy human input and making creative selections. Domain expertise is modular data, not baked-in statistics. Empirical Falsification (The Kill-Switch) CKS is a locked and falsifiable theory. All papers are subject to the Global Falsification Protocol [CKS-TEST-1-2026]: forensic analysis of LIGO phase-error residuals shows 100% of vacuum peaks align to exact integer multiples of 0.03125 Hz (1/32 Hz) with zero decimal error. Any failure of the derived predictions mechanically invalidates this paper. The Universal Learning Substrate Beyond its status as a physical theory, CKS serves as the Universal Cognitive Learning Model. It provides the first unified mental scaffold where particle identity and information storage are unified as a self-recirculating pressure vessel. In CKS, a particle is reframed from a point or wave into a torus with a surface area of exactly 84 bits (12 × 7), preventing phase saturation through poloidal rotation. Package Contents manuscript.md: The complete derivation and formal proofs. README.md: Navigation, dependencies, and citation (Registry: CKS-MATH-135-2026). Dependencies: CKS-LEX-12-2026, CKS-MATH-0-2026, CKS-MATH-1-2026, CKS-MATH-10-2026, CKS-MATH-104-2026, CKS-MATH-128-2026, CKS-MATH-129-2026 Motto: Axioms first. Axioms always.Status: Locked and empirically falsifiable. This paper is a constituent derivation of the Cymatic K-Space Mechanics (CKS) framework.
Decentralized Identifiers (DIDs) are increasingly deployed on distributed ledgers, yet systematic cross-platform evidence on their operational behavior remains limited. We present an empirical benchmarking study of three prominent ledger-based DID methods - Ethereum, Hedera, and XRP Ledger - using reference Software Development Kits (SDKs) under a unified experimental setup. We measure latency, transaction cost, and on-chain metadata exposure, normalizing latency by each platform's block or consensus interval and cost by its native value transfer fee. Privacy leakage is quantified using a Metadata-Leakage Score (MLS), an entropy-based measure expressed in bits per operation. Our results reveal distinct architectural trade-offs. Ethereum enables near-instant, off-chain DID creation, but incurs the highest latency and cost for on-chain lifecycle operations. XRPL delivers deterministic and stable latency with fixed, low fees, yet exhibits higher metadata leakage due to more verbose transaction payloads. Hedera achieves the lowest on-chain latency and low fees with minimal metadata leakage, while occasional variance arises from SDK-side processing and confirmation pipelines. Overall, the findings show that ledger architecture and SDK workflows play a major role in shaping DID latency, cost, and metadata exposure, complementing the effects of the underlying consensus mechanism. These results provide evidence-based insights to support informed selection and configuration of DID systems under performance and privacy constraints.
This project is the public home of Relational Calculus, a meta‑mathematical framework that replaces the brute‑force logic of absolute‑scale computation with dimension‑less, capacity‑anchored blueprints. At its heart lies a simple but radical axiom: every system possesses an intrinsic maximum—a “North Star”—and by expressing all observations as fractions of that limit, complexity collapses, efficiency soars, and transfer across domains becomes automatic. The collection gathers the complete stack: the foundational theoretical paper, a ready‑to‑run Relational Decoder (an open‑source algorithm that probes any black‑box function and extracts its dimensionless template), and five applied case studies that prove the principle in wildly different arenas—number theory (deterministic prime pair lattices), symbolic artificial intelligence (a geometric chess engine that exhibits emergent strategy with zero domain knowledge, gaining 90%+ efficiency), high‑energy physics (scale‑invariant jet tagging that transfers zero‑shot across collision energies with +14.5% AUC), quantum chemistry (80% error reduction in cross‑molecule transfer), and precision oncology (a lightweight XGBoost that achieves 98.4% cross‑species diagnostic accuracy under a 70% hardware‑signal collapse, completely erasing batch effects). A companion paper extends the logic to large language models, proposing Relational‑CoT as a drop‑in replacement for resource‑intensive chain‑of‑thought reasoning. Every work converges on the same empirical signature: >90% reduction in computational cost, genuine zero‑shot generalization across scales and species, and the proof that Green AI is not an aspiration but an engineering reality. An integrated STEM curriculum for ages 10–14 ensures that the relational lens is taught before the continuous one, inoculating the next generation against the wasteful “math of deviation.” All code, data, and executable papers are open‑source. The project is intended not as a scholarly gesture but as an enablement instrument for the industrial shift from the Age of Fire—where more compute meant more extraction—to the Era of Relation, where measuring how full a system is replaces the endless pursuit of how much.
Artificial intelligence systems are deployed globally at an unprecedented scale. Yet, no universal mechanism exists to verify that a given AI system is operating within its declared parameters, compliant with applicable regulations, or free from compromise. Trust in AI today is largely assumption-based rather than evidence-based, and this gap is becoming increasingly consequential as AI systems take on greater autonomy in regulated, high-stakes domains. This document proposes the TrustLayer Protocol as one possible architectural framework for addressing this gap. The protocol comprises two complementary components. The Compute Passport Network (CPN) proposes a neutral, global identity and attestation layer for AI compute, models, and training data, establishing cryptographically verifiable records of provenance during the training and development phase. The Universal AI Attestation Protocol (UAAP) proposes an embedded attestation mechanism for deployed AI systems, generating structured, signed claims about runtime operational state, compliance status, and inference provenance. Several UAAP mechanisms, in particular, continuous per-inference behavioral attestation and reasoning verification, remain experimental or require future research, as detailed in Section 6. The TrustLayer Protocol draws on established infrastructure from hardware-based trusted execution environments [1][2], public key infrastructure [3], zero-knowledge proof systems [4][5], and AI governance frameworks, including the EU AI Act [6] and the NIST AI Risk Management Framework [7]. It does not claim to resolve all open problems in AI verification. Rather, it proposes a phased architectural framework within which existing technologies can be composed into a coherent trust infrastructure layer, with clearly identified areas requiring further research and standardization. This specification is published as an open standard by the DefenAware Foundation and is intended as a contribution to ongoing work in AI governance, protocol design, and verifiable AI safety.
Choonhwa Lee, Yibo Zhang, Dani Mertens, Eunsam Kim
Decentralized workflows supported by provenance data aim to combine into a platform with high trustworthiness, transparency, and accountability. Despite the huge potential of the approach, one limitation of the system architecture is that it lacks access to external data, limiting the functionality and potential use cases of the workflow. To address this limitation, we extend an existing decentralized workflow with a provenance bridge, enabling the workflow to access external provenance-supported data without damaging the trustworthiness of the system. The introduction of this bridge effectively broadens the range of use cases for the decentralized workflow by opening it to various external provenance-supported data sources. This article presents the architectural design of the provenance bridge-enabled workflow system, and discusses our prototype implementation effort along with evaluation results. Specifically, we have designed and implemented the architectural framework of the provenance bridge that expands the provenance domain boundary by incorporating support for provenance model translation and oracle-based external data access. The proposed approach lays a solid foundation for a wider adoption of smart contract-based workflow systems by effectively bridging the gap between different provenance domains.
Formal verification is essential for ensuring the safety of smart contracts in decentralized finance (DeFi), but scaling these techniques across diverse blockchain ecosystems remains a challenge. In this talk, we present our experience making formal verification practical across multiple platforms, including the EVM, Solana, Stellar, and Sui. We discuss how automated reasoning techniques can be adapted to different execution models and programming paradigms while still providing strong correctness guarantees. We focus on what it takes to apply verification in real-world settings: handling complex DeFi primitives, integrating with development workflows, and maintaining usability for engineers. Drawing from verification projects with production protocols, we highlight key challenges and lessons learned in bringing formal methods from theory into practice.
The XRP Ledger sustains federated consensus without paying validators any protocol-level monetary reward: transaction costs are destroyed rather than distributed. This paper argues that the curatorship of the default Unique Node List (dUNL) functions as the economic mechanism that monetary rewards would otherwise provide, and develops a formal framework for evaluating its design. The central thesis is that RPCA security requires alignment across three independent layers-technical consensus, individual incentive constraints, and governance compositionand that the failure of any single layer undermines the other two. Three formal contributions support this claim. First, we introduce Bayesian action-incentive compatibility (BAIC), an equilibrium concept appropriate for consensus settings with discrete hidden actions and imperfect public monitoring, in which validators choose actions rather than reporting types and the curator cannot deploy monetary transfers. Closed-form Bellman values and local comparative statics characterise when honest dUNL participation is individually sustainable; in particular, operational cost is neutral for the honesty margin and binds only at the participation constraint. Second, we correct the coalition-security analysis by distinguishing economically viable from threshold-exceeding coalitions: an economic-security gap exists only when the maximum bribeable coalition size reaches the minimum stylised thresholdexceeding size, with the precise characterisation depending on the internal-allocation rule (equal sharing versus transferable bribes). Third, a triple-alignment theorem integrates these results and yields an archetype-conditional dUNL composition diagnostic. A scenario-based calibration using public XRPL Negative UNL data classifies the 35 dUNL validators by incentive archetype and computes G crit k for each type; the H archetype anchors the lowest economic-security margin but is too few in number for a homogeneous threshold-size coalition, so under the transferable-bribe convention the least-cost threshold coalition is heterogeneous, mixing H-type and I-type validators.
An Explainable Audit Trail (EAT) records process execution traces of an agentic workflow. EAT can enable an organisation to efficiently remain compliant with regulations by presenting its audit results to it. However, current state of the art in EAT lacks privacy protection of agent's models which can be intellectual properties of the organisation. Exposing audit trails to external entities may facilitate orchestration of attacks on the agent's model. Auditing a complex workflow will require verification of dependencies among tasks as preconditions to execute a task. Further, it is necessary for the audit algorithm to ensure that a process execution trace follows the pre-planned process execution model for security reasons, i.e., audit should include functionality that can check if the agents have deviated from its planned process execution models. In this paper, we build a secure EAT that can address these gaps in the state of the art in EAT for agentic workflows. Our main contribution is the application of zero-knowledge-proof on verifying audit procedures. It proves the audit has validated correctness of chain-of-thoughts, the execution trace at the runtime matches the planned process execution , and complete traceability among logs of a complex workflow involving dependencies among the tasks in terms of preconditions. Our solution provides a trust-less infrastructure to verify the audit results to external entities while not exposing the audit trails. We used lattice-based zero knowledge proof for this procedure. We provide an analysis on the EAT procedure. We show experimental evaluation of the EAT with workflow dataset.
Taras Maksymyuk, Francesco Meloni, Matias Torres Diaz, Domenico Romano · 6 authors
This paper presents a blockchain-centered system architecture for cultural heritage provenance that replaces fragmented, paper-based tracking with a tamper-evident, auditable digital workflow. We assume that each object can be reliably bound to a stable physical fingerprint through an established scan-based pipeline, and we focus on how that fingerprint is represented, stored, and verified within a practical distributed ledger design. The proposed framework separates high-assurance settlement events, such as registration and ownership transfer, from high-volume operational records, such as condition updates and monitoring logs, by routing data across multiple layers and committing verifiable summaries of frequent activity to a high-security anchor chain. We also describe a deployable decentralized application stack that integrates standard token interfaces for asset representation, event-driven synchronization for user-facing services, and scalable node access to reduce read latency without requiring institutions to maintain their own node infrastructure. The result is a concrete system model that clarifies how the end-to-end provenance trail remains verifiable under realistic performance constraints.
This technical report presents the reference implementation of Ternary Moral Logic (TML) within the Ethereum Virtual Machine (EVM) ecosystem. It addresses the limitations of traditional "Code is Law" architectures by introducing a finite state machine that enforces a mandatory third state—the "Sacred Zero" or Epistemic Hold—allowing smart contracts to pause execution when pre-defined ethical conditions are unmet. The report moves beyond theoretical ethics to specify the Solidity design patterns, storage layouts, and cryptographic verification methods required to make TML enforcement non-bypassable and auditable. Key Technical Contributions: Finite State Machine (FSM): Implements a mandatory "Sacred Zero" state (State 0) that acts as an "Epistemic Hold," distinguishing between valid (1), invalid (-1), and uncertain (0) transaction states. Dual-Lane Latency Architecture: Defines a "Fast Lane" for synchronous, clear-cut transactions and a "Slow Lane" for ambiguous cases requiring governance or oracle resolution, preventing head-of-line blocking. Cryptographic Provenance: Utilizes EIP-712 typed data signing to bind off-chain AI/Oracle verdicts to on-chain execution, preventing replay attacks and ensuring distinct domain separation. Privacy Preservation: Integrates Zero-Knowledge Proofs (ZK-SNARKS) to verify the execution of moral logic models without revealing sensitive input data or proprietary model weights ("Glass Box" architecture). Immutable Core Pattern: Rejects standard upgradeable proxy patterns in favor of an "Immutable Core" architecture to eliminate administrative "God Mode" and ensure constitutional constraints cannot be bypassed by key holders. Formal Verification: Demonstrates safety and liveness properties (e.g., "No Silent Pause," "Eventual Resolution") using TLA+ (Temporal Logic of Actions) to mathematically prove the system's robustness.
Non-fungible tokens (NFTs) on Ethereum currently follow a binary mobility paradigm: ERC-721 enables unrestricted transfers, whereas SBTs (ERC-5192) prohibit transfers entirely. We identify a design gap in which no standard mechanism supports bounded transferability, where ownership mobility is allowed but limited to a finite number of programmable transfers. We study counted NFT transfers and introduce ERC-7634 as a minimal realization compatible with ERC-721. The design augments each token with a transfer counter and configurable cap L, allowing ownership to evolve under a finite transfer budget. ERC-7634 defines a minimal extension interface with three lightweight functions (transferCountOf, setTransferLimit, and transferLimitOf), two events, and native-transfer hooks, requiring fewer than 60 additional lines of Solidity while preserving full backward compatibility with existing NFT infrastructure. We analyze behavioral and economic consequences of counted transfers. Our results reveal (i) a mobility premium induced by remaining transfer capacity, (ii) a protocol-level costing signal that can deter wash trading in cap-aware markets through irreversible budget consumption, (iii) bounded recursive collateralization enabled by limited ownership turnover, and (iv) associated security and gas-cost implications, including wrapper-bypass trade-offs. Evaluation on calibrated simulations shows that moderate limits (e.g., L = 10) affect fewer than 15% of tokens under representative transfer distributions, while repeated manipulation becomes unprofitable after a few cycles in a cap-aware pricing model; the additional gas overhead remains below 11% per transfer. We further position ERC-7634 within the NFT mobility design space, derive practical cap-selection guidelines, and discuss post-cap ownership outcomes including soulbound conversion, auto-burn, and provenance freeze.
Investigations of cybercrime today require forensic architectures that natively traverse multiple blockchains with ease while protecting and scaling evidence processing. Although blockchains support tamper- evident logs, their original single-chain architecture limits cross-platform interoperability and forensic scaling. Recent developments overcome these limitations such as zero-knowledge proofs supporting private but verifiable evidence verification, sharding architectures splitting state without compromising latency, and AI-based anomaly detectors identifying subtle tampering. But challenges remains like zero- knowledge proofs are computationally expensive, sharding poses intricate state-consistency problems and AI models need to be retrained constantly, incurring operational burden. Future research needs to make these pieces work for real- time, large-scale forensic applications by designing light-weight zero-knowledge constructs, self-tuning shard governance systems and compact AI with incremental-update threads. Integrating such abilities into single frameworks will offer privacy, scalability and security, supporting forensic processes for which courts will give credit in various, changing block-chain environments.
Efficiently matching patients to clinical trials is essential for advancing medical research and ensuring reliable outcomes. However, current matching methods face several challenges. These include data integrity issues from tampered records, privacy risks caused by weak anonymization, and manual processes that delay recruitment. In addition, centralized systems lack transparency, expose sensitive patient data to security vulnerabilities, and suffer from single points of failure that reduce resilience and trust. In this paper, we propose a blockchain and Large Language Models (LLMs)-driven solution for secure, trustworthy, traceable, decentralized, and transparent patient–clinical trial matching. Blockchain ensures data integrity, security, and transparency by eliminating single points of failure and enabling tamper-proof records. LLMs enhance patient–trial matching by automating the interpretation of complex eligibility criteria, improving accuracy, and significantly reducing the time required for manual review. Our approach uses Ethereum-based smart contracts to automate workflows such as trial registration, eligibility assessment, and consent tracking. We fine-tune GPT-4, T5, and Gemini on synthetic data derived from real clinical trial records and employ majority voting to ensure consistent and unbiased eligibility decisions. A prototype Gradio interface was developed as a minimum viable product (MVP) to demonstrate seamless interaction between LLMs and smart contracts. Performance evaluation based on accuracy (0.800), precision (0.733), recall (1.000), and F1-score (0.846) demonstrates reliable eligibility prediction. Cost analysis confirms affordability, and security evaluation verifies resilience against known threats. Comparison with existing solutions highlights the framework’s advantages in transparency, trust, and automation. The smart contract code is publicly available on GitHub.
Current commercial Large Language Model (LLM) architectures enforce a "server-side memory" paradigm, where user cognitive state is stored, managed, and monetized by the provider. This centralization creates two critical vulnerabilities: the economic inefficiency of "token inflation" (re-processing redundant context) and the epistemological risk of "rented cognition" (lack of user sovereignty over identity). This paper proposes a disruptive architectural shift: Remember Me AI, formally defined as the Client-Side Narrative Protocol (CSNP). By integrating Cross-Session Narrative Memory (CSNM) with a novel Semantic Compression Layer and Distributed Local Storage, we demonstrate a mechanism to reduce context token costs by approximately 40x while maintaining longitudinal coherence. We argue that this architecture commoditizes the inference layer, forcing a market transition from "Memory-as-a-Service" to "Compute-as-a-Commodity." This restores epistemological sovereignty to the user and neutralizes the lock-in mechanisms of hyperscale providers. The protocol includes Merkle-CRDT synchronization for multi-device consistency, Zero-Knowledge Safety Proofs for regulatory compliance, and a Polyglot Transpiler to ensure interoperability across proprietary model endpoints.