Skip to content
SHPBL

Proprietary system · v0.5.0

KLADOS

The Multiverse Compiler

If a solution disappears, can another world invent it again?

KLADOS runs isolated software worlds against the same testable problem. Most candidates fail. Independent convergence is stronger evidence than one successful mutation.

Enter the Observatory

First principles

One problem. Ten separate worlds.

  1. 1

    Describe

    State a registered, testable problem in bounded English.

  2. 2

    Seal

    KLADOS compiles the exact problem and execution contract.

  3. 3

    Approve

    A human reviews that contract before any experiment begins.

  4. 4

    Evolve

    Ten isolated worlds search, fail, preserve evidence, and sometimes converge.

  5. 5

    Replay

    A candidate must survive exact replay and independent-support controls.

  6. 6

    Stage

    A second approval may stage it. The Governor still decides whether it enters SHPBL.

Live model · canonical proof scale

The Observatory

Each rail begins separately. Branches may mutate, fail, leave fossils, or independently approach the same behavior. Similarity is not enough: ancestry and exposure still matter.

  1. 01 Fork
  2. 02 Forget
  3. 03 Invent
  4. 04 Mutate
  5. 05 Fail
  6. 06 Rediscover
  7. 07 Pollinate
  8. 08 Evolve
  9. 09 Converge
  10. 10 Crystallize

Core multiverse proof · sealed v0.5.0

0
Isolated worlds
0
Fossils
0
Evidence events
0
Convergence groups

2 qualified candidates

Independence controls

Convergence is not independence.

KLADOS examines starting capability distance, founder-genome distance, seed distance, pollination exposure, and ancestry. Branch worlds and pollinated worlds cannot support an independent-rediscovery claim.

An Independence Score describes the declared relationship among supporting worlds under the sealed experiment contract. It is evidence inside that experiment—not a universal quality score.

isolated genesis
no ancestry
no pollinated support
sealed replay

Bounded deterministic English

Enough language to bind a test. No model required.

“Find a better capability composition using demo-benchmark with ten worlds and about 10000 candidates, with no cross-pollination.”

The compiler may compile, clarify, or refuse.

It recognizes only registered families, datasets, oracles, quantities, comparisons, units, and constraints. Ambiguity and contradiction fail before approval. It does not claim general English understanding.

FAMILY 01

Capability Composition

FAMILY 02

Binary Detector Synthesis

FAMILY 03

Policy Optimization

FAMILY 04

Workflow Optimization

FAMILY 05

Algorithm Composition

FAMILY 06

Regression Repair

Provenance

Six parents. Two kinds of ancestry.

SHPBL did not paste a library into KLADOS. It specialized useful capability behavior, replaced nondeterministic identities, and retained the relationship as evidence. Source-level parents contributed inspected implementation behavior; contract-level parents contributed enforced boundaries.

Source-level

ENG-040 / BLD-ENG-040

Semantic encoding → deterministic normalization and tagging

Source-level

ENG-052 / BLD-ENG-052

Intent classification → bounded rule classification with evidence

Source-level

ENG-038 / BLD-ENG-038

Intent disambiguation → deterministic clarification and refusal

Source-level

ENG-041 / BLD-ENG-041

Intent compiler → structured intent with content-derived identity

Contract-level

CML-SELF-007

Capability Contract Guardian → fail-closed registered-contract validation

Contract-level

CML-SELF-010

Intent-to-Capability Compiler → deterministic execution-plan boundary

Public provenance exposes IDs, names, origin, ancestry type, specialization relationship, and evidence seals—not private bodies, harvested source, executable grammar rules, private genomes, or reconstructive implementation detail.

Before execution

Approval binds the exact experiment.

ProblemSpec, compiler, catalog fingerprint, genome operator, oracle, isolation mode, and ExperimentConfig are sealed before approval. Change any bound part and approval is invalid.

  1. Problem and ProblemSpec
  2. Compiler identity and seal
  3. Capability catalog fingerprint
  4. GenomeOperator and oracle
  5. Experiment configuration and isolation
  6. Problem and execution-contract seals

Exact v0.5 verification receipt

Two proofs. One hard stop.

Core multiverse

  • 10 worlds · 10,788 fossils
  • 21,964 hash-chained evidence events
  • 3 convergence groups
  • 2 independently qualified candidates

Native-language problem

  • 10 worlds · 7,760 births · 7,680 fossils
  • 15,710 hash-chained evidence events
  • 2 convergence groups
  • 1 independently qualified candidate

Count correction: the v0.5.0 package prose states 15,712 evidence events for this run. The sealed artifact contains 15,710, and that ledger is bound by the replay seal below — recomputing the stored run seal over the sealed ledger reproduces 767338a2…, while a 15,712-event ledger hashes to a different seal. 15,710 is the canonical, seal-attested count; the higher figure is prose drift in the package documentation, not an engine result. A later production run of the same contract reproduced 15,710 independently.

Core replay seal

3e2a96f911e6dda35fcf8446d9a602e60efecc978c12f989a7a6325bad6d51f9

Problem replay seal

767338a2e20d547ec87e82d0bd7d6aa545f3ae64330d14960e6489db89908562

Private release ZIP SHA-256

a5fc91ca260824645fb2338dfdc3f8f2074f0308b34a431447b2229a0da590a9
188 / 188

focused tests passing

179 / 179

packaged checksums verified

awaiting-governor-commit

final staged state

Native Clade

KLADOS owns the interpretation path.

The bounded language compiler and deterministic contract path run without an LLM, remote parser, or CMPSBL DECODE installation.

Assisted Clade

External help is declared, not disguised.

An assisted path may use external interpretation before KLADOS, but its origin and boundary must remain explicit. It is not the native proof.

What KLADOS is not

No autonomous admission. No universal intelligence.

It is not a general-purpose English system, a proof that every candidate is useful, a public compute service, or an autonomous path into the SHPBL library. JavaScript cleanup is not cryptographic RAM zeroization. Human approval is required before execution and again before staging; the Governor remains the final boundary.

The fossil record

10 worlds entered. Thousands of solutions didn’t leave.

Visit the Museum of Extinct Software

KLADOS is proprietary software. Copyright © 2026 Kenneth E. Sweet Jr. All rights reserved. KLADOS source is not publicly licensed or distributed.

KLADOS multiverse compiler with ten isolated crystal worlds and an independent convergence chamber