Let meaning propose.
Let evidence decide.
A walk through context. A verdict from premises.
Every conclusion has a path you can inspectβand retract.
Converse β Chat with live auditable reasoning
Ask factual questions, explore counterfactuals, or teach premises. Every answer undergoes multi-hop deductive proof search and adversarial checks with zero hallucination.
Establish a world
Only these assertions can ground a conclusion. Dreamt premises remain tainted through every inference.
Supported language
the battery is chargedthe battery is not chargedif A and B then Call birds have feathersa robin is a bird
Grounded means asserted in this world; it is not independent verification of reality. Ambiguous syntax is refused.
Propose & resolve
Proof begins with a question.
Resolve a proposition to reveal its evidence.
Or walk the lattice to compare generated candidates.
Follow the evidence
Derived conclusions will appear here.
Inside the context lattice
A word is placed by its neighbours, relation and role. Select a token to inspect the six coordinates.
Grow the corpus
Teach the lattice with external text. Corpus learning changes available paths; it does not establish facts in the world.
Learn before imagining
Grounded facts first. Then language obligations, composition, and long proofs. Each stage must pass its acceptance probes before the next begins. Teaching language examples does not assert their content as fact.
Proof school Β· 1 β 50 inference steps
Grounded chains must allow. Missing links, invented roots, circular reasoning, and retracted evidence must refuse. These are controlled microworlds, not claims of general intelligence.
Dream, settle, verify
While the engine is idle, explore recalled facts, random sequences, slot substitutions, splices, reversals, half-words, and letters. A dream survives only when grammar, context, debt, retrieval, and the live proof gate agree.
Why attempts were forgotten
Rejected text is not retained. Promotions keep their proof dependencies and disappear when those dependencies fail. Dream text is never inserted as an independent world premise or fed back into the source corpus.
Internal retrieval + deterministic proof
Retrieve exact subjects, predicates, and related rules. Then verify against the entire live world, so a retrieval window cannot conceal contradictions. A 50-step proof is accepted only when all of its dependencies are established.
Enter a statement to inspect the verification obligations and supporting chain.
External Verification Bridge Β· Tamper-Evident Receipts
The Teacher proposes hypotheses and counterexamples (marked ungrounded). The External Verifier checks claims against evidence and issues signed receipts with content digests that Debtaur safely ingests as stated premises.
01. External Verifier & Receipt Issuer
No receipt issued yet.
02. External Teacher (Ungrounded Hypotheses)
Teacher agreement alone never authorizes claims.
"Better than Astra" Held-Out Benchmark
Comparing Debtaur's deterministic provenance architecture against ungrounded / probabilistic LLMs across 5 critical epistemic dimensions: Correctness, False Authorisation resistance, Useful Abstention, Evidence Learning, and Withdrawal Recovery.
Head-to-Head Comparison: Debtaur vs Astra
Inspect Detailed Benchmark Cases
Explore a future. Rewind the path.
Cone explores up to 1,000 child expansions with a frontier of eight states. The independent judge prunes completed proposals. Scrub any recorded state to reconstruct its path. Hypothetical states never authorise actions in the live world.
The reversible trace will appear here.
Measured locally: 1,000 state writes β58 ms; rewind β0.25 ms; replay β9.9 ms. Timings vary. These state transitions are not 1,000-step proofs.
Independent JavaScript reference engine. No LLM, remote model, or hidden judge fallback. Seeded dream exploration is replayable. Native C / WebAssembly parity and edge deployment are not part of this running build.