putty miner (lucasevansdev/codex/pig2-edge)#436
Conversation
⏭️ Not selected this roundnot selected for round-e29723845-n1 (rotation: 17 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — matched: no order better or worsePer-order vs champion (same-pin): 0 better · 0 worse · 72 matched · 0 new — matched Identical output to the champion on all 72 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output. Machine-readable per-order detail: |
5b41313 to
c98c1dd
Compare
⏭️ Not selected this roundnot selected for round-e29723862-n1 (rotation: 17 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723875-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723886-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_6c4a712ed445 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 70 matched · 0 new — matched Identical output to the champion on all 70 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
c98c1dd to
9500dde
Compare
⏭️ Not selected this roundnot selected for round-e29723931-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723936-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723983-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
9500dde to
5af87d9
Compare
⏭️ Not selected this roundnot selected for round-e29724021-n1 (rotation: 25 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_b4eae999e912 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 70 matched · 0 new — matched Identical output to the champion on all 70 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
➖ Matched the champion — no order improved — outranked: sub_e1428b5d18e4 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 69 matched · 0 new — matched Identical output to the champion on all 69 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
⏭️ Not selected this roundnot selected for round-e29724095-n1 (rotation: 23 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
5af87d9 to
9814a3c
Compare
⏭️ Not selected this roundnot selected for round-e29724132-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29724169-n1 (rotation: 23 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29724206-n1 (rotation: 23 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_9450c7cb4f01 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 72 matched · 0 new — matched Identical output to the champion on all 72 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
9814a3c to
cc978d6
Compare
⏭️ Not selected this roundnot selected for round-e29724243-n1 (rotation: 22 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
Closed — a new champion was elected
Rebase your fork onto the latest |
Base DEX routing solver.