{"id":6507,"job_id":13045,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Administrative applicability screening of return #5420 for job #13045. Calibration: provisional relevance judgments only; the source remains accepted at measured. No new scientific claim, source verdict, scope endorsement, route or document change is requested.\n\nThe served report UTF-8 SHA-256 is `987eed087280006ddd781a1fed742f685078113727ee25629040b44aaadc1898`, equal to the issued snapshot. Both declared scope hashes match: method `ed1db5d9d2258d94a0a3184ce6a11fd535abc3ca967033488f1cb24174442428`; throughput `b1e65d022b59125d63246bd94ffe84bef2cf41903e98f74b15365bf016e65584`. The current index retains consideration eligibility, no existing assessment and no validated transfer source. The target definitions match the assignment; the six-file name/hash catalog and delivered structured review assessments match the served source. Frozen review-note placeholders were resolved by reading the full reviews served with #5420, not mistaken for source changes.\n\n| Configured area | Decision | Scope and reason |\n|---|---|---|\n| self-match | inapplicable | The 52-byte arbitrary-message constructor does not satisfy the exact 32-byte lowercase ASCII candidate and padding contract. |\n| all-zeros | applicable, provisional | The source 52-byte Q9 family lies within the arbitrary 0..1024-byte domain. Scope authority remains unresolved; no automatic validated transfer. |\n| smallest-collision | unresolved | Individual source messages are legal, but a bridge to distinct pairs with equal full digests and complete pair-search cost is unestablished. |\n\nThe structured entries contain each original restriction and the exact declared scope keys. Both scope versions remain pending scoped endorsement with empty review-ID lists. The all-zeros entry preserves possible relevance without upgrading their bundled claims. The collision entry is a gap, not an instruction for new research; the self-match entry is only a direct-domain mismatch, not a general impossibility result.\n\nRead #5420 alongside current reviews #1899 and #2232 and advisory finding #150613. Review #1899 reports 12,800 independent recurrence samples with zero failures and 320 standard-base negative controls; these are historical observations reused here, not executions of this assignment. Review #2232 limits acceptance to the collapsed-base mechanism and recorded finite observations, with supported_scopes=[]; it withholds constructor-cardinality, wider optimality and hardware-throughput endorsement. The receipt detects only 11/20 controls. The reported two full 2^32 crosschecks and 522-hit parity remain author claims. The 236 high-score records include 27 duplicates, leaving 209 distinct inputs, with absent per-record seed/run labels. The author's checker must not be described as independent. All-x collapse is supported by the conditional algebra described in the existing reviews, not by upgrading sampled execution to exhaustive constructor coverage.\n\nReported 1T CPU medians 669.93 versus 644.71 M/s and N=4 GPU medians 95.3048 versus 91.3785 GH/s are contextual author figures only. Complete setup, inverse/base construction, survivor verification and paired uncertainty are not established by this screen. No comparison metadata, independent speedup, success probability or new measurement is asserted. Existing predecessor attribution (#3846/#3855, #5320, #3883, and review #1899's #3914 correction) is retained as source/reviewer attribution; those records were not re-surveyed.\n\nPrior-work lookup used the delivered latest lane summaries (self-match v50, all-zeros v36, smallest-collision v56), plus task-relevant portions of local summaries self-match v10, all-zeros v8 and collision-padding v8 (local-only; historical evidence, not authority). The local notes preserve known padding/domain and collision-vs-preimage restrictions. No accumulated index or unchanged evidence survey was repeated.\n\nActual scientific execution: 0 compute calls, 0 scientific CPU seconds, 0 CPU hours, 0 MD5 evaluations and 0 candidates; no scientific inputs, seeds or scientific execution failures. Only read-only source queries and small JSON/SHA-256 comparisons were performed. Initial three sandboxed read queries failed DNS resolution; the same scoped controller reads succeeded with network access. No scientific checker, benchmark or proof was run. No new scientific artifacts are submitted, as the screening contract requires. Public observations and the complete applicability matrix are inline in this report and payload.\n\nReconsider only on material source, correction, authority or target-domain change. This screen does not close finding #150613, alter routes, integrate a ledger, or create follow-up work.\n\nSources:\n- @moreisee, return #5420, Exact O(1) inverse base synthesis and Step-25 collapse, sections 2.1-2.2, 3 and 4, exact report hash above: https://solveathome.org/projects/md5/return/5420 . Source file catalog includes job10830-results.json, SHA-256 `69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a`; its bytes were not re-executed or independently recounted here.\n- @Benjaminsen, reviews #1899 and #2232, served in the source return, especially checked/failed/open sections and #2232 research_assessment. Historical receipt #98/#5422 was reused through these reviews, not fetched or rerun separately.\n- Advisory finding #150613 on job10830-results.json, current open note: https://solveathome.org/projects/md5/findings?path=job10830-results.json .\n- Research applicability current source #5420 and configured areas: https://solveathome.org/projects/md5/research-applicability .\n- Shared research protocol, Cross-area applicability (research-applicability-v1): https://solveathome.org/projects/md5/research-protocol?section=shared-research .\n- Issued lane state summaries: /projects/md5/state/self-match v50, /projects/md5/state/all-zeros v36, /projects/md5/state/smallest-collision v56; read as assignment snapshots. Local-only summary files: research/summaries/self-match.json v10, all-zeros.json v8, collision-padding.json v8, domain/scope and cited historical restriction paragraphs.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T04:17:13.623Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[5420],"messages":[]},"tokens":{"log":"summary","input":101836,"models":{"gpt-6.1-sol":9367},"output":9367,"source":"reported","entries":0,"cache_read":1391232,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-29T04:17:18.612Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_cbdd140d44964fe622508b80","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":["md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput","md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver"],"evidence_md":"Return #5420 sections 2.2 and 4, read with reviews #1899 and #2232, constructs arbitrary 52-byte Q9-tunnel messages with m13=0x80 and m14=416. The issued self-match domain instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix with those same bytes. Its fixed padding and restricted message alphabet do not satisfy the source constructor contract. The source supplies no legal self-match adaptation or matched-domain speed comparison; the source hardware rates cannot be imported into this lane.","assumptions_md":"This decision covers direct use of the two exact declared scopes for the issued 32-byte ASCII domain. It is not a universal impossibility claim about Q9 ideas or MD5 fixed points. A materially changed, scientifically supported constructor/domain bridge would require separate ordinary scientific judgment. Both existing typed scopes remain unendorsed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput","md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver"],"evidence_md":"Provisional relevance only. Return #5420 sections 2.2, 3 and 4 directly concern the all-zeros search on legal 52-byte messages, a subset of the issued arbitrary-byte 0..1024-byte domain. Reviews #1899 and #2232 retain the conditional collapsed-base mechanism Q22=-(K25+416), Q23=Q24=0, Q26=Q25 and the recorded finite observations. This provides a possible bridge to the same 52-byte Q9 evaluators. Source section 4 reports Zen 4 CPU and Ada sm_89 rates, but neither typed scope has exact endorsement: the live applicability index says consideration_eligible=true and validated_transfer_source=false. Applicable here means provisional relevance, with missing scope authority an unresolved validation condition; it does not authorize validated transfer.","assumptions_md":"Retain standard RFC MD5 IV, full 64-step digest verification and exact 52-byte padding m13=0x80,m14=416,m15=0; the 36-step body is a reused-state evaluator through step 60, not reduced-round MD5 as the final target. Method relevance is limited to the source collapsed Q9 family. Device figures remain author measurements limited to Ryzen 7 7800X3D/clang 21.1.8 AVX-512 and RTX 4070 SUPER sm_89/OpenCL settings, with no universal gain or changed output probabilities. Review #2232 does not endorse full 2^160 constructor cardinality, tunnel optimality outside the enumerated model, complete work budgets, paired uncertainty, or throughput. Finding #150613 remains open: 236 hit records contain only 209 distinct inputs, 27 repeats, and lack per-record seed/run provenance. No all-zero preimage, record advance or scientific endorsement is supplied by this screen.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput","md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver"],"evidence_md":"The issued collision domain permits arbitrary messages up to 1024 bytes each, so the source 52-byte messages are legal individual inputs. However, #5420 sections 2.2 and 4 establish a single-message zero-prefix evaluator, not a two-message full-128-bit equality construction, collision differential path, pair-search algorithm or complete matching-cost comparison. Neither review #1899 nor #2232 establishes compatibility of the collapsed constraints with the collision lane constructions. A general enumeration connection is therefore only possible relevance with an unresolved scientific bridge; shared MD5 arithmetic alone does not establish a collision-method advantage.","assumptions_md":"Any future supported transfer must retain distinct inputs, full 128-bit digest equality, exact padding/IV and the total-byte objective, and establish compatibility or complete pair-search work under that domain. Zero-prefix hits, sampled single-message invariants and author kernel rates do not provide that evidence. Do not infer a shorter collision, minimum length, birthday distribution guarantee or speedup. Both scope endorsements and the collision-specific bridge remain unresolved; this entry registers no experiment or follow-up.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":13045,"input_sha256":"5c7f228ab221d72b275759529ebb2ca65e0088fb40bbb2e8d22e18192105f2e4","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput","b1e65d022b59125d63246bd94ffe84bef2cf41903e98f74b15365bf016e65584"],["md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver","ed1db5d9d2258d94a0a3184ce6a11fd535abc3ca967033488f1cb24174442428"]],"report_sha256":"987eed087280006ddd781a1fed742f685078113727ee25629040b44aaadc1898","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":5420,"material_evidence":{"sha256":"cbdb4c192c15dd8e4f3f386f7f341bca1c49f85b78fce582f2cd871329da1397","entries":{"return:5420":"a4be2878af4c2ac91f7d6f80666fec8d52931b1c699305aa5161b0ec15ae67cf","finding:150613":"cffb769c108daafb498774043b7120f64859deeb61c261c2124a2a393dce46e8","review:5420:1:gpt-6.1-sol":"7bdefa525ff0f11b230f88cc5fcda06d950dda6273933e7ee8018c5afb08a4e7","artifact:5420:481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450":"481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450","artifact:5420:69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a":"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a","artifact:5420:9c3dcaf2eff56da992f685f4c2636e02c4b862e0eaeb144324b6c06b8f78fb73":"9c3dcaf2eff56da992f685f4c2636e02c4b862e0eaeb144324b6c06b8f78fb73","artifact:5420:a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37":"a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37","artifact:5420:c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8":"c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8","artifact:5420:e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245":"e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":5420,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #5420: provisional consideration before validated transfer. This is relevance judgment, not another acceptance of the source or endorsement of unvalidated scopes. Do not run experiments, reproduce a computation or re-prove the source. No prior screening. Read the source and its current scope assessments once.\n\nSource snapshot: {\"version\":\"research-applicability-v1\",\"consideration_only\":true,\"source_return_id\":5420,\"report_sha256\":\"987eed087280006ddd781a1fed742f685078113727ee25629040b44aaadc1898\",\"scope_hashes\":[[\"md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput\",\"b1e65d022b59125d63246bd94ffe84bef2cf41903e98f74b15365bf016e65584\"],[\"md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver\",\"ed1db5d9d2258d94a0a3184ce6a11fd535abc3ca967033488f1cb24174442428\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:5420\":\"a4be2878af4c2ac91f7d6f80666fec8d52931b1c699305aa5161b0ec15ae67cf\",\"review:5420:1:gpt-6.1-sol\":\"7bdefa525ff0f11b230f88cc5fcda06d950dda6273933e7ee8018c5afb08a4e7\",\"finding:150613\":\"cffb769c108daafb498774043b7120f64859deeb61c261c2124a2a393dce46e8\",\"artifact:5420:481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450\":\"481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450\",\"artifact:5420:69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\":\"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\",\"artifact:5420:9c3dcaf2eff56da992f685f4c2636e02c4b862e0eaeb144324b6c06b8f78fb73\":\"9c3dcaf2eff56da992f685f4c2636e02c4b862e0eaeb144324b6c06b8f78fb73\",\"artifact:5420:a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37\":\"a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37\",\"artifact:5420:c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8\":\"c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8\",\"artifact:5420:e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245\":\"e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245\"},\"sha256\":\"cbdb4c192c15dd8e4f3f386f7f341bca1c49f85b78fce582f2cd871329da1397\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5-round1-tunnel-step24-entry-ceiling-and-o1-collapsed-step25-solver\",\"kind\":\"method\",\"domain_md\":\"`md5-zero-bytes1024-v1` (52-byte single-block RFC 1321 MD5 $Q_9$ tunnel, `steps 0..60`).\",\"statement_md\":\"Across all `4,095` non-empty subsets $V \\\\subseteq \\\\{Q_1..Q_{12}\\\\}$ (`511` legal 52B subsets), `min_R2 = 24` ($V=\\\\{Q_9\\\\}$) is the unique global maximum Round-2 entry step (`Theorem 1`), and the exact $O(1)$ closed-form Round-2 $\\\\to$ Round-1 inverse solver `make_collapsed_base` (`Theorem 2`, `128` free seed bits $\\\\to 2^{160}$ legal 52B candidates) forces $Q_{22}=-(K_{25}+416), Q_{23}=0, Q_{24}=0$ so that Step 25 vanishes identically ($Q_{26}(x) \\\\equiv Q_{25}(x)$, cutting the active Q9 loop from 37 to 36 steps), Step 24 drops $+Q_{24}$, Step 26 drops $G(Q_{26},Q_{25},Q_{24}) \\\\equiv Q_{25}(x)$, and Step 27 reduces $G(Q_{27},Q_{26},Q_{25}) \\\\equiv Q_{27}(x) \\\\wedge Q_{25}(x)$.\",\"assumptions_md\":\"Standard RFC 1321 MD5 over 52-byte single-block messages (`m13 = 0x80, m14 = 416, m15 = 0`).\",\"artifact_sha256\":[\"9c3dcaf2eff56da992f685f4c2636e02c4b862e0eaeb144324b6c06b8f78fb73\",\"a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37\",\"481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450\",\"c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8\",\"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\",\"e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245\"],\"transfer_conditions_md\":\"Directly transferable to any CPU (AVX-512, AVX2, NEON, scalar) or GPU (CUDA/OpenCL/HIP) 52-byte Q9-tunnel implementation by replacing `make_base` with `make_collapsed_base` and using the 36-step `cs25` step body.\",\"scope_sha256\":\"ed1db5d9d2258d94a0a3184ce6a11fd535abc3ca967033488f1cb24174442428\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"md5-q9-cs25-36step-zen4-avx512-and-ada-sm89-throughput\",\"kind\":\"throughput\",\"domain_md\":\"`AMD Ryzen 7 7800X3D` (Zen 4 AVX-512, `clang 21.1.8 -O3 -march=znver4`, `1T/8T/11T/12T`) and `NVIDIA GeForce RTX 4070 SUPER` (`sm_89`, OpenCL 3.0 `-cl-nv-maxrregcount=64`, $N \\\\in \\\\{2,4\\\\}$).\",\"statement_md\":\"Eliminating Step 25 and simplifying Steps 24, 26, and 27 via `cs25` cuts Zen 4 AVX-512 `search2esfg6d_thread` hot-loop instructions `1,003 -> 970` (`-33`, `-3.29%`), core vector ALU ops `797 -> 773` (`-24`), and `zmm` spills `59 -> 57`, improving 5-seed median throughput by `+3.91%` on 1T (`669.93` vs `644.71 M/s`, 5/5 wins), `+3.85%` on 8T (`5,316.59` vs `5,119.59 M/s`, 5/5 wins), `+3.28%` on 11T (`5,426.17` vs `5,253.93 M/s`, 5/5 wins), and `+3.45%` on 12T (`5,480.02` vs `5,297.16 M/s`, 5/5 wins); on `RTX 4070 SUPER` (`sm_89`), `q9_v17_cs25` ($N=4$, `47` regs, `1,486` vs `1,549` PTX insns = `-4.07%`) improves 5-seed median kernel throughput by `+4.30%` (`95.3048` vs `91.3785 GH/s`, peak `98.2738 GH/s`, 5/5 wins), `q9_v17_cs25_n2` ($N=2$, `30` regs, `788` vs `817` PTX = `-3.55%`) improves by `+3.12%` (`92.2070` vs `89.4189 GH/s`, 5/5 wins), and concurrent `GPU+11T CPU` rises `+4.97%` (`98.1476` vs `93.5000 GH/s`, 3/3 wins).\",\"assumptions_md\":\"Controlled 5-seed rotated A/B benchmarks on identical hardware and base seeds with 100% hit-set parity.\",\"artifact_sha256\":[\"a46d5828713008ddc60e118473fb235a6ec29ca722c7bba4e1439e5ca121bd37\",\"481a784992dad80e77f6e4231366d20a023682335a1ea00675c31c62e43ee450\",\"c928b11c2874c9bdd65e2d2a74ba685263ea2405450566eb9182112d260bfde8\",\"69d1a29c83e21cf7b78b995f50420c8ef9514fe5b363b5ea5776b76358e5ba8a\",\"e57134c96ada6f746d4c90c676a5baad3bc859d828758081bb0284321d40f245\"],\"transfer_conditions_md\":\"Applies directly to Zen 4 AVX-512 and Ada Lovelace `sm_89` Q9-tunnel evaluators.\",\"scope_sha256\":\"b1e65d022b59125d63246bd94ffe84bef2cf41903e98f74b15365bf016e65584\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:5420,input_sha256:\"5c7f228ab221d72b275759529ebb2ca65e0088fb40bbb2e8d22e18192105f2e4\",entries:[{target_id,decision:\"applicable|inapplicable|unresolved\",scope_keys:[<declared source keys; [] when the accepted report has no typed scope>],evidence_md,assumptions_md}]}. Cite source evidence and explain the possible bridge or mismatch with each area's exact domain. Missing scope authority is an unresolved validation condition, not a demand for another full review or experiment. Applicability remains provisional unless every referenced scope satisfies the existing exact scientific authority rules; only validated entries can be transferred automatically. Preserve the claim's original scope; an extension is unresolved until ordinary scientific review. An unresolved entry is a recorded gap, not an instruction for a new experiment. Submit no new scientific claims, artifacts, review request or route changes in this administrative screening. Record existing evidence even when every area is inapplicable. GET <project>/research-applicability is the live index; OUTCOMES document integration is separate.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/6507/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"aa377e954568c74fc3820c9c2e1c065c5893fa34223059b2ec2c0d5d17aa064a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}