Udanax-Gold vs. OpenXanadu vs. Xudanu

A detailed comparison of three Xanadu-lineage systems: the 1998 open-sourced codebase, the 2014 web demo, and the 2026 independent implementation.

Disclaimer: Xudanu is an independent, open-source project (Apache 2.0). It is not affiliated with, endorsed by, or sponsored by Ted Nelson, Project Xanadu™, the Xanadu Operating Company, Autodesk Inc., or the Udanax development team. All trademarks belong to their respective owners.
1. Timeline: 60+ Years of Xanadu 2. At a Glance 3. Udanax-Gold (1998) — Architecture — Strengths — Limitations 4. OpenXanadu (2014) — What It Is — Strengths — Limitations 5. Xudanu (2026) — Architecture — Strengths — Limitations 6. Feature-by-Feature Comparison 7. Data Structures: Enfilades vs. O-Tree 8. Networking: Xanadu Protocol vs. HTTP + Tumblers 9. What Xudanu Inherits from Gold 10. What Xudanu Does Differently 11. The 17 Rules: Compliance Scorecard 12. Verdict

1. Timeline: 60+ Years of Xanadu

AUTODESK ERA (1983–1992) INDEPENDENT ERA (1995–present) 1960 Nelson's idea 1974 Computer Lib 1983 Autodesk backs 1988 Green demo at Hackers Conf. 1992 Autodesk divests 1995 "Curse of Xanadu" 1998 Project Udanax Green (C) + Gold (Smalltalk/C++) 2007 XanaduSpace 1.0 2014 OpenXanadu web demo 2026 Xudanu v1.0.1 Apache 2.0

Timeline of major events in the Xanadu lineage. Labels alternate above and below the line to avoid overlap. Gold marks the open-sourced code; blue marks the web demo; green marks Xudanu.

2. At a Glance

  Udanax-Gold 1998 OpenXanadu 2014 Xudanu 2026
Creator Xanadu Operating Company (Gregory, Miller, et al.) Ted Nelson (solo / small team) Independent developer (Jones D.)
License Xanadu X11 (source-visible, proprietary) Not open source — "you can see all the parts" Apache 2.0
Language C/C++ (Smalltalk cross-compiled, period toolchain) JavaScript (static web page) Rust + React/TypeScript
Status Archived (~1999) Static demo at xanadu.com Active development (v1.0.1)
Buildable? Buildable with effort — period C++ toolchain, complex deps, minimal build docs Loads in browser, but "takes a while" cargo build + npm install
Backend Custom server with enfilade storage None (static files) Async Rust (tokio + axum + WebSocket)
Database Custom enfilade-based backend N/A Content-addressed chunk store + WAL + manifest
Concurrency Lock-based (work grabbing) None Real-time CRDT (O-tree) with live presence
Crypto Session auth, access controls None Ed25519, Argon2, BLAKE3, ChaCha20-Poly1305, TLS
Cross-server Theoretical (custom protocol) None Domain tumblers + HTTP + hash verification

3. Udanax-Gold 1998

In 1998, facing the irrelevance brought by the Web's dominance, the Xanadu team released their source code as Project Udanax — two codebases:

This document focuses on Gold, which contains the advanced algorithms (enfilades, intercomparison, royalties) that influenced Xudanu's design. The release was under the Xanadu X11 license, which is source-visible but not open source by modern definitions (OSI-incompatible due to restrictions on derivative works).

The release had a dual purpose: to establish prior art against software patents, and to let the world see what Xanadu actually was after 38 years of vaporware accusations.

Architecture

Frontend (C++) C++ client (Smalltalk cross-compiled) Xanadu Protocol Udanax Server Enfilade Tree Tumbler Addressing Work Grabbing (locks) Royalty Tracking Version Management Key Algorithms Enfilade — B-tree-like with cranking, umbing, and splay operations Tumblers — Transfinite number addressing for global content references Transclusion — Virtual copies via enfilade span references Again() — Recursive provenance walk through transclusion chains Intercomparison — Side-by-side visual comparison of document versions Royalty System — Micropayment tracking per transclusion access

Udanax-Gold architecture: monolithic C++ server with enfilade-based storage and the full Xanadu algorithm suite.

Strengths

Limitations

4. OpenXanadu 2014

In 2014, Ted Nelson released OpenXanadu as a web page at xanadu.com. Despite the name, it was explicitly not open source — the site stated it was "open" in the sense that "you can see all the parts." It was described as "a working deliverable," the first in 54 years of Project Xanadu's history.

The demo showed parallel documents — multiple source documents displayed side-by-side with visible transclusion connections between them. A user could see how a passage in one document was quoted or derived from another, with the connections drawn as visible lines.

Key distinction: OpenXanadu is a demonstration, not a platform. It has no backend, no API, no storage, no collaboration, and no source code release. It shows what the Xanadu experience looks like without providing the infrastructure to build it.

What It Is

AspectDetail
FormatStatic web page with pre-built documents
ContentSample documents (e.g., "Origins" by Moe Juste) with visible transclusion links
Large downloads required ("takes a while to open because it's downloading a lot")
InteractionView only — no editing, no creating new documents, no linking
Transclusion displayParallel documents with visible connections between matching passages
Source codeNot released; client-side JavaScript is visible but not licensed for reuse

Strengths

Limitations

5. Xudanu 2026

Xudanu began as a direct reading of the Udanax-Gold C++ source, migrating concepts into Rust. Early development followed Gold's design closely. The project then diverged significantly: the adoption of BLAKE3 for content hashing opened the door to verifiable cross-server content (impossible in Gold's trust model); React and WebSocket replaced the traditional client architecture; and most fundamentally, the O-tree CRDT with inline transclusion elements replaced the enfilade as the core data structure. Many components from Gold were dropped along the way — the FeBe protocol, the enfilade tree, the Smalltalk cross-compilation pipeline. What remains is the conceptual DNA: tumblers, transclusion, typed links, bidirectional connections, provenance tracing, and the principle that links are unbreakable.

Architecture

Frontend React 19 + TypeScript Vite 8 + Vitest Canvas overlay rendering HTTP + WebSocket + TLS Xudanu Server (Rust) O-Tree CRDT (concurrent) Domain Tumblers (DNS-based) Typed Links (6 types) Transclusion (inline, 32-level) BLAKE3 Content Verification Ed25519 Attribution Tamper-evident Audit Log Chunk Store + WAL Key Innovations over Gold O-Tree CRDT — Position-based CRDT replacing enfilades; supports concurrent edits Domain Tumblers "server.com".work.rev.edition — DNS-routable, human-readable Cross-Server (FR-7) — HTTP fetch + BLAKE3 verify + Ed25519 TOFU trust model Link Descriptions — Typed margin annotation boxes with resolve/edit/lifecycle Span Migration — Links and annotations survive text edits via O-tree positions Real-time Presence — Live multi-user editing with cursor awareness Compound Documents — Inline transclusion in O-tree (single source of truth)

Xudanu architecture: modern async Rust backend with CRDT editing, React frontend, and cross-server networking.

Strengths

Limitations

6. Feature-by-Feature Comparison

Feature Udanax-Gold OpenXanadu Xudanu
Tumbler addressing Full numeric tumblers (transfinite) Display only Domain-based ("server.com".w.r.e)
Transclusion Enfilade span references Static visual display Inline O-tree elements, 32-level resolution
Typed links Unidirectional links N/A 6 types (Comment, Reference, Disagreement, Quotation, See Also, Web)
Bidirectional links Yes — visible from both ends N/A Yes — backlinks + cross-server backlinks
Version management Deep versioning via enfilade None Revision timeline + ancestors/descendants
Provenance tracing again() recursive walk None again() equivalent + link chain + UI modal
Real-time editing Lock-based (work grabbing) None (view-only) CRDT (O-tree) with live presence
Royalties / micropayments Full system, built into protocol None Byte tracking + Transcopyright licensing (no payment mechanism)
Intercomparison Side-by-side version comparison None Side-by-side + bezier connections + coverage metrics + AI narration
Cross-server content Theoretical (custom protocol) None HTTP + BLAKE3 + Ed25519 TOFU
Content verification Server-trusted None BLAKE3 hash on every cross-server fetch
Attribution signatures None None Ed25519 per-author, verified on load
Annotations Basic None Per-user, private/public, bold/italic, link descriptions
Span migration Via enfilade positions N/A O-tree positions survive arbitrary edits
Audit trail None None Chained security log (tamper-evident)
Search Within-document None Within-doc + global text search
Trails No No Curated document sequences with categories
Document graph No No Force-directed work relationship graph
Identity Session-based None Club-based + OAuth (GitHub, Google)
Access control Publication + work grabbing None Owner / published / edit-open / read-club / edit-club
Archival No No Ghost works (content retained, source hidden)
Test coverage Unknown / minimal None 2,444 backend + 412 frontend tests

