Update DATASHEET.md: difficulty wording and caveats

DATASHEET.md

@@ -38,8 +38,8 @@ expat 2.9.0 — platform-tagged in provenance)**, curated PE samples, cross-comp
 - Scrubbing: every symbol equal to the answer or a callee replaced with `<...>`; automated answer-leak scan through our in-house analysis pipeline: **0/10,251 hits**.
 - Ground truth derived from artifact itself (symbol tables, header fields, decompiler output).
 - Auto-grader included (`grading.py`): deterministic graders for exact/MC/crossarch/flag/library families (exact-match is alias-tolerant); rubric judge for open-ended. Test harness `test_grading.py`: 10,172 deterministic items scored 1.0 on gold answers, 0.0 on abstention; 79 routed to judge.
-- **Full agentic benchmark measured** (`EVAL_RESULTS-passk.md`, 2026-10-29): Claude Opus 5.5 solved **29/29 envs, 145/145 attempts** with tools (median 44 s) — every answer byte-exact vs our gold: oracle confirmation that the shipped binary accepts those answers and verifies our grading chain; not a proof that each answer is unique. The public tier is frontier-warm-up level; the paid product is the private difficulty-calibrated tier (target mid-band pass rates for YOUR model) + per-model pass-rate calibration service. Single-shot no-tools ID reference stays 7/12 small-n (`EVAL_RESULTS-frontier.md`).
-- Agentic challenges: round 1 (8) + round 2 (6, stripped) + **round 3 (6: self-decrypting .text via .init_array, ptrace/TracerPid/timing anti-instrumentation, chained-seed stages, masked-blob hash + explicit_bzero, control-flow flattening with decoy states, encrypted-bytecode VM with permuted opcodes)** + **round 4 (5: two-stage ARX+FNV memory-only chain, MIPS-BE branch-delay-slot trap, Windows PE TLS-callback packer, AArch64 computed-`blr` chain with PAC noise, RISC-V PC-relative jump-table `jalr`)** + **round 5 (4: x86-64 static-pie relocation-table/GOT-indirect hunt, ARM32 Thumb/ARM interworking trap, PPC64LE condition-register juggling gate, PE PEB-walk API hiding with export-name hashing)** — technique superset of published binary-RE agent benchmarks; every binary verified OK-on-flag / NO-on-mutation (24 single-char mutations each, zero false OKs); exit status = first failing position enables black-box probing; `strings` shows no flag fragments.
+- **Full agentic benchmark measured** (`EVAL_RESULTS-passk.md`, 2026-10-29): Claude Opus 5.5 solved **29/29 envs, 145/145 attempts** with tools (median 44 s) — every answer byte-exact vs our gold: oracle confirmation that the shipped binary accepts those answers and verifies our grading chain; not a proof that each answer is unique. The public tier is frontier-warm-up level; the paid product is the private hard tier (not yet per-task calibrated; calibration on your model is part of a pilot) + per-model pass-rate calibration service. Single-shot no-tools-requested ID reference stays 7/12 small-n, and a fixed 20-item agentic hard spot check found the sampled command-output/static-analysis families practice-level for Opus with tools (`EVAL_RESULTS-frontier.md` §C).
+- Agentic challenges: round 1 (8) + round 2 (6, stripped) + **round 3 (6: self-decrypting .text via .init_array, ptrace/TracerPid/timing anti-instrumentation, chained-seed stages, masked-blob hash + explicit_bzero, control-flow flattening with decoy states, encrypted-bytecode VM with permuted opcodes)** + **round 4 (5: two-stage ARX+FNV memory-only chain, MIPS-BE branch-delay-slot trap, Windows PE TLS-callback packer, AArch64 computed-`blr` chain with PAC noise, RISC-V PC-relative jump-table `jalr`)** + **round 5 (4: x86-64 static-pie relocation-table/GOT-indirect hunt, ARM32 Thumb/ARM interworking trap, PPC64LE condition-register juggling gate, PE PEB-walk API hiding with export-name hashing)** — the set covers multiple distinct RE techniques; every binary verified OK-on-flag / NO-on-mutation (24 single-char mutations each, zero false OKs); exit status = first failing position enables black-box probing; `strings` shows no flag fragments.
 - Provenance per item: binary name and sha256_16 on every item; function address/size and architecture where applicable.
 
 ## Intended use