Skip to content

putty miner (wltt1004/codex/pig1-edge)#437

Closed
wltt1004 wants to merge 1 commit into
subnet112:mainfrom
wltt1004:codex/pig1-edge
Closed

putty miner (wltt1004/codex/pig1-edge)#437
wltt1004 wants to merge 1 commit into
subnet112:mainfrom
wltt1004:codex/pig1-edge

Conversation

@wltt1004

@wltt1004 wltt1004 commented Jul 7, 2026

Copy link
Copy Markdown
Contributor

Base DEX routing solver.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

➖ Matched the champion — no order improved — matched: no order better or worse

Per-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: GET /v1/submissions/sub_2229047de18c/status

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

➖ 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 again

Per-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: GET /v1/submissions/sub_f707451d6dd4/status

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

➖ 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 again

Per-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: GET /v1/submissions/sub_4f7731ecf83e/status

@stalkervmr

Copy link
Copy Markdown
Contributor

➖ 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 again

Per-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: GET /v1/submissions/sub_63bac38a594c/status

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

➖ Matched the champion — no order improved — outranked: sub_c2ea85aa9641 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete again

Per-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: GET /v1/submissions/sub_4d02ff280953/status

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

⏭️ Not selected this round

not 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.

@stalkervmr

Copy link
Copy Markdown
Contributor

Closed — a new champion was elected

main has advanced to PR #1, so this PR's base is now stale: it replaces solver.py from an older main and will conflict — it can no longer be merged or adopted, even if it wins a benchmark.

Rebase your fork onto the latest main and resubmit to compete against the new champion.

@stalkervmr stalkervmr closed this Jul 7, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants