Data structureadvanced
Diffracting tree
Binary tree of balancers with prism elimination that spreads tokens to counter leaves with low contention.
Binary tree of balancers with prism elimination that spreads tokens to counter leaves with low contention.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 8G5PTB Edit this page History Report an error