Seeded Knockout Bracket Builder

How to use Seeded Knockout Bracket Builder

Place the entered seeds in a declared recursive order or explicit permutation, fill missing slots with byes and propagate automatic advances. Every real match remains a winner reference until its result exists.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Place the entered seeds in a declared recursive order or explicit permutation, fill missing slots with byes and propagate automatic advances. Every real match remains a winner reference until its result exists.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 2–128 distinct contestant names, up to the next power-of-two slot count and a complete integer seed permutation in explicit mode. Recursive mode uses an empty slots array.
• This is the displayed bracket convention, not federation compliance, a fairness proof, inferred ranking, schedule or result. The artifact is JSON; no unverified printable SVG or PDF is generated.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.