Idea

Verification methods and their boundaries

From a check to a proof

Tests show that the inputs you tried passed. Here you state a property in Bosatsu and check it against the compiled code, and each result says how much it covered.

Run a state-machine check →See a finite law check →

System property / Spec

Can a sequence of operations reach a bad state?

yichus spec explores bounded operation schedules and reports any it finds.

Run the current state-machine example →

Function property / Law

Does a calculation obey a rule for every input?

yichus law samples inputs or tries every value of a finite type; yichus lean checks a theorem.

Read and run a complete law example →

What does each result establish?

01 / sampledThese inputs passed

Useful for finding concrete defects. A new input can still fail.

02 / finite domainEvery value in the recorded scope passed

Complete for an enumerated type, or exactly the distinct values the author listed. An unfinished witness stays inconclusive.

03 / TLC model · TLC hostNo bad state in a completed search of the case's handler model

The model is translated from the compiled handlers for one finite case, and its counterexamples replay natively. The case's requests, times and budgets limit the claim. A cutoff or an unreached witness is inconclusive.

04 / Lean theorem · proof hostThe generated statement has a checked proof

The receipt names the source, theorem, toolchain, and admitted Bosatsu-to-Lean translation.

Try the checks

This law check finds an over-enrollment bug in registration.bosatsu (Node 20+):

curl -O https://yich.us/demos/laws/registration.bosatsu
npx yichus@0.3.9 call api_law_check --source registration.bosatsu --expect /allHold=true

Ask your agent about anything here; it has the detail.

Where this fits