Engine a103b3db3 Measured Source Axeyum fact ledger and implementation documentation

After reading this guide, you should be able to

Learning objectives

  • Identify the parts of Axeyum that are relevant to applied and computational reasoning.
  • Distinguish implemented results from the current research frontier.
  • Open a lesson or artifact that provides the underlying definitions and evidence.

Current state

How do search, symbolic computation, and proof checking cooperate?

The SAT solver produces DRAT evidence. The SMT solver handles Boolean structure, bit-vectors, floating point, strings, arrays, uninterpreted functions, and several arithmetic fragments with uneven coverage by theory. The computer algebra system produces operation-specific certificates for exact symbolic work.

Selected results are reconstructed as proof terms for the Lean-style kernel. Accepted facts enter a ledger with their evidence, assumptions, provenance, and dependency edges. External solvers and proof systems are comparison tools and test oracles, not runtime components of the default path.

Why it matters

What the current work makes possible

  • Several reasoning modes share evidence formats and one record of accepted facts.
  • Models are replayed against original terms after solver lowering.
  • Certificate checkers can be smaller than the searches that produce their inputs.
  • The artifact pages expose successful and declined routes at the level of individual facts.

Results to inspect

Open the evidence

Search all artifacts

What comes next

Extend the present base

The immediate work is broader SMT-LIB coverage, faster search, stronger certificate production, and more reconstruction routes into the kernel.

Longer-term work can let accepted results support new automated tasks while preserving the source, trust boundary, and checker outcome for each step.

Where to begin

Read the underlying lessons