Formal
verification
for
bioinformatics.
We’re exploring new ways to make computational research more reliable.
Verified animation
Each visit shows one of 25 runs. Lean checks that, in every run:
- Origins start on their time slots
- A point’s time is its parent’s time plus the link’s length
- A tree that meets no other stops at 25 branches
- A point belongs to one tree at a time
- Trees join where their waves meet
Lean then proves that each point’s time is its origin’s start plus the length of its path along the tree’s branches. The canvas drawing is outside the proof.