Zen-Noh (Japan)

Universal Admission and Repair Algorithm: Open Executive Safety Architecture

UARA — Universal Admission and Repair Algorithm is an open executive safety architecture for autonomous and self-adaptive systems operating under uncertainty, bounded authority, incomplete observation, and recoverable execution. UARA is not a new theory. It is the executable laye...

Universal Admission and Repair Algorithm: Open Executive Safety Architecture

UARA — Universal Admission and Repair Algorithm is an open executive safety architecture for autonomous and self-adaptive systems operating under uncertainty, bounded authority, incomplete observation, and recoverable execution. UARA is not a new theory. It is the executable laye...

ZenBrain: A Neuroscience-Inspired 7-Layer Memory Architecture for Autonomous AI Systems

ZenBrain is a seven-layer, neuroscience-derived memory architecture for LLM agents that unifies fifteen mechanisms—from Two-Factor synaptic consolidation to a Simulation-Selection sleep loop—under a single MemoryCoordinator: nine foundational algorithms plus six Predictive Memory...

Belief-MVCC: A Coherence and Transaction Layer for Shared Agent Memory

We present a coherent, transactional, semantic shared-memory kernel through which specialised AI cores read and write while staying consistent. The design combines belief revision (AGM; Darwiche–Pearl; Konieczny–Pino Pérez), distributed-systems consistency (causal+, RedBlue, BSP)...

Semantic Resurrection Bounds Verifiable Deletion: A Measured Characterization of the Identity Ceiling in Agent-Memory Forgetting

Cryptographically verifiable deletion in agent memory is an active area: dependency-aware unlearning, cascade repair, and crypto-shredding with deletion receipts are all established. This note addresses a narrower question that survives that prior art: what bounds verifiable dele...

Spontaneous Near-Criticality and Type-Graded Robustness in a Four-Atom Conway Cellular Automaton

A minimal variant of Conway's Game of Life, extended by four atom types and a 4x4 inter-type interaction matrix, spontaneously lands inside the Wilting-Priesemann near-critical band on 100/100 nominal trials across five structured presets, while a 20-random-matrix x 5-seed baseli...

Spontaneous Near-Criticality and Type-Graded Robustness in a Four-Atom Conway Cellular Automaton

A minimal variant of Conway's Game of Life, extended by four atom types and a 4x4 inter-type interaction matrix, spontaneously lands inside the Wilting-Priesemann near-critical band on 100/100 nominal trials across five structured presets, while a 20-random-matrix x 5-seed baseli...

Semantic Resurrection Bounds Verifiable Deletion: A Measured Characterization of the Identity Ceiling in Agent-Memory Forgetting

Cryptographically verifiable deletion in agent memory is an active area: dependency-aware unlearning, cascade repair, and crypto-shredding with deletion receipts are all established. This note addresses a narrower question that survives that prior art: what bounds verifiable dele...