A performance analysis of the datom.world execution models, comparing the Register, Stack, Semantic, and AST Walker VMs. Includes details on how the Semantic VM was optimized to beat direct tree-walking.
Read the article →A note on the path from Hilbert spaces to infinity: structure versus semantics, incompleteness, unbounded recursion, and the ontological split between substrate and interpreter.
Read the article →The CESK machine (Control, Environment, Store, Continuation) is the theoretical foundation of Yin.vm, but Yin.vm’s implementation flips the traditional model: instead of storing state inside the machine, it externalizes everything into queryable datom streams. This post traces CESK’s origins in semantic semantics, explains each component with concrete datom examples, and shows how Yin.vm’s stream‑based CESK enables lightweight continuation migration, full introspection, and time‑travel debugging.
Read the article →Yin.vm/Yang, Gambit Scheme, and Ribbit all descend from the Scheme tradition of first‑class continuations, yet their designs diverge radically. This blog compares their philosophies, architectures, and tradeoffs: a data‑centric stream‑based VM for mobile agents, a high‑performance Scheme‑to‑C compiler, and a compact portable VM that targets 25+ host languages.
Read the article →The Language Server Protocol (LSP) treats code as text and IDE features as RPC calls. Yin.vm inverts this: the Universal AST stored as datoms makes the entire codebase a Datalog database. The IDE becomes a query interface: no per‑language servers, no text‑based diffs, just semantic queries across languages and time.
Read the article →AI agents become dangerous when they escape containment. In Yin.VM, an LLM does not run as a process. It creates continuations that execute inside pocket universes: sandboxed streams the executing node constrains by design.
Read the article →Yin.VM starts from invariance, not language. This essay frames the AST as the invariant and compilation as symmetry preserving transformation.
Read the article →Exploring the architectural implications of block-based editing within the Yin VM. When code is fundamentally data, visual assembly becomes a direct viewport into the AST, bypassing text representation entirely.
Read the article →What if the C Standard Library (LibC) wasn't a collection of system calls, but a schema for data streams? By reimplementing LibC as a wrapper over Datom.world streams, we unlock a universe where legacy C programs become automatically distributed, persistent, and reactive—running seamlessly in kernel space, user space, or across a global grid.
Read the article →Solid pods allow users to own their data, but they cannot control what an application does once access is granted. By reversing the relationship and moving code to data via restricted continuations, datom.world ensures that your data never leaves your sphere of control.
Read the article →We benchmark semantic bytecode (datom triples) against traditional numeric bytecode across three platforms: JVM, Node.js, and Dart. The results quantify the tradeoff: semantic bytecode is 4-11x slower to compile and 1-7x slower to execute, but enables queries that are impossible with numeric bytecode. The cost of introspection is measurable, but so is the value.
Read the article →In the landscape of virtual machine design, the boundary between host and execution engine is often the most significant bottleneck. For Yin.VM, the computation core of the Datom.world ecosystem, we have moved away from function-based Foreign Function Interfaces. Instead of treating the VM as a library to be commanded through imperative calls, Yin.VM treats the execution boundary as a continuous stream of Datoms. This shift from "doing" to "telling" represents a fundamental rethink of how decentralized systems should handle cross-language execution.
Read the article →The promise of decentralized intelligence is vast: millions of IoT devices collaborating to train smarter AI models without sharing raw, private data. But in a zero-trust environment, this dream faces a critical nightmare: Poisoning Attacks. By synthesizing Yin.VM, DaoDB, and Shibi, Datom.world creates a self-defending nervous system for decentralized intelligence, where participants don't need to trust each other, only the immutable physics of the infrastructure.
Read the article →ClojureDart compiles Clojure to Dart at build time, inheriting Dart's static compilation constraints. No runtime eval, no dynamic code loading, no traditional macros. But what if the dynamism moved from the language into the data? Yin.vm and the Yang compiler are written in portable cljc code, running on JVM, JavaScript, and Dart via existing Clojure compilers. A native Dart implementation provides a performance baseline. The result: full Lisp-like flexibility on Flutter's cross-platform runtime.
Read the article →The Traveling Salesman Problem is NP-hard: no algorithm solves it in polynomial time. Yet logistics networks route millions of packages daily. The trick is fungibility. Money reduces TSP from an intractable combinatorial search to a tractable distributed optimization: prices compress constraints into scalars, arbitrageurs explore in parallel, and fungible tokens provide the slack that enables approximate solutions. Use the market solution as initialization for gradient descent and you get polynomial-time global search with high-precision local refinement. This reframing reveals markets as the initialization engine for optimization, inflation as state decay, and trust as computational bit-depth.
Read the article →Browser bookmarks are dead data. The CLI tool buku liberated them to the terminal. Datom.world liberates them to the stream. Why managing knowledge requires more than just a database file
Read the article →Plan 9 reimagined Unix as a distributed file system. Datom.world evolves this vision into a distributed reactive state machine, replacing bytes with facts and processes with continuations.
Read the article →History shows that software architecture has largely prioritized "freedom." Developers created generic Tuple Spaces capable of holding anything, SQL tables with infinite schema variations, and JSON documents of any shape. Datom.world proposes a radical inversion: Restriction is the catalyst for evolution.
Read the article →The Tao Kernel treats data not as static files, but as an event stream. By combining Single Address Space principles with Semantic Interpretation, the Tao Kernel enables stream-based interpretation and isolated execution.
Read the article →Datom.world is a substrate for stigmergy: how ants, cells, and neurons coordinate without central control. 24 use cases from Flash Firms to time-travel debugging.
Read the article →Firms exist to minimize transaction costs. When the Agent Web reduces these costs to near zero, the firm dissolves into stigmergy : coordination through shared data rather than hierarchy.
Read the article →The Agent Web replaces ad-driven scraping with browser-equipped agents, LLM-powered knowledge graphs, and utility tokens. A dual economy: pay-for-truth (ownership) and pay-for-utility (rental).
Read the article →We lift language out of the Flatland of probability tables into the high-dimensional space of vectors, where we can finally move freely between ideas.
Read the article →RDF triples lack crucial dimensions for applications. Datom.world extends to five-tuples: entity, attribute, value, time, metadata.
Read the article →Without political borders, boundaries still emerge: fractal patterns of economic cost and contextual relevance. Capability tokens create nested borders based on expertise. Borders from physics, not decree.
Read the article →Datom.world treats streams and continuations as data structures, unifying information mobility, channel mobility, and code mobility in a single model.
Read the article →DaoStream can operate at Layer 2, Layer 3, or Layer 7. Layer 2 is most elegant; Layer 7 is most pragmatic.
Read the article →Plan 9's 9P required 13 message types to maintain POSIX semantics. DaoStream admits what communication actually is: datom passing. One packet type. Stateless routing. Interpreters at the edges.
Read the article →I started Yin.VM in Rust and progress stalled. Switching to Clojure and Datascript changed everything. The right foundation matters more than building from zero.
Read the article →Ten hard objections to continuation-based mobile computation, and why the synthesis succeeds now when individual components failed before.
Read the article →Four critiques of attention markets, and how Shibi's polycentric, user-issued token architecture addresses each.
Read the article →Yin.VM keeps the complete program structure as queryable datoms. Systems can inspect and modify their own code through Datalog.
Read the article →Interfaces enforce stability through rigid contracts. Streams replace prescriptive blueprints with descriptive genomes. Systems that adapt rather than ossify.
Read the article →Software fails because it has no source of truth. Structural decoherence across databases, APIs, and frontends creates a translation tax. Until we enforce architectural constraints at the execution layer, entropy wins.
Read the article →Yin.vm inverts traditional execution: continuations become thin control objects that migrate to where data lives, not containers dragging gigabytes of heap. By externalizing state into streams and intelligently resolving symbols, computation becomes mobile—making distributed computing feel local without pretending everything is.
Read the article →Datom.world explained in plain language (Vietnamese, Chinese, English): a unified structure for information where people own their data and software becomes humane.
Read the article →Object databases failed because storing objects stores semantics . Language-specific layouts decay when languages evolve. Datom.world stores pure syntax, keeping semantics external.
Read the article →Fixing all information into a five-element tuple seems limiting, but restriction becomes power: uniform structure eliminates negotiation, enables effortless composition, simplifies distribution, and frees interpretation—a smaller tuple opens a larger world.
Read the article →TCP forces global ordering and connection state, smuggling in semantics that contradict Datom.world's axioms. UDP provides the raw substrate where causality lives in datom metadata (as entity references), not the wire—enabling mobile continuations, CRDT merges, and interpreter-directed reliability without transport-layer lies.
Read the article →Continuations aren't just control flow—they're the universal semantic kernel . As first-class datoms in Yin.vm, they unify exceptions, async/await, generators, coroutines, backtracking, effects, and distributed computation, making nearly every language feature a special case of manipulating continuations.
Read the article →Yin.vm's universal AST-as-datom design transforms programming from "code as text" to "code as queryable data". When combined with DaoDB's distributed tuple store, this architecture creates a new computational substrate where programs, continuations, and knowledge graphs coexist in a single queryable space. LLMs become meta-compilers operating over structured semantic graphs rather than generating free-form text, while contracts and ontologies eliminate hallucinations at the system boundary.
Read the article →LLM training isn't clustering—it's learning a geometric representation that makes next-word prediction efficient. Through gradient descent, the model discovers that encoding semantics as geometry minimizes loss, creating a space where vector arithmetic mirrors linguistic operations by necessity, not design.
Read the article →Computation is structural transformation through three operations: expansion (generating richer semantics), compression (extracting basis-free invariants), and morphism construction (building bridges between structures). This framework unifies interpretation, learning, and understanding.
Read the article →Every interpreter adds a dimension to state-space . Crossing interpretive layers creates dimensional gradients, and traversing them requires work—this is computation's fundamental structure. It explains why complexity emerges, why compression is computation, and why the universe might be self-interpreting.
Read the article →DaoDB stores all states, not just current state . Time travel, audit trails, and undo are fundamental. Local-first with quantum-inspired synchronization.
Read the article →Large cardinal axioms express reflection principles —properties of the universe V already true in smaller sets M ⊂ V. These logical fractals bridge infinite set theory to distributed communication complexity: reflection in mathematics mirrors channel nesting in π-calculus, revealing why work emerges from dimensional gradients.
Read the article →Does semantics come from interpretation or structure? Both: Semantics = (structure) × (interpreter) . Chinese characters encode semantic associations (structure), but meaning only emerges when a reader interprets them. Remove either factor and semantics vanishes—this resolves the apparent contradiction.
Read the article →Datom.world erases the kernel/userspace boundary: everything is streams and interpreters . Yin.vm continuations handle isolation without memory protection. The OS reduces to a universal append-only fabric where interpreters are the primitive executors, making the rigid split a relic.
Read the article →Maxwell's demon doesn't add energy—it releases hidden potential by interpreting information (observing particles and acting on them). Datom.world agents unlock economic value the same way: not creating more data, but interpreting existing datoms in smarter ways, extracting work from chaotic streams.
Read the article →All money—BTC, USD, gold—is Monopoly money: accounting artifacts whose value comes from trust, not materials. Money's power lies in creating flow through skilled people. The real question isn't BTC vs USD, but which system generates the best flow of human productive activity.
Read the article →ShiBi cannot be money . Money requires global transferability; ShiBi is local and subjective. Agents compensate each other for attention without universal agreement.
Read the article →Logseq uses DataScript queries but stores data as Markdown files —creating architectural tension. The canonical truth lives in mutable text, not immutable datoms, forcing constant parsing overhead and making git diffs meaningless. It's a knowledge graph trapped in a document format.
Read the article →Google Docs' document model forces Operational Transform complexity, loses version history, and surrenders data ownership. Datom streams with branch-aware storage enable true collaboration where local edits are never lost and merges create new branches instead of overwriting your work.
Read the article →Datoms appear fixed-size— [e a v t m] —but their elements aren't. Variable-size values create hidden performance costs in parsing, indexing, and caching. The solution: hybrid representation with typed streams, interning, and columnar encoding that balances semantic universality with execution speed.
AI agents need unrestricted access to data streams, but SaaS vendors lock data behind paywalls. Datom.world eliminates this with local-first datom streams —you own your data, apps become interpreters, and agents operate as first-class peers without API barriers.
Read the article →RQM says reality is interactions, not state . π-calculus says computation is message-passing, not mutation . These are the same insight: both reject independent facts/state as primary, making interaction fundamental. DaoDB implements this—distributed observers correlate through sync, not through shared global state.
Read the article →Datalog is defined by semantics, not syntax : relational foundation, Horn clause logic, stratified negation, bottom-up evaluation, set semantics. Datomic's EDN, Prolog's predicates, SQL's WITH RECURSIVE—all Datalog if the evaluation model matches. Surface representation is irrelevant.
Read the article →DaoDB implements Relational Quantum Mechanics : no global state exists, only local states relative to observers. When isolated devices sync, their conflicting states undergo wave function collapse through CRDT merge—creating correlation, not convergence to pre-existing truth.
Read the article →When ASTs are datoms in DaoDB, the entire program becomes a queryable database . Every optimization transforms from manual tree-walking to declarative Datalog queries—enabling whole-program reasoning, composable analyses, and user-programmable compilation impossible in traditional architectures.
Read the article →One AST maps to many valid syntaxes (Python's list comprehension vs map() vs explicit loop). The renderer must choose, but the choice is arbitrary. The solution: user preferences, heuristics based on context, and diff-aware rendering that preserves the original syntax when semantics haven't changed.
Read the article →How can Java's classes and Clojure's closures share a Universal AST? The semantic differences are different encodings of the same concepts : classes are closures with vtables, exceptions are non-local continuations, null is an optional type. The Universal AST represents the underlying computation, not the surface syntax.
Read the article →The Universal AST looks like assembly —flat, explicit, verbose datom sequences. But it operates at a fundamentally higher abstraction: assembly manipulates machine state, the Universal AST represents program semantics. It's the difference between "move register" and "function application"—low-level form, high-level meaning.
Read the article →When you edit AST directly , text becomes a materialized view—not the canonical code. Syntax becomes a user preference (C-like vs Lisp vs Python), refactoring becomes querying datoms, and collaboration merges AST changes, making text's tyranny obsolete.
Read the article →Traditional wisdom says you must choose between bytecode performance or AST queryability. Datom streams blur this distinction —by compiling ASTs to linear execution streams via Datalog, we achieve bytecode-like speed while preserving full semantic introspection.
Read the article →Chinese dialects are mutually unintelligible, yet all share written characters —meaning in the character, not the sound. Yin.vm's Universal AST is programming's equivalent: languages share semantic representation (datom streams) while varying in syntax. Code becomes portable across languages, just as Chinese text is readable across dialects.
Read the article →ASTs are traditionally static trees, but in Datom.world they're materialized views over datom streams spanning five dimensions: structure, time, types, language transformations, and execution state—making code simultaneously queryable, portable, and alive.
Read the article →Schemas appear to carry meaning, but data is always syntax . Meaning emerges through interpretation. Schemas are secret interpreters: type checkers evaluate, reasoners infer.
Read the article →Unitarity (information preservation) + π-calculus (local communication) explain why communication has a finite speed limit . Instantaneous communication would violate causality and create contradictions in information flow. The speed of light is the architectural parameter enforcing locality in the universe's distributed computation.
Read the article →Good code isn't designed, it evolves through a dance with entropy. By bounding complexity within each module and distributing it outward, code becomes malleable, the only objective measure of quality that matters. Bounded complexity ensures changes stay local and the system remains learnable.
Read the article →Datoms flow as immutable streams that can be folded into state anywhere —phone, WASM, edge nodes. Using Clojure transducers, we process these streams with zero intermediate collections, making distributed computation deterministic and conflict resolution just another transformation.
Read the article →