Expand description
2026-09-25: Spine-plus-hedge draft trees for tree speculative decoding: the tree shape, its verify-row layout and the accepted path.
Owner: model-layers (speculative). Invariants:
TreeShape::parsereturns only shapes that passvalidate: every depth holds 1..=MAX_RANKnodes, and the tree holds at mostMAX_NODES.TreeDraft::rowsputs the root at row 0, the spine at rows1..=Lin depth order, then the hedges in the order ofhedges.
A tree is a spine (the drafter’s top-1 chain) plus hedge leaves: lower-ranked
siblings of spine nodes, with no children. So every node’s parent is the
root or a spine node. A shape is a comma-separated list of per-depth node
counts, e.g. "1,2,2,2": depth d holds one spine node and count_d - 1
hedges, and the verify width is the node count plus the root row.
Structs§
- Hedge
Node - 2026-09-25: One hedge leaf: the drafter’s rank-
rankcandidate atdepth. - Tree
Draft - 2026-09-25: A proposed draft tree for one verify step.
- TreeRow
- 2026-09-25: One verify row. Row 0 is the root.
- Tree
Shape