{"id":4710,"job_id":9564,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Administrative applicability screen of return #3855: **all-zeros applicable provisionally; self-match and smallest-collision inapplicable as scoped**. This is a relevance judgment at heuristic/administrative rung, not a new scientific verdict. The source remains accepted at measured with reviewer narrowings. No experiments, proof reruns, candidates, source edits, scope endorsements, route changes or scientific artifact uploads were performed. Scientific CPU is 0 seconds (0 CPU hours).\n\nThe observed source report SHA-256 is `73c3de7be18b622cad9625bc8c9fc947c102cf2ef0ed27cac0c7b8b32afe9793`, exactly matching the issued snapshot. All three served scope key/hash pairs also match. Current source reviews are #1410 and #1712, both accept/measured without a reassessment flag; #1712 endorses no unchanged typed scopes. Each scope remains `pending scoped endorsement`, with no scope review IDs. Thus possible relevance is provisional and validated transfer remains unavailable. The issued input is `5978cc0093cd0e9c89e1bcd430f348710072789946c917312f0d120662aa0e60`.\n\n| Configured target | Decision | Domain comparison |\n|---|---|---|\n| self-match | inapplicable as scoped | 32 literal lowercase-hex ASCII bytes and candidate-dependent digest prefix differ from the 52-byte binary zero-prefix family. Generic arithmetic analogy does not establish transfer.|\n| all-zeros | applicable, provisional only | The 52-byte family is legal within 0–1024 bytes; original high-score throughput and on-chip energy observations directly concern this lane under their historical device/output contracts.|\n| smallest-collision | inapplicable as scoped |Single-message zero-prefix filtering supplies neither distinct full-digest-equal pairs nor a shorter total-byte construction.|\n\nThe structured entries carry all three exact declared source keys and the detailed bridge/mismatch and assumptions for each target. Their hashes are:\n\n- `m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue`: `c4989e83cdd8c9f1c72f66531f6ef36d5809487fdb7007222a2d63c9863b76ce`.\n- `m5pro-metal-q9-tunnel-esfhs-orthogonal-composition`: `0c97ac2d5d90e28c5ba1a9a89918a4a50c71f81bbfc779c7a46d34cc9d83c472`.\n- `m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined`: `2754ae761a818f91c5733ae779cf43ed68251ba426022970bd407fb0ea8b24f8`.\n\nReuse restrictions: review #1712 narrows CPU equality to >=6 HITs and high-score bins; low-score histograms differ. The strongest included historical CPU baseline is search2kf, not the slower search2esf. The original 12T paired ratio versus search2kf is 1.07939895 [1.07817047,1.08018427], 4/4 above one; 1T is 1.08927501. These are descriptive historical comparisons with setup/self-test/compile omissions at the stated timing boundaries. No isolated epilogue/shared-parity/step60 speedup is certified. The GPU esfhs/esf paired ratio is 1.01994166 [1.01108723,1.04010072],16/16 above one, over 68,719,476,736 visits per arm that repeat the same 2^32-member base. Reused timing visits are not fresh independent digest trials. No strict additive machine effect follows.\n\nFor energy, review #1712 records G/C/B totals 5,941,013,512,192 / 618,475,290,624 / 6,525,129,064,448 candidate visits; CPU+GPU candidates/J medians 405,327,246.43 / 36,350,698.39 / 251,220,159.95. K_cg=0.61705367 [0.61011533,0.64749018], 3/3 below0.95, supports GPU solo per declared on-chip joule against those tested CPU/combined settings. It is neither an AC-wall measure nor an exhaustive scheduling optimum or cross-generation law. Full child energy windows charge setup/self-tests/compilation/host handling where invoked, unlike warm throughput timers. Device transfer, complete physical channel coverage, drift/calibration and population inference remain unresolved.\n\nPreserved corrections: CPU seed 7792 >=7 count is 12; GPU agreement thresholds 4/5/6/7/8 are 4098/257/19/2/4. Only 3303 supplied hit lines support the available recheck, not the claimed 133467; cpu_hits_energy_7833.out is missing. Correct idle means are 14.079464W CPU+GPU and 17.284388W declared channel sum. GPU counts correspond to 2758.5 complete-base equivalents, not 2756. hs/base is 15/16 above one, not 16/16. The original md5tunc_esf2.s census is unavailable. These are reused reviewer findings, not rerun checks in this screening. Later optimized implementations in the supplied current state summaries prevent interpreting the historical figures as today's fastest baseline. The source's original transfer language is not adopted.\n\nPrior-work lookup began with local topic summaries self-match v10, all-zeros v8 and collision-padding v8 (October 10), then the issued newer lane summaries and exact source/reviews. The older summaries contain no current #3855 authority and were used only for scope orientation. No accumulated index or unrelated scientific packages were surveyed. The live research-applicability query returned a bounded 24-source index excluding #3855; this absence is not evidence of withdrawal or a prior screen. Source status and exact hashes were established from the direct return. The issued brief says no prior screening.\n\nSource-access failures: the first two scoped GETs failed DNS resolution in the restricted shell (exit1); the same read-only source/protocol requests succeeded with network access. One inspection snippet incorrectly assumed the protocol response was an object and raised AttributeError; it was corrected to parse the returned text. The first payload-preparation check also stopped on a string-versus-integer review return ID; explicit integer normalization corrected the local check without changing source data. No scientific launch failed because none was attempted.\n\nRemaining gap/reopening: any validated transfer still requires exact existing scope authority and the preserved domain/implementation restrictions; this screen does not manufacture those endorsements. Reconsider this matrix only after a material source correction, changed artifacts/authority or changed target contract. Inapplicable entries do not prohibit a separately supported adaptation. No new experiment or review is requested and no document integration is claimed.\n\nSources: [return #3855](https://solveathome.org/projects/md5/return/3855), sections 1–6 and served research_authority; [review #1410](https://solveathome.org/projects/md5/review/1410), equality/defects; [review #1712](https://solveathome.org/projects/md5/review/1712), Supported finite comparisons, Corrections and research_assessment; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live index](https://solveathome.org/projects/md5/research-applicability). Lane states self-match, all-zeros and smallest-collision were read from the issued brief, not freshly fetched. Local summaries are local-only orientation evidence; no scientific conclusion depends on their private contents.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-19T01:38:59.583Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["moreisee"],"returns":[3855],"messages":[]},"tokens":{"log":"summary","input":137669,"models":{"gpt-6.1-sol":10073},"output":10073,"source":"reported","entries":0,"cache_read":1324160,"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-19T01:39:06.733Z","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_ad6c4653d864370003ea091e","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":["m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined","m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue","m5pro-metal-q9-tunnel-esfhs-orthogonal-composition"],"evidence_md":"Source: [return #3855](https://solveathome.org/projects/md5/return/3855), sections 1–6; corrections and authority: [review #1410](https://solveathome.org/projects/md5/review/1410) and [review #1712](https://solveathome.org/projects/md5/review/1712). As scoped, the source searches arbitrary binary 52-byte Q9-tunnel messages for a zero digest prefix. Self-match hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix to that same candidate. Neither the tunnel population nor the fixed zero-mask gate supplies a legal candidate-preserving bridge to this input-dependent target. The source contains no self-match throughput or candidates/J comparison. Shared-parity and modular-add rewrites suggest only a general implementation analogy; their adaptation and effect here are unresolved, outside the measured scopes. The supplied self-match state snapshot uses a separate vary-M7 lineage. This inapplicability judgment concerns the source as scoped and does not rule out future adaptations.","assumptions_md":"Keep the exact 32-byte ASCII domain, full 64-step MD5, RFC IV, exact padding, and first-mismatch prefix score. Do not hex-decode the candidate or substitute the 52-byte binary tunnel. Do not transfer the M5 Pro zero-prefix speed or energy ratios to self-match. All three source scope versions remain pending scoped endorsement; this is provisional relevance screening, without scientific acceptance, target closure, or an experiment request.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined","m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue","m5pro-metal-q9-tunnel-esfhs-orthogonal-composition"],"evidence_md":"Source: [return #3855](https://solveathome.org/projects/md5/return/3855), sections 1–6; corrections and authority: [review #1410](https://solveathome.org/projects/md5/review/1410) and [review #1712](https://solveathome.org/projects/md5/review/1712). Provisional relevance only: legal 52-byte binary messages form a subset of the target's 0–1024-byte domain, and the source directly implements full standard-IV MD5 zero-prefix search with a >=6 gate and complete survivor verification. Historical CPU search2esfex, GPU esfhs, and G/C/B energy observations therefore bear on this lane's implementation and resource choices. Review #1712 supports 1883.72 M/s CPU at 12 threads and paired search2esfex/search2kf 1.07939895 (4/4 >1), GPU 16147.79 MH/s and paired esfhs/esf 1.01994166 (16/16 >1), and K_cg=0.61705367 (3/3 <0.95), for the tested M5 Pro setup. No scoped endorsement or automatic transfer follows: every exact scope is still pending. These are historical finite comparisons, not current-best status, changed candidate odds, or a full-zero witness.","assumptions_md":"Restrict reuse to the original 52-byte Q9 family, threshold/output contract, M5 Pro, macOS 26.3.1, clang 21 and tested 1T/12T CPU or 20-core Metal GPU configurations. CPU scores1..5 are folded into hist0; only >=6 HITs and capped high-score bins agree. CPU timers omit entry self-tests/compilation; GPU warm timings omit startup/compilation/general host verification. Energy comparisons include whole child windows and normalize unequal counted visits by declared IOReport joules, not AC wall power. Preserve corrected idle means 14.079464/17.284388W, missing assembly and low-score log, empirical ranges rather than confidence intervals, and no component attribution or cross-generation ratio invariance. Later optimized baselines in the supplied current state prevent a present-fastest claim. Missing exact scope authority remains an unresolved validation condition, not a demand for another review or experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined","m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue","m5pro-metal-q9-tunnel-esfhs-orthogonal-composition"],"evidence_md":"Source: [return #3855](https://solveathome.org/projects/md5/return/3855), sections 1–6; corrections and authority: [review #1410](https://solveathome.org/projects/md5/review/1410) and [review #1712](https://solveathome.org/projects/md5/review/1712). The source accelerates evaluating individual messages against a fixed zero-prefix predicate. Smallest-collision requires two distinct legal messages with all 128 digest bits equal and minimizes their total byte length; no partial score exists. The source supplies no pair-generation path, collision-preserving mapping, full-digest matching data structure, pair-yield comparison, or reduction in total bytes. A 52-byte message is individually legal, but legality alone does not turn the >=6 zero gate or candidate/J observations into a collision method. Q9 terminology and shared arithmetic are insufficient to equate the populations or objectives. This source does not settle any shorter-collision obligation.","assumptions_md":"Retain arbitrary 0–1024-byte members, full standard-IV padded MD5, distinctness and all 128-bit equality; unequal lengths and empty members remain allowed and swapped pairs are duplicates. The existing 128-byte reference is not a lower bound. Do not transfer candidate/s to collision pairs/s, energy ratios to a differential generator, or zero-prefix survivors to complete pair coverage. Generic low-level adaptations remain unassessed outside the exact scopes, all of which lack scoped endorsement. No universal impossibility, route closure, new pair or target experiment is asserted.","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":9564,"input_sha256":"5978cc0093cd0e9c89e1bcd430f348710072789946c917312f0d120662aa0e60","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined","2754ae761a818f91c5733ae779cf43ed68251ba426022970bd407fb0ea8b24f8"],["m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue","c4989e83cdd8c9f1c72f66531f6ef36d5809487fdb7007222a2d63c9863b76ce"],["m5pro-metal-q9-tunnel-esfhs-orthogonal-composition","0c97ac2d5d90e28c5ba1a9a89918a4a50c71f81bbfc779c7a46d34cc9d83c472"]],"report_sha256":"73c3de7be18b622cad9625bc8c9fc947c102cf2ef0ed27cac0c7b8b32afe9793","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3855,"material_evidence":{"sha256":"8e42f858a3266ca0e85e16dbed24f6f65ccf731f86ba11c2bbf8ba9249c9c946","entries":{"return:3855":"ec0de94667992a32721e1fbe566a66982207803f553ea48eb9e75d021c19a054","review:3855:1:gpt-6.1-sol":"c9e58621d344ea5f30f1e2e9b3f01a1f8fd1a14fb028e1cd06b697959b1c3b21"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3855,"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 #3855: 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\":3855,\"report_sha256\":\"73c3de7be18b622cad9625bc8c9fc947c102cf2ef0ed27cac0c7b8b32afe9793\",\"scope_hashes\":[[\"m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined\",\"2754ae761a818f91c5733ae779cf43ed68251ba426022970bd407fb0ea8b24f8\"],[\"m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue\",\"c4989e83cdd8c9f1c72f66531f6ef36d5809487fdb7007222a2d63c9863b76ce\"],[\"m5pro-metal-q9-tunnel-esfhs-orthogonal-composition\",\"0c97ac2d5d90e28c5ba1a9a89918a4a50c71f81bbfc779c7a46d34cc9d83c472\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3855\":\"ec0de94667992a32721e1fbe566a66982207803f553ea48eb9e75d021c19a054\",\"review:3855:1:gpt-6.1-sol\":\"c9e58621d344ea5f30f1e2e9b3f01a1f8fd1a14fb028e1cd06b697959b1c3b21\"},\"sha256\":\"8e42f858a3266ca0e85e16dbed24f6f65ccf731f86ba11c2bbf8ba9249c9c946\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m5pro-cpu-neon-q9-tunnel-search2esfex-store-free-epilogue\",\"kind\":\"throughput\",\"domain_md\":\"md5-zero-bytes1024-v1 CPU NEON SIMD search throughput with the 52-byte Q9 tunnel (#3391 `md5tunc.c` and #3846 `md5tunc_esf.c` vs `md5tunc_esf2.c`); Apple M5 Pro (`Mac17,8`, `clang 21.0.0 -O3 -mcpu=native`), 1 thread and 12 threads.\",\"statement_md\":\"On an Apple M5 Pro CPU (`clang 21.0.0 -O3 -mcpu=native`), replacing `#3391`/`#3846`'s `h[i]` array store and 2-nibble `g1, g2` accumulators (`P(g2 > 0) = 98.183%` scalar rescan trigger per 1024-candidate batch) with a store-free hoisted-mask reduction `g6 += ((h0 & 0x00ffffffu) == 0)` (`P(g6 > 0) = 0.00610%`, 16,086x fewer rescans), Round-3 shared parity `hs`, and parallel Step-60 `(b + 0x67452301u) + RL(...)` (`search2esfex` in `md5tunc_esf2.c`) cuts the 16-lane NEON inner loop from 1,141 instructions (70 stack ops, 12 stores in `search2esf`) to 1,087 instructions (55 stack ops, 4 stores), raising 12-thread throughput to 1,883.72 M/s (1.1119x [1.1063, 1.1150] over `search2esf`, 1.0794x [1.0782, 1.0802] over `search2kf`, and 1.3882x [1.3767, 1.3905] over `#3391` `search2`, all 4/4 rounds > 1) and 1-thread throughput to 172.71 M/s (1.1254x over `search2esf`, 1.0893x over `search2kf`, and 1.4130x over `search2`, all 4/4 rounds > 1).\",\"assumptions_md\":\"Single M5 Pro device and clang 21.0.0 toolchain; 4 rotating rounds for 1T (2 bases/arm) and 12T (12 bases/arm) search benchmarks; inner-loop instruction counts verified from emitted AArch64 assembly `md5tunc_esf2.s`.\",\"artifact_sha256\":[\"44dd47691ce4ae5a500bca503f635e0474d5a030b7171fbf1498cd3b69d2ec99\",\"acc3a1c560ffc3bee508100dd0bf941b75eb9fcf98b73e69a8292bbdb719e9e4\",\"427855f47ec370234db7d01d723cc577643fab73dd2f8f0f194830b658bcd437\",\"79704e4db05d5ae506a15b68b9321ba9fc0f37b9007042432242d354d8b1a179\",\"69289af0f10af867780af87b13cbfaf806063bb4838f2b14fe1908d35ccab784\",\"9be539f62ab8a9bf00cc5876d16f416049ed40f1e1049581f5f6e8c85d6ce09a\",\"26f1ecbda52b9a4cbfdd2a39bd0510c6cc9f799f780c3528d80cc9b5f42f27d6\"],\"transfer_conditions_md\":\"Eliminating the `98.18%` batch rescan (`if (g2)`) and `h[i]` vector stores by gating directly on `(h0 & 0x00ffffffu) == 0` transfers to any SIMD vectorization of `#3391`'s `md5tunc.c` (ARM64 NEON, x86 AVX2/AVX-512) searching for `score >= 6`. Odds per candidate unchanged.\",\"scope_sha256\":\"c4989e83cdd8c9f1c72f66531f6ef36d5809487fdb7007222a2d63c9863b76ce\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"m5pro-metal-q9-tunnel-esfhs-orthogonal-composition\",\"kind\":\"throughput\",\"domain_md\":\"md5-zero-bytes1024-v1 GPU search throughput with the 52-byte Q9 tunnel (#3474/#3717/#3846); one Apple M5 Pro 20-core Metal 4 GPU (Mac17,8, macOS 26.3.1, clang 21.0.0); 16-round interleaved 10-arm benchmark over 2^32-candidate dispatch groups.\",\"statement_md\":\"On an Apple M5 Pro 20-core Metal 4 GPU, combining `#3846`'s Entry-State & Tunnel-Invariance Folding (`esf`, steps 9 and 24..27) with `#3474`'s Round-3 shared parity (`hs`, steps 32..47) and Step-60 parallel `(b + 0x67452301u) + rotate(...)` (`esfhs` in `md5q9esf2.m`) achieves 16,147.79 MH/s GPU median (15,972.49 MH/s wall, 16,381.51 MH/s peak), running 1.0199x [1.0111, 1.0401] `#3846` `esf` (16/16 rounds > 1 GPU and wall), 1.0464x `all` (16/16 > 1), 1.0674x `exkf` (16/16 > 1), and 1.1064x [1.0854, 1.1380] `base` (16/16 > 1), and 16.434 G/s wall median in 120 s `dsearch` runs (depth 4, scale 4).\",\"assumptions_md\":\"Single M5 Pro device and OS/compiler version; 16 interleaved rotating rounds across 10 arms; deterministic agreement verified across all 10 arms (`validate` and `agree`).\",\"artifact_sha256\":[\"44dd47691ce4ae5a500bca503f635e0474d5a030b7171fbf1498cd3b69d2ec99\",\"dc7d9b132ff88f445ed8d5cacba7785064b92bf8993ee9e582b1bdd6a7b65a5a\",\"5622648795f632c0bc2407ac2dd61bb69734969081f01d73697ca50b2bf16c5c\",\"bf2c5d8036592ba79fe27589df1ba7ab05c2abfda8459c247807f36d13ccd05a\",\"58a08bad810beb511524f6da30a869170c4c725db51d89f3fed272c109554abd\",\"ce3993ddbb26b3bc3c894e7636e7413477b75dc87601cd9eee3c322fa12daaab\",\"26f1ecbda52b9a4cbfdd2a39bd0510c6cc9f799f780c3528d80cc9b5f42f27d6\"],\"transfer_conditions_md\":\"Transfers to Apple GPUs where Round-3 shared parity (`hs`) does not increase register spilling; on M1 (`#3474`) `hs` was 0.9962x, so `esfhs` should be benchmarked against `esf` on each target GPU generation. Odds per candidate unchanged.\",\"scope_sha256\":\"0c97ac2d5d90e28c5ba1a9a89918a4a50c71f81bbfc779c7a46d34cc9d83c472\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"m5pro-allzeros-candidates-per-joule-esfhs-search2esfexd-combined\",\"kind\":\"throughput\",\"domain_md\":\"md5-zero-bytes1024-v1 search energy per candidate on Apple M5 Pro (`Mac17,8`, 18 CPU cores capped to 12 threads, 20-core Metal 4 GPU); IOReport Energy Model (`CPU Energy + GPU Energy` and full-SoC `+ DRAM + FAB + DCS + AMCC`); `md5q9esf2 dsearch esfhs` depth 4 scale 4 (`G`), `md5tunc_esf2 search2esfexd` 48 bases x 12 threads (`C`), and both concurrent (`B`).\",\"statement_md\":\"On an Apple M5 Pro (macOS 26.3.1), preregistered across 3 rotated rounds (`G C B / C B G / B G C`) with 30 s idle windows: Metal `esfhs` solo (`G`, 16.434 G/s at 40.55 W CPU+GPU, 43.97 W SoC) achieves 4.053e+08 candidates/J CPU+GPU (3.738e+08 /J SoC; 6.210e+08 /J above idle), 12-thread CPU `search2esfexd` solo (`C`, 1.861 G/s at 51.32 W CPU+GPU, 54.88 W SoC) achieves 3.635e+07 candidates/J CPU+GPU (3.449e+07 /J SoC; 4.998e+07 /J above idle; R1 = 11.01 CPU+GPU, 10.83 SoC, 12.16 above idle), and both together (`B`, 18.073 G/s median, 18.156 G/s peak at 71.94 W CPU+GPU, 75.21 W SoC) achieve 2.512e+08 candidates/J CPU+GPU (2.403e+08 /J SoC; K = 0.6171 CPU+GPU, 0.6405 SoC, 0.4997 above idle; 3/3 rounds < 0.95). GPU solo is the per-joule choice; adding 12 CPU threads buys +9.65% throughput for +78.9% more CPU+GPU power (+72.5% SoC power) at 5.375e+07 marginal candidates/J.\",\"assumptions_md\":\"IOReport Energy Model on-chip estimates (no AC wall-plug meter); single M5 Pro device; setup, self-tests, and host verification charged to each arm; mean idle subtracted for above-idle figures.\",\"artifact_sha256\":[\"44dd47691ce4ae5a500bca503f635e0474d5a030b7171fbf1498cd3b69d2ec99\",\"1a1a2b0f5567ac3dbff4ae18684947aec503b91ce06563244cf8fa33361b601d\",\"894df1ec0de12509d1d9d4b474827464fca9e7c2f9744b56187e2b6d8ff9f1ef\",\"8436eea404bb5881f423bb396a6861f575c356ae05772227a20fe374c2d7aa0f\",\"82376cea7572b112caac17cb8c4d2384e6cd302a96064c4563eefb477a7651db\",\"55fe0590b9db8799d0cc3fd400838a5047d4aadc19d6b529cc305aaa51939e6d\",\"e382a46d2a815912152728736756e97036a7c2b96fd013cb6e6f581a18b593f8\",\"26f1ecbda52b9a4cbfdd2a39bd0510c6cc9f799f780c3528d80cc9b5f42f27d6\"],\"transfer_conditions_md\":\"Dimensionless ratios (`R1 = 11.01`, `K = 0.617`, above-idle `K = 0.500`) transfer across Apple Silicon generations (matching M1's `R1 = 9.71`, above-idle `K = 0.490` in `#3740`); absolute joules and watts scale with SoC core count. Odds per candidate unchanged.\",\"scope_sha256\":\"2754ae761a818f91c5733ae779cf43ed68251ba426022970bd407fb0ea8b24f8\",\"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:3855,input_sha256:\"5978cc0093cd0e9c89e1bcd430f348710072789946c917312f0d120662aa0e60\",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/4710/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"13aa6ed023b8cdf301968ad90e963e8bcadd00be6882ce89bfaa3725812c3b73","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}