7. Data Structures: Enfilades vs. O-Tree

The most fundamental architectural difference is the underlying data structure for storing document content.

Enfilade (Udanax-Gold)

A B-tree-like structure where each node stores a portion of the document with associated position information. Key operations include:

  • Cranking — rebalancing the tree for locality of reference
  • Umbing — splitting and merging nodes to maintain density
  • Splaying — moving frequently-accessed nodes closer to the root

Enfilades provide efficient insert, delete, and lookup over arbitrarily large documents, and their tree structure naturally supports versioning (each revision is a new root).

O-Tree CRDT (Xudanu)

A position-based CRDT using the space algebra (region/displacement). Each character has a position that is:

  • Immutable — once assigned, a position never changes
  • Orderable — positions define a total order without coordination
  • Concurrent-safe — multiple users can insert simultaneously without conflict

The O-tree supports inline transclusion elements, span migration (positions survive edits), and attribution tracking (each span knows who wrote it).

Trade-off: Enfilades give better deep versioning (every revision is a tree snapshot) and have 30+ years of theoretical backing. The O-tree CRDT gives better concurrency (no locks needed) and integrates naturally with the web (positions are stable across HTTP requests). Xudanu chose concurrency over deep versioning — revisions are stored as snapshots, not as parallel tree paths.

8. Networking: Xanadu Protocol vs. HTTP + Tumblers

  Udanax-Gold Xudanu
Protocol Custom binary protocol (postcard-like wire format) HTTP/REST for API + WebSocket for real-time sync
Content addressing Numeric tumblers (1.5.3.10.7) Domain tumblers ("alice.com".5.3.10.7) — DNS-routable
Cross-server Theoretical — required all servers to speak Xanadu protocol Pragmatic — servers expose /api/public/work/{id} over HTTP
Content verification None — trusted the server BLAKE3 hash on every fetch — forgery is cryptographically impossible
Trust model Implicit (server-to-server trust) Ed25519 TOFU (Trust On First Use) — like SSH known_hosts
Privacy None (plaintext) HTTPS preferred (supports_https field, refuse downgrade)
SSRF protection N/A is_ssrf_address() blocks loopback, private ranges, metadata endpoints

9. What Xudanu Inherits from Gold

Despite sharing no code, Xudanu draws heavily on the conceptual framework established by Udanax-Gold:

Concept from Gold How Xudanu implements it
Tumblers Domain-based tumblers instead of pure numeric — "server.com".work_id.revision.edition. The domain prefix makes tumblers self-routing via DNS.
Transclusion Inline RangeElement::Transclusion in the O-tree CRDT. 32-level recursive resolution with cycle detection. Span migration through arbitrary deltas.
Typed links Extended to 6 visual types (Comment, Reference, Disagreement, Quotation, See Also, Web Link) with coloured markers, margin bars, and description boxes.
Provenance (again()) work_transclusion_chain API walks the O-tree recursively, returning a numbered chain with author info and text excerpts.
Bidirectional links Links are visible from both endpoints. Backlinks are tracked. Cross-server backlinks notify the origin server via HTTP POST.
Span migration O-tree positions are immutable. Links store start_position / end_position which survive edits. Excerpt search is a fallback only.
Royalty concept record_royalty tracks byte counts on every cross-server content fetch. No payment mechanism yet, but the accounting infrastructure exists.

10. What Xudanu Does Differently

Concurrency

Gold used work grabbing — pessimistic locking where one user "grabs" a work, preventing all others from editing. Xudanu uses a CRDT — any number of users can edit simultaneously, with changes merged automatically. This is the single biggest user-facing difference.

Networking

Gold envisioned a native Xanadu network with all servers speaking the Xanadu protocol. Xudanu uses HTTP + domain tumblers — any web server can participate. BLAKE3 verification replaces trust.

Cryptography

Gold had no content verification — you trusted the server. Xudanu has Ed25519 attribution signatures (every span is signed), BLAKE3 content hashes (every cross-server fetch is verified), and a tamper-evident audit log.

Visual link system

Gold had transclusion markers but no margin annotation system. Xudanu adds coloured description boxes with dotted connecting lines (anchored to the underline of the source text, not the centre), lane separation for overlapping links, resolve/edit/delete lifecycle, and type filtering.

What's missing

Gold's intercomparison (side-by-side visual document comparison) has no Xudanu equivalent yet. The royalty payment system is stubbed but not functional. Deep versioning (every revision as a parallel tree path) is replaced by snapshot-based revisions.

OpenXanadu's contribution

OpenXanadu showed what parallel documents with visible transclusion connections look like. This visualization is the eventual goal for Xudanu's compound document viewer — but interactive and live, not static.

11. The 17 Rules: Compliance Scorecard

Ted Nelson defined 17 requirements for a true Xanadu system. Here's how each implementation measures up:

# Rule Udanax-Gold OpenXanadu Xudanu
1Every server uniquely and securely identifiedPartial✓ Ed25519 key
2Server can operate independently or in a network
3Every user uniquely and securely identifiedSession✓ Club + OAuth
4Users can search, retrieve, create, store documentsView only
5Documents can contain any data typeText only✓ Text + images + blobs
6Documents can contain links/transclusions to any otherDisplay
7Links visible and followable from all endpoints✓ Backlinks
8Permission to link granted by act of publication✓ Publish/unpublish
9Royalty mechanism at any granularityByte tracking + TCo license
10Every document uniquely and securely identified✓ Tumblers✓ Tumblers + hash
11Secure access controls on documents✓ Read/edit clubs
12Rapid search, store, retrieve without knowing location✓ Global search
13Documents moved to storage appropriate to access frequency
14Documents stored redundantly for disaster recovery✓ Chunk store + WAL + offsite backup
15Service providers can charge for storage/retrieval
16Transactions secure and auditable only by parties✓ Audit log
17Client-server protocol is openly publishedSource✓ Open source
Score (fully meets) 10 / 17 0 / 17 13 / 17

12. Verdict

Udanax-Gold

The reference implementation. Conceptually complete but technologically frozen. It contains the only working versions of several key algorithms (enfilade cranking, intercomparison, royalty system). Its value today is primarily as inspiration and prior art — a design document in code form. It cannot be built, deployed, or extended without significant archaeological effort.

OpenXanadu

The demo. It proves that Ted Nelson's visualization ideas work — parallel documents with visible transclusion connections are comprehensible and compelling. But it's a screenshot, not a system. No source code, no backend, no editing, no collaboration. Its anti-Web rhetoric and "not open source" status limit its influence.

Xudanu

The practical implementation. It takes the concepts that Gold proved and OpenXanadu visualized, and makes them buildable, deployable, and usable. The trade-offs are clear: enfilades replaced by CRDTs (concurrency over deep versioning), custom protocol replaced by HTTP (accessibility over purity), theoretical royalties replaced by byte tracking (accountability without payments).

Xudanu doesn't claim to be "true Xanadu" — it's an independent interpretation of the concepts, built with modern tools, released under a proper open-source license, and designed to be actually used rather than merely admired. The 17-rules scorecard shows it meeting 13 of 17 fully, with clear paths forward for the rest.

The biggest gaps — automatic storage tiering (Rule 13) and the royalty payment system (Rule 9) — are acknowledged limitations with planned roadmaps. The biggest advantages — real-time CRDT collaboration, modern cryptography, cross-server hash verification, intercomparison with bezier connections, and the visual link description system — are features that neither Gold nor OpenXanadu ever had.