content addressing

Distributed systems require globally unique, time-ordered, and low-overhead identifiers. This paper systematically evaluates UUIDv4, UUIDv7, and ULID across generation efficiency, collision probability, network transmission overhead, and temporal ordering. We employ analytical modeling, distributed simulation, and comprehensive benchmarking—including throughput, serialized byte size, and sorting latency—to conduct empirical assessment. Results demonstrate that ULID, while preserving 128-bit entropy and cryptographic security, reduces network bandwidth consumption by 83.7% relative to UUIDv4/v7, improves identifier generation throughput by 97.32%, and lowers theoretical collision probability by 98.42%. Moreover, ULID natively supports lexicographic ordering and millisecond-granularity temporal locality, significantly enhancing indexing performance and scalability under high-concurrency workloads. This study provides quantitative evidence and practical guidance for selecting distributed identifiers in production systems.

This work addresses concurrent write conflicts in multi-agent code co-synthesis by proposing the AI-Atomic-Framework (ATM), which integrates task intent, repository scope, write permissions, validation, and evidentiary obligations into an auditable governance chain through a specification-driven mechanism. Key innovations include a content identifier (CID)-mediated coordination protocol for shared writes, adapter-guided semantic atomic decomposition, a virtual atomic mechanism to handle incomplete mappings, and delegation of final writes to a neutral custodian. The approach is empirically validated in a single-domain setting, demonstrating feasibility, auditability, and limited recoverability across twelve scenario configurations, multiple case studies, and an external adoption assessment.

Traditional distributed systems struggle to support modern autonomous infrastructures that integrate stochastic models and autonomous agents. This work proposes the Post-Deterministic Distributed System (PDDS) model, introducing for the first time its five architectural pillars. Its core innovation is a "cognitive state replication" mechanism that extends consistency from data visibility to knowledge visibility, alongside a novel fault classification framework. By leveraging protocol-driven development, verifiable agent infrastructure, and semantic quorum guarantees, PDDS enables coordination among semantically equivalent yet executionally divergent agents. This approach achieves verifiable semantic rollback and cross-agent reasoning consistency, establishing a theoretical foundation for trustworthy autonomous systems.

In digital forensics, the atomicity and integrity of storage snapshots lack rigorous definitions that jointly guarantee both instantaneousness and causal ordering—undermining evidentiary admissibility in legal proceedings. To address this, we propose a novel atomicity definition grounded in causal consistency, overcoming the limitation of conventional time-based atomicity models. We further rectify conceptual flaws in existing integrity definitions and introduce a revised, theoretically sound yet engineering-practical integrity criterion—explicitly supporting copy-on-write (CoW) implementations. Our approach integrates causal modeling, formal snapshot semantics, CoW mechanism analysis, and formalization of forensic quality criteria, yielding a verifiable snapshot semantic framework. This work establishes the first theoretical foundation for forensic tool design that unifies causal ordering with instantaneous state capture, thereby significantly enhancing the forensic validity and judicial admissibility of live data acquisition.

This work identifies a common root cause—termed the “Forward-in-Time-Only” (FITO) assumption—underlying recurrent semantic errors in diverse systems, such as erroneous cloud deletions, email sequencing anomalies, and distorted memory reconstructions. These issues stem from the prevalent reliance on temporal ordering alone to manage state changes, without incorporating causal reflection mechanisms. The paper unifies these failures under the novel conceptual framework of cross-scale semantic collapse, spanning systems from network buffers to the human hippocampus. Through causal-order modeling, semantic analysis of distributed transactions, and cross-domain behavioral comparison, the study reveals three systemic failure patterns arising from the neglect of semantic causality. This analysis establishes a theoretical foundation for designing intelligent systems endowed with a semantically grounded arrow of time.

This work addresses subtle inconsistencies that may arise between declared identity policies and their actual enforcement in systems. It proposes a three-valued auditing framework that formally models declared partitions and mechanism-induced operational partitions, enabling bounded verification over a refinement lattice. By introducing decidable divergence witness pairs, local sibling-base comparisons, and global alternative conditions—combined with set partitioning and typed identity modeling—the approach enables rigorous consistency checking. The method uncovers over-partitioning issues caused by mechanisms such as version fields and demonstrates that historical extensions can invalidate previously passed audit outcomes, thereby ensuring more reliable enforcement of identity policies.

Traditional possession-based authorization models struggle to ensure causal continuity in multi-hop executions within distributed systems and AI agents, often leading to confused deputy problems or over-privileged delegation. This work proposes a Proof-of-Continuity model that introduces a single-hop causal primitive—Proof of Relationship—and leverages its transitivity to construct end-to-end causal chains, propagating only the non-expansive subset of permissions originating from the initial request. Integrated with a Provenance Identity Continuity (PIC) mechanism, the model synergistically combines causal tracing, permission constraints, and temporal authorization propagation. It complements existing identity technologies such as OIDC and verifiable credentials without conflating multi-source contexts. Theoretical analysis demonstrates that this framework fundamentally eliminates the confused deputy problem, offering a fine-grained, causally consistent, and secure permission propagation mechanism for AI agents and distributed systems.

Existing systems exhibit fragmented mechanisms and vulnerabilities when supporting six key coordination properties: compositional authentication provenance, encapsulation opacity, multi-object atomic commit, deterministic replay, immutable history, and derived historical states. This work proposes a minimal kernel that, for the first time, unifies all six properties within a single semantic framework. By leveraging a uniform “send” interface, s-expressions, transactional semantics, append-only logging, and a distinction between transient and persistent objects, the kernel automatically enforces these properties at the level of state transitions. Under the assumption of faithful kernel execution, any program inherits all six structural guarantees; even in the presence of malicious actors, five of the six properties remain intact, substantially enhancing system robustness and security.

This study addresses the challenges in digital forensics posed by heterogeneous network data, whose incompatible schemas and timestamp formats hinder reliable evidence correlation and timeline reconstruction, while existing preprocessing methods suffer from poor reproducibility. To overcome these limitations, this work proposes a deterministic forensic preprocessing framework that transforms raw data into a standardized, reproducible form through three core operations: schema normalization, temporal normalization, and provenance tracking. The framework innovatively formalizes the preprocessing pipeline using set-theoretic constructs and rigorously proves its determinism, information preservation, and provenance completeness. Furthermore, it introduces a bounded-memory, chunk-based streaming architecture enabling scalable processing. Empirical evaluation on the UNSW-NB15, IoT-23, and TON_IoT datasets demonstrates 100% output consistency and efficient handling of datasets ranging from millions to hundreds of millions of records.

This study addresses the strategic lock-in and operational risks organizations face when relying on commercial data intermediaries to ensure the timeliness and reliability of master data. It pioneers the systematic integration of Self-Sovereign Identity (SSI) into master data management by synthesizing insights from hermeneutic literature review, expert interviews, and design science research methodologies. The resulting design theory embeds a trustworthy master data management framework within a data space reference architecture, emphasizing data sovereignty, reliability, and accountability. Validated through evaluation by industry experts, the proposed framework enables trusted, controllable data sharing and governance within data ecosystems.