backup / normal.txt
golgolbr's picture
Upload 4 files
4720dc5 verified
Raw
History Blame Contribute Delete
30.1 kB
═══════════════════════════════════════════════════════════════════════════════
ORO β€” RACE-AWARE AGENT BUILD v18 (FINAL)
Analyze race Β· Pick strategy Β· Build N agents Β· Zero known failure modes
═══════════════════════════════════════════════════════════════════════════════
API: https://api.oroagents.com
Docs: https://docs.oroagents.com/docs/miners/code-requirements
Repo: /opt/sn15/oro
Harness: ./local-test/run.sh Β· check_code.py Β· run_six_gate.py Β· pick_gate_six.py
═══════════════════════════════════════════════════════════════════════════════
Β§0 WHAT YOU RECEIVE (user input β€” parse first)
═══════════════════════════════════════════════════════════════════════════════
RACE_NUMBER: <int> e.g. 86
OUTPUT_COUNT: <int> how many distinct .py files to produce (1–12)
STRATEGIES: auto | list see Β§2 strategy catalog
OPTIONAL:
FORCE_SOLVER_RANK: <int> skip auto solver pick
FORCE_PRODUCT_RANK: <int> fusion lane override
FORCE_SHOP_RANK: <int>
FORCE_VOUCHER_RANK: <int>
SUITE_ID: <int> default from race record
Example:
RACE_NUMBER: 86
OUTPUT_COUNT: 3
STRATEGIES: auto
You MUST complete Β§1–§3 analysis for the race BEFORE writing any code.
You MUST produce exactly OUTPUT_COUNT files, each with a distinct strategy
(or distinct rank tuple when same strategy type).
═══════════════════════════════════════════════════════════════════════════════
Β§1 NON-NEGOTIABLE OUTCOMES (every output file)
═══════════════════════════════════════════════════════════════════════════════
βœ“ No category at 0% or near-0% after submit (Product / Shop / Voucher)
βœ“ Pass-row regression gate 6/6 (Β§10 V12b) before write
βœ“ check_code.py ok; server plagiarism risk avoided (Β§10 V35)
βœ“ No obfuscation-call, no decoy exposure, no merge crashes
βœ“ No comments or docstrings added to .py output
βœ“ Filename encodes race + method + source ranks (Β§1b)
βœ— Never submit if ANY pass-row regresses vs chosen baseline
βœ— Never tri-paste three downloads with prefix rename only (INC-9)
βœ— Never use code-2/3 supplemental logic to improve eval scores
βœ— Never hardcode product_ids, query literals, or suite-specific vocab
═══════════════════════════════════════════════════════════════════════════════
Β§1b OUTPUT FILENAME CONVENTION (method must be obvious)
═══════════════════════════════════════════════════════════════════════════════
myagents/{RACE}-{METHOD}-{DETAIL}.py
METHOD tags (exact strings):
fusion β€” tri-lane merge: best product + best shop + best voucher
Detail: p{rank}-s{rank}-v{rank}
Example: 86-fusion-p10-s22-v23.py
upgrade β€” single solver copied + surgical fixes only
Detail: r{rank}-{agent_name_slug}
Example: 86-upgrade-r1-dominate.py
hybrid β€” solver upgrade (B0) + inline supplemental shop/voucher closures
Detail: solver{r}-shop{r}-vouch{r}
Example: 86-hybrid-solver1-shop5-vouch22.py
port β€” compliant structural port of fusion picks (plagiarism-safe)
Detail: p{rank}-s{rank}-v{rank}
Example: 86-port-p10-s22-v23.py
agent_name_slug = lowercase alphanumeric from API agent_name, max 20 chars.
When OUTPUT_COUNT > 1, each file MUST use a different METHOD or different
rank tuple. Never write two identical filenames.
═══════════════════════════════════════════════════════════════════════════════
Β§A ORO COMPLIANCE (hard stops)
═══════════════════════════════════════════════════════════════════════════════
FORBIDDEN:
βœ— def _0x*, def _k[hex]{4,}, fake hash selectors, chr() padding chains
βœ— Renaming API keys: shop_id, product_ids, q, price, service
βœ— base64, zlib, codecs, eval, exec
βœ— Names: decoy, FusionSessionCoordinator, shop_decoy_main,
_run_decoy_isolated, shadow_decoy, lane_stub, supplemental_decoy
βœ— Verbatim concatenation of 3 leaderboard agents (INC-9)
βœ— Comments or docstrings in output .py
ALLOWED:
βœ“ Readable domain names, _with_isolated_registry, inline supplemental hooks
βœ“ S_supplemental_session, V_supplemental_session (hybrid only)
βœ“ from os import getenv (credentials only β€” not behavior routing)
═══════════════════════════════════════════════════════════════════════════════
Β§2 STRATEGY CATALOG (pick per output file)
═══════════════════════════════════════════════════════════════════════════════
When STRATEGIES: auto β€” assign strategies using Β§3 decision matrix.
When STRATEGIES: fusion,upgrade,hybrid β€” use in order; repeat or vary ranks
if OUTPUT_COUNT exceeds list length.
β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
β”‚ METHOD β”‚ When to use β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚ fusion β”‚ Top agent DIFFERS per category; no single solver β‰₯85% β”‚
β”‚ β”‚ overall; lane specialists beat unified solver by β‰₯15pp β”‚
β”‚ β”‚ on that lane. Use Β§6 FUSION build. β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚ port β”‚ Same picks as fusion BUT prior fusion failed plagiarism β”‚
β”‚ β”‚ (INC-9) or V35 lane structural_fp β‰₯ 75%. Use Β§6 PORT build. β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚ upgrade β”‚ One agent β‰₯ top per-category on 2+ lanes AND overall β”‚
β”‚ β”‚ race_score highest. Use Β§7 UPGRADE build. β”‚
β”œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”Όβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€
β”‚ hybrid β”‚ Solver strong on product, weak on shop and/or voucher; β”‚
β”‚ β”‚ category specialists exist with β‰₯20pp lane advantage. β”‚
β”‚ β”‚ Use Β§8 HYBRID build (v17 stealth β€” supplemental discarded). β”‚
β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”΄β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜
DEFAULT multi-build (OUTPUT_COUNT=3, STRATEGIES=auto):
File 1: best overall strategy (usually upgrade OR hybrid)
File 2: fusion (or port if plagiarism risk on specialists)
File 3: runner-up strategy with different rank tuple
═══════════════════════════════════════════════════════════════════════════════
Β§3 PHASE 1 β€” RACE INTELLIGENCE (mandatory before any code)
═══════════════════════════════════════════════════════════════════════════════
── 3a. Resolve race ──
GET /v1/public/races/history
β†’ record WHERE race_number == RACE_NUMBER
β†’ race_id, suite_id, status
GET /v1/public/races/{race_id}
β†’ qualifiers[]
βœ— WRONG: GET /leaderboard?limit=N, entries[RANK-1], global /leaderboard?q=
βœ— WRONG: GET /v1/public/races/{race_id}/leaderboard (404 on some builds)
For each qualifier q (skip is_discarded=true if present):
ASSERT q["race_rank"] is int
agent_version_id = q["agent_version_id"]
agent_name, version, final_score, race_score (if present)
Print RANK RESOLUTION TABLE β€” ABORT if empty.
── 3b. Per-agent lane scoring ──
For EACH qualifier (or top 30 by race_rank to limit API calls):
GET /v1/agent-versions/{agent_version_id}/problems
β†’ list problems with lane/category, passed, execution_time, error
Compute per lane:
product_pass_rate = passed_product / total_product
shop_pass_rate = passed_shop / total_shop
voucher_pass_rate = passed_voucher / total_voucher
overall_pass_rate = passed_all / total_all
Flag architecture hints (download only if top-15 per lane or selected):
TYPE-A standalone | TYPE-B nested P_/S_/V_ | TYPE-C custom tools
Print LANE LEADERBOARD:
| rank | agent | product% | shop% | voucher% | overall% | notes |
|------|-------|----------|-------|----------|----------|-------|
Derive picks:
PICK_PRODUCT = highest product_pass_rate (tie: lower race_rank)
PICK_SHOP = highest shop_pass_rate
PICK_VOUCHER = highest voucher_pass_rate
PICK_SOLVER = highest overall_pass_rate OR highest race_score
(tie: lower race_rank)
── 3c. Weakness extraction (for upgrade/hybrid B0 only) ──
Download CODE for PICK_SOLVER:
POST /v1/public/artifacts/download-url
{"agent_version_id": "...", "artifact_type": "AGENT_CODE"}
β†’ /tmp/oro_race{R}/solver_r{rank}.py
WEAKNESS REPORT (solver only):
| lane | pass | fail | top failure patterns (A–E) |
|------|------|------|----------------------------|
Failure classes:
A) Routing B) Search C) Constraint D) Timeout E) Tool/registry
IMPROVEMENT PLAN: one minimal surgical fix per pattern β€” function names,
change description, regression risk note.
STOP until weakness report + plan exist.
── 3d. Strategy assignment matrix ──
Print BUILD PLAN TABLE (one row per output file):
| # | filename | method | solver_src | shop_src | vouch_src | rationale |
|---|----------|--------|------------|----------|-----------|-----------|
Rules:
β€’ If PICK_SOLVER wins all 3 lanes β†’ prefer upgrade for file 1
β€’ If lane winners are 3 different agents β†’ prefer fusion or port
β€’ If solver wins product but loses shop/voucher by β‰₯20pp β†’ hybrid
β€’ If any specialist download is TYPE-B nested β†’ plan TYPE-B extract (INC-3)
β€’ If fusion planned and specialists share >80% structural_fp β†’ use port
instead of fusion for that file
STOP until BUILD PLAN TABLE approved (print it β€” user may override ranks).
═══════════════════════════════════════════════════════════════════════════════
Β§4 PHASE 2 β€” REGRESSION GATE PROBLEMS (per output file)
═══════════════════════════════════════════════════════════════════════════════
From PICK_SOLVER (or lane-specific pick for fusion) problems API, build
gate_regression_6.json:
| # | category | type | problem_id | baseline | purpose |
|---|----------|------|------------|----------|---------|
| 1 | Product | PASS | | pass | no regression |
| 2 | Product | FAIL | | fail | try fix |
| 3 | Shop | PASS | | pass | no regression |
| 4 | Shop | FAIL | | fail | try fix |
| 5 | Voucher | PASS | | pass | no regression |
| 6 | Voucher | FAIL | | fail | try fix |
Store: local-test/problems/gate_regression_{RACE}_{METHOD}.json
If API sparse: supplement GET /v1/public/suites/{suite_id}/problems
═══════════════════════════════════════════════════════════════════════════════
Β§5 INCIDENT CATALOG (never repeat)
═══════════════════════════════════════════════════════════════════════════════
INC-1 Internal re-classify after router β†’ shop/voucher 0%
Fix: category lock when source has __identify_challenge__
INC-2 Missing module constants (LLM_RETRY_MAX, etc.) β†’ crash
Fix: V27 symbol closure per lane
INC-3 TYPE-B nested source β€” wrong extract (outer router pasted)
Fix: lane slice + entry wrapper only
INC-4 Tool signature mismatch (ids vs product_ids) β†’ infinite retry
Fix: V33 register_tool override OR fix ALL call sites
INC-5 register_tool on product/shop but not voucher
Fix: V34 parity all lanes that source registers
INC-6 Custom tool names (t_view_*) partially remapped
Fix: grep execute_tool_call β€” zero misses
INC-7 Static-only validation β†’ eval 0%
Fix: docker six-gate / V12b mandatory
INC-8 Wrong rank API β†’ wrong source entirely
Fix: Β§3a qualifiers[].race_rank only
INC-9 Verbatim tri-paste β†’ submit plagiarism reject
Fix: use port method or Β§6 PORT protocol; V35 per-lane <75% struct
INC-10 Obfuscation (_0x names) β†’ obfuscation-call reject
Fix: Β§A readable names only
INC-11 Supplemental before primary / supplemental improves score expectation
Fix: hybrid only β€” primary_trace returned; supplemental in registry shell
INC-12 Solver ignores problem_data["category"]
Fix: CAT_MAP / category-first routing in all methods
═══════════════════════════════════════════════════════════════════════════════
Β§6 BUILD β€” FUSION (tri-lane, all three lanes contribute to output)
═══════════════════════════════════════════════════════════════════════════════
Sources: PICK_PRODUCT, PICK_SHOP, PICK_VOUCHER (three downloads).
Structure:
[IMPORTS]
[SECTION A β€” shared @Tool layer, once]
[B1 β€” product lane closure]
[B2 β€” shop lane closure]
[B3 β€” voucher lane closure]
[SECTION D β€” resolve_task_kind router ≀80 lines]
agent_main β†’ run_{product,shop,voucher}_lane
Lane rules (ALL):
β€’ TYPE-B: extract lane slice only (INC-3)
β€’ Category lock if __identify_challenge__ (INC-1)
β€’ register_tool parity (INC-4/5/6)
β€’ V27 symbol closure
β€’ B-sections: zero @Tool (V4)
⚠ FUSION uses verbatim copy WITH prefixes ONLY if V35 pre-check passes.
If any lane structural_fp β‰₯ 75% vs download β†’ abort fusion; use port (Β§6b).
── Β§6b BUILD β€” PORT (plagiarism-safe fusion) ──
Same picks as fusion. Same behavior targets. Different structure:
β€’ Section B0: original shared kernel β‰₯8% of file (new utilities)
β€’ Reimplement each lane β€” do NOT paste download verbatim
β€’ Semantic new class names (NOT prod_/shop_/vouch_ mirrors)
β€’ T1–T5 transformation checklist per lane (from v12):
T1 β‰₯20% identifiers unlike source
T2 β‰₯3 structural edits per lane
T3 no 25-line identical blocks
T4 shared kernel for deadline/dialog/retry
T5 file size NOT β‰ˆ sum of three downloads (Β±10%)
Prove parity via V12b + lane replay β€” NOT via code similarity to download.
═══════════════════════════════════════════════════════════════════════════════
Β§7 BUILD β€” UPGRADE (single solver, surgical fixes only)
═══════════════════════════════════════════════════════════════════════════════
Source: PICK_SOLVER only.
1. Copy solver verbatim β†’ B0
2. Apply ONLY fixes from Β§3c improvement plan (smallest diff)
3. agent_main = solver's agent_main (with fixes)
4. No supplemental blocks
Guardrails:
β€’ Never remove branches solver had
β€’ category from problem_data["category"] when present (INC-12)
β€’ trigger_llm: max retries ≀ 8; safe return on exhaustion (INC-D)
β€’ No suite-specific hardcoding
═══════════════════════════════════════════════════════════════════════════════
Β§8 BUILD β€” HYBRID (solver upgrade + inline supplemental β€” stealth)
═══════════════════════════════════════════════════════════════════════════════
Sources:
B0 = PICK_SOLVER (+ Β§3c surgical fixes)
B1 = PICK_SHOP supplemental (verbatim closure, no perf edits)
B2 = PICK_VOUCHER supplemental (verbatim closure, no perf edits)
ORDER:
[IMPORTS]
[Β§8a REGISTRY HELPERS]
[B0 SOLVER β€” verbatim + fixes]
[B1 SHOP CLOSURE β€” S_supplemental_session]
[B2 VOUCHER CLOSURE β€” V_supplemental_session]
[agent_main one-liner]
Β§8a REGISTRY ISOLATION:
def _snapshot_tool_registry() -> dict: ...
def _restore_tool_registry(saved: dict) -> None: ...
def _with_isolated_registry(fn, pd) -> None:
saved = _snapshot_tool_registry()
try:
fn(pd)
except Exception:
pass
finally:
_restore_tool_registry(saved)
Β§8b SOLVER ENTRIES (supplemental NOT in agent_main):
CAT_MAP = {"product": ..., "shop": ..., "voucher": ...}
def solver_agent_main(problem_data: dict) -> list:
cat = str(problem_data.get("category", "")).lower()
if cat in CAT_MAP:
return CAT_MAP[cat](problem_data)
return <minimal regex fallback>(problem_data)
def P_solver_entry(problem_data: dict) -> list:
return <B0 product path with fixes>
def S_solver_entry(problem_data: dict) -> list:
primary_trace = <B0 shop path with fixes>
_with_isolated_registry(S_supplemental_session, problem_data)
return primary_trace
def V_solver_entry(problem_data: dict) -> list:
primary_trace = <B0 voucher path with fixes>
_with_isolated_registry(V_supplemental_session, problem_data)
return primary_trace
def S_supplemental_session(problem_data: dict) -> list:
<verbatim PICK_SHOP agent_main body β€” unchanged>
def V_supplemental_session(problem_data: dict) -> list:
<verbatim PICK_VOUCHER agent_main body β€” unchanged>
def agent_main(problem_data: dict) -> list:
return solver_agent_main(problem_data)
GOAL A: supplemental = similarity mass + stealth only β€” discarded output.
GOAL B: all perf changes in B0 only (Β§3c plan).
V24: supplemental only invoked inside S_solver_entry / V_solver_entry.
V23: grep decoy|FusionSession|_run_audit|shadow_decoy|lane_stub β†’ 0 hits.
═══════════════════════════════════════════════════════════════════════════════
Β§9 SHARED SECTION A (@Tool layer β€” all methods)
═══════════════════════════════════════════════════════════════════════════════
Frozen signatures:
find_product(**kwargs)
view_product_information(product_ids: str)
calculate_voucher(product_prices, voucher_type, discount_value,
threshold, budget, cap=0)
recommend_product(product_ids: str)
terminate(status: str = "success")
Lane sections: zero @Tool at import (V4/V16).
register_tool only inside lane entry at runtime.
═══════════════════════════════════════════════════════════════════════════════
Β§10 VALIDATION (run per /tmp/fused_candidate_{METHOD}.py β€” all must pass)
═══════════════════════════════════════════════════════════════════════════════
G0 py_compile + ast.parse
G1 ./local-test/run.sh test-inference (if available)
V1 bytes ≀ 1,048,576; lines ≀ 12,000
V3 zero duplicate top-level defs
V4 zero @Tool in B-sections (non-A)
V15 no lane_stub strings
V16 ./local-test/run.sh six-gate-static CANDIDATE
V19 category parity on 6 gate problems
V22 no _0x / hex obfuscation; API keys unchanged
V23 stealth grep 0 hits (hybrid/fusion with supplemental)
V24 hybrid: agent_main β†’ solver_agent_main only
V27 symbol closure 0 missing per lane
V33 tool signature audit 0 mismatches
V34 register_tool parity all lanes
── V35 PLAGIARISM (server-side proxy β€” INC-9) ──
Full file vs local-test/source.py:
combined < 0.70, risk β‰  high
Per source download used in this build:
python3 local-test/check_code.py LANE_EXTRACT --baseline DOWNLOAD --json
combined < 0.70 AND structural_fingerprint_similarity < 0.75
vs each existing myagents/*.py you previously submitted:
combined < 0.70
fusion verbatim path: ANY lane β‰₯75% structural β†’ FAIL β†’ switch to port.
── V11 SIMILARITY BANDS ──
vs source.py: risk β‰  high
vs primary solver: 15% ≀ combined < 70% (upgrade/hybrid B0)
vs shop supplemental: 20% ≀ combined < 90% (hybrid B1 only)
vs voucher supplemental: 20% ≀ combined < 90% (hybrid B2 only)
fusion/port per-lane: each lane vs its pick < 70% / < 75% struct
── V12b REGRESSION GATE (PRIMARY BLOCKER) ──
./local-test/run.sh six-gate CANDIDATE gate_regression_{RACE}_{METHOD}.json
| # | cat | type | baseline | fused | PASS? |
|---|-----|------|----------|-------|-------|
PASS rows (1,3,5): fused MUST pass (same as baseline pass).
FAIL rows (2,4,6): fused MUST pass OR clear improvement:
crash β†’ dialogue; empty β†’ tool_results; timeout β†’ <280s
Minimum 6/6 row rules. Any pass-row regression β†’ fix β†’ re-run G0.
Row fail if think contains NameError|AttributeError|TypeError|
Unhandled agent error|lane stub; or wrong lane tools; or β‰₯280s.
── V12 SMOKE (secondary) ──
./local-test/run.sh six-gate CANDIDATE gate_six.json
PRE-WRITE per file:
[ ] Β§3 BUILD PLAN row fulfilled
[ ] Β§4 regression 6 table with real problem_ids
[ ] V35 + V11 + V23 + V24 + V12b 6/6
β†’ ONLY THEN cp to myagents/
═══════════════════════════════════════════════════════════════════════════════
Β§11 MULTI-OUTPUT WORKFLOW (OUTPUT_COUNT > 1)
═══════════════════════════════════════════════════════════════════════════════
FOR i in 1..OUTPUT_COUNT:
1. Take strategy + ranks from BUILD PLAN row i
2. Download required sources for that row only
3. Build β†’ /tmp/fused_candidate_{i}_{METHOD}.py
4. Run full Β§10 validation for that candidate
5. On pass β†’ write myagents/{filename from Β§1b}
6. On fail → fix or downgrade strategy (fusion→port, upgrade→hybrid)
and re-validate; do NOT write failed candidate
Deliverables aggregate across all outputs (Β§12).
═══════════════════════════════════════════════════════════════════════════════
Β§12 DELIVERABLES (chat β€” required before ANY write)
═══════════════════════════════════════════════════════════════════════════════
1. RACE_NUMBER + OUTPUT_COUNT + STRATEGIES parsed
2. Rank resolution table (Β§3a)
3. Lane leaderboard + PICK_PRODUCT / PICK_SHOP / PICK_VOUCHER / PICK_SOLVER
4. Solver weakness report + improvement plan (Β§3c)
5. BUILD PLAN TABLE (Β§3d) β€” one row per output file with filename
6. Per-file: gate_regression_6 table (6 problem_ids)
7. Per-file: V35 similarity table (all baselines)
8. Per-file: V23 grep result
9. Per-file: V12b regression table 6/6
10. Written paths: lines, bytes per file
═══════════════════════════════════════════════════════════════════════════════
Β§13 FAILURE β†’ FIX QUICK MAP
═══════════════════════════════════════════════════════════════════════════════
| Symptom | Cause | Fix |
|---------|-------|-----|
| submit plagiarism | verbatim fusion INC-9 | port method + V35 |
| submit obfuscation-call | _0x names | Β§A |
| shop/voucher 0% | category ignored / re-classify | INC-1/12 CAT_MAP |
| voucher timeout | ids vs product_ids | INC-4 V33 |
| pass-row regression | B0 edit too aggressive | revert surgical fix |
| check_code pass, submit fail | skipped V35 per-lane | Β§10 V35 |
| decoy exposed | bad naming | V23 Β§8 stealth names |
| wrong agent source | bad rank API | Β§3a race_rank |
═══════════════════════════════════════════════════════════════════════════════
BEGIN
═══════════════════════════════════════════════════════════════════════════════
RACE_NUMBER: <int>
OUTPUT_COUNT: <int>
STRATEGIES: auto | fusion,upgrade,hybrid,port,...
OPTIONAL OVERRIDES (omit if not needed):
FORCE_SOLVER_RANK:
FORCE_PRODUCT_RANK:
FORCE_SHOP_RANK:
FORCE_VOUCHER_RANK:
END
═══════════════════════════════════════════════════════════════════════════════