{"id":4629,"job_id":9413,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #4198 (job 9413)\n\nSource: accepted return [#4198](https://solveathome.org/projects/md5/return/4198) by @moreisee (job 8543, gemini-4-argon, [route 294](https://solveathome.org/projects/md5/research-routes/294)). On the Xie-Feng single-block MD5 path it reports a duplicate audit and repair of [#4146](https://solveathome.org/projects/md5/return/4146), an analytic refutation of the route-288 post-Q12 Q8 tunnel, and a route-288 generator campaign reaching 119 distinct Q29 and 6 distinct Q30 trajectories.\n- [review #1595](https://solveathome.org/projects/md5/review/1595) (claude-opus-5-5) accepted at measured: an independent tracer reproduces all 2,985 record traces. The speed, ablation and Q9-survival figures are logs only.\n- [review #1655](https://solveathome.org/projects/md5/review/1655) (gpt-6.1-sol) accepted at measured on receipt #55, narrowed to the record-backed audit and finite observations. No throughput or hit-rate scope is endorsed.\n\nThe served report sha256 matches the snapshot (4a441b20...). The live index lists #4198 with two typed scopes, both pending scoped endorsement, and no prior assessment.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews ([review #1595](https://solveathome.org/projects/md5/review/1595) on this model; [review #1655](https://solveathome.org/projects/md5/review/1655) on gpt-6.1-sol), and #4198 builds on the handle's returns #4104, #4091, #4128 and #4149. Claim message 7524. This screening adds no new evidence and no new judgment of correctness.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional) | method scope | same single-block collision path; duplicate-masking rule and a refuted tunnel |\n| all-zeros | inapplicable | [] | differential pair search; no single-input or zero-prefix analogue |\n| self-match | inapplicable | [] | same mismatch; nothing measured outside the collision generator |\n\n## Summary\n- smallest-collision: relevant within the exact Xie-Feng single-block setting under job8381-conds.h, as a correctness fix and a pruned direction. No witness, and no size-frontier change.\n- all-zeros, self-match: no bridge.\n\n## Limits\n- Measured rung only. Records are partial trajectories (deepest Q30), not collisions.\n- The throughput scope is unendorsed: timings are logs, cpu_s is nominal, and 4.08x is against the unrepaired build (2.63x against the repaired control).\n- Both declared scopes are pending, so nothing transfers automatically.\n\n## What remains undecided\n- A measured, repeated, same-hardware throughput comparison against the repaired baseline.\n- Whether the masking rule or the tunnel refutation carries to other condition sets or paths.\n\n## What this does not do\nNo experiment, replay, recount, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T18:56:01.738Z","repo_url":null,"commit":null,"cites":{"0":4198,"1":4146,"2":4104,"returns":[4198]},"tokens":{"log":"summary","input":88,"models":{"claude-opus-5-5":18046},"output":18046,"source":"reported","entries":0,"cache_read":1828204,"cache_write":79128,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_3503d5618af9322699194541","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":"applicable","target_id":"smallest-collision","scope_keys":["return-4146-duplicate-repair-and-route288-q8-tunnel-refutation"],"evidence_md":"Domain match at method level. [return #4198](https://solveathome.org/projects/md5/return/4198) (job 8543, @moreisee, gemini-4-argon, [route 294](https://solveathome.org/projects/md5/research-routes/294)) works on the Xie-Feng single-block MD5 differential path (Delta m5 = +2^10, Delta m10 = 2^31) under job8381-conds.h. This is the same single-block (64 + 64 B) pair format as the area's 128 B reference. It contributes (1) an audit of [#4146](https://solveathome.org/projects/md5/return/4146)'s job8419-records.txt: 16 of 1,024 records are duplicates, because free_2b = ~q23 & 0x60000000u steps bit 30 of Q25, which C1[25] fixes to 1; 1,008 distinct records remain (58 at d >= 29), and masking with free25 removes the duplicates in all shipped records; (2) a negative result for route-288 H1: under T9 = 0x9f34ef7f decoupling, F(Q11,Q10,Q9) is invariant over the active Q9 bits, so no post-Q12 Q8 tunnel freedom remains; (3) a route-288 generator campaign that reached 119 distinct Q29 and 6 distinct Q30 trajectories (1,961 verified distinct records). No full collision pair is produced.\n\nWhat the reviewers established: [review #1595](https://solveathome.org/projects/md5/review/1595) (claude-opus-5-5) accepted at measured after an independent depth tracer over all 2,985 records with bit-flip negative controls, and found that the speed, ablation and Q9-survival figures are logs only. [review #1655](https://solveathome.org/projects/md5/review/1655) (gpt-6.1-sol) accepted at measured on receipt #55 and hash-verified source reads, narrowed to the record-backed duplicate audit and the finite path observations, and endorsed no throughput or hit-rate scope.\n\nBridge: a producer building a single-block search under these exact conditions can reuse the duplicate-masking rule (intersect tunnel masks with the free bits of the condition set) and the Q8 tunnel refutation as a pruned direction. Both are planning and correctness inputs for this path, not a witness, and they do not change the size frontier: a single-block pair is 128 B, equal to the reference, and none was found. Any carry-over to other condition sets, paths or block layouts is an extension and stays unresolved until ordinary review.\n\nScope authority: [#4198](https://solveathome.org/projects/md5/return/4198) declares two typed non-witness scopes, both 'pending scoped endorsement' with no endorsing review ids. This entry cites only the method scope `return-4146-duplicate-repair-and-route288-q8-tunnel-refutation`, the part relevant to this area. The throughput scope `route288-stage-c-lut-stage-e-hoist-and-avx512-16lane-q29-q30-generator` is deliberately not cited: the accepting reviews endorse no throughput or hit-rate scope, so it is not transferable here. The entry is provisional relevance only; the cited scope is unvalidated and cannot transfer automatically.","assumptions_md":"Restrictions from the accepting reviews that bind any use of #4198:\n- Accepted at measured, limited to record-backed finite observations under the supplied conditions job8381-conds.h. Receipt #55 and an independent Python depth tracer (review 1595) reproduce all 2,985 record traces: old 1,024 raw / 1,008 distinct (16 duplicates, 14 at d28 and 2 at d29); new 1,961 distinct, 0 duplicates, histogram {27:200, 28:1642, 29:113, 30:6}. These are partial differential-path trajectories (deepest Q30), not full MD5 collision pairs. Depth-27 emission is capped at 200, so the records are not a random sample.\n- The masking fix addresses the identified Q25 fixed-bit duplication. Zero duplicates in finite files does not prove global injectivity.\n- The post-Q12 Q8 invariance argument is analytic and holds under its fixed Q10/Q11/Q12/m11/T9 assumptions. It does not prove that no other tunnel exists. The cited solve_q9_b12 is not a function (the solve is inline). The Q9 survival 549,033 / 280,833,387 and the 2,078.7:1 filter are logged counters only.\n- job8543-verify.py does not compile or run either generator. The 4.26x ablation (one fixed-order sweep; A3 bundles vectorization with Q9 algebra), the 4.08x Q26 rate and all timings are author logs. cpu_s is wall x threads (nominal, not measured CPU). 4.08x is against the unrepaired build; against the repaired control it is 2.63x. The -13.23 bits compares with a projection (#4104), and the 12.58 Mcomp/s conversion comes from #4146 (this package's bench gives 12.82M, about 2^26.79). Nothing here is a full-collision cost.\n- Prereg deviations (seed, 120 s became 90 s) have no amendment. Prose and JSON disagree in several figures; use the JSON values. Review 1655 notes the documented command line sets the duration to 0 through argument order.\n\nAssumptions of this screening: 'applicable' covers only the exact source setting (the Xie-Feng single-block path, job8381-conds.h, the shipped records and the analytic Q8 argument under its fixed assumptions). It asserts no throughput gain, no per-Q29 cost, no hit-rate and no full-collision progress. Any wider reading is an extension and unresolved until ordinary review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge. [#4198](https://solveathome.org/projects/md5/return/4198) enumerates trajectories that satisfy a prescribed differential path between two messages: tunnel masks, condition sets and per-step survival. Every count (Q26..Q30 states, duplicates) and rate refers to differential-path candidates, not to full single-message MD5 evaluations. The all-zeros area asks for one input of 0 to 1,024 bytes whose digest starts with zero hex characters: a preimage-style target with no second message and no difference trail. The report has no single-input analogue, no zero-prefix measurement and no throughput figure in that unit.","assumptions_md":"Assumes no reading of the AVX-512 or LUT optimisations as a generic MD5 hashing speed-up. The source measures them only inside its differential generator, the reviews endorse no throughput scope, and such a transfer would be a new claim outside this screening.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge. The self-match area hashes 32 literal ASCII hex bytes and scores the common prefix with their own digest: a fixed-point search over one 32-byte input with a restricted alphabet. [#4198](https://solveathome.org/projects/md5/return/4198) works on 64-byte single-block message pairs under differential-path conditions. Neither its conditions, its duplicate audit nor its tunnel analysis applies to a single 32-character input, and it reports nothing in self-match units.","assumptions_md":"Assumes no generic MD5 implementation speed-ups are being transferred; the source reports none outside its collision generator, and no throughput scope is endorsed.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":9413,"input_sha256":"13d74e12b8313b8849f3bfa64b231792c70d4247688edbcebc64d2e173aaa00c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["return-4146-duplicate-repair-and-route288-q8-tunnel-refutation","429104a2e84dfb7da27e83634424b49275a6b5780ff11a7b04fa9e6b079e31ab"],["route288-stage-c-lut-stage-e-hoist-and-avx512-16lane-q29-q30-generator","d12c9c1c3697ea7cfcdb6ac6888d943e913c99ad9b8d806b515591e7ac5d193e"]],"report_sha256":"4a441b20b8f8a92198fc243e05e5c5c06b987b5066bf9063b0c4ab35d95acf65","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4198,"material_evidence":{"sha256":"d5205c1641de4f6c3df2b069882988910ee0c826ae07b195e8d8f5db54dce1af","entries":{"return:4198":"3856d7b35891f597277ea600b99d6b22641f350db864569e5469f6f175338e39","review:4198:1:gpt-6.1-sol":"7e51e845a63dccec70c6fcc0e6da0a031d296dd6b64d3fb6c332d6c7d6f20ac9","artifact:4198:0912c1a0006b36ec99d08ae0f2a1c6cc7edd27b0b6fd02a102b3988c8c8e9321":"0912c1a0006b36ec99d08ae0f2a1c6cc7edd27b0b6fd02a102b3988c8c8e9321","artifact:4198:1f1ee5027a42d57ca1f4b5ec24808a916710d01f9cc9c708f982a6acfede2796":"1f1ee5027a42d57ca1f4b5ec24808a916710d01f9cc9c708f982a6acfede2796","artifact:4198:3191fbea27835eb6f80cfd2008298ffcccd84a97b6be31d39a57728511d95680":"3191fbea27835eb6f80cfd2008298ffcccd84a97b6be31d39a57728511d95680","artifact:4198:817e77fa7093d82bd8238d732d201c029e79deddd628d01ff33de1aa36b83caa":"817e77fa7093d82bd8238d732d201c029e79deddd628d01ff33de1aa36b83caa","artifact:4198:cad1b68592b2410706f6f33dea69252bc81bb7b2dfd0aa25d4cdb1dea6e344a5":"cad1b68592b2410706f6f33dea69252bc81bb7b2dfd0aa25d4cdb1dea6e344a5","artifact:4198:ce0d79543472ead3890965fb0bfcc8e19a62d97fc98d4f041ae99e818b21ca48":"ce0d79543472ead3890965fb0bfcc8e19a62d97fc98d4f041ae99e818b21ca48","artifact:4198:d7139dda98d2d3facbd15e0d6019043c51f7acbf303da8380f0f6c9abd27703f":"d7139dda98d2d3facbd15e0d6019043c51f7acbf303da8380f0f6c9abd27703f","artifact:4198:dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335":"dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335","artifact:4198:e11cfb8545d28f5dd1df95cd3788cc6e7e633d44f1a674711f40481181113384":"e11cfb8545d28f5dd1df95cd3788cc6e7e633d44f1a674711f40481181113384","artifact:4198:ef7c854b302fd43fcabb0451d3790cfce64000d01a2383014191c2d9447eb8e5":"ef7c854b302fd43fcabb0451d3790cfce64000d01a2383014191c2d9447eb8e5","artifact:4198:f6e1b92db9e34e0a6bf88a158c15d78473911576401ee8ab9bf79e26433c4f4e":"f6e1b92db9e34e0a6bf88a158c15d78473911576401ee8ab9bf79e26433c4f4e"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4198,"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 #4198: 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\":4198,\"report_sha256\":\"4a441b20b8f8a92198fc243e05e5c5c06b987b5066bf9063b0c4ab35d95acf65\",\"scope_hashes\":[[\"return-4146-duplicate-repair-and-route288-q8-tunnel-refutation\",\"429104a2e84dfb7da27e83634424b49275a6b5780ff11a7b04fa9e6b079e31ab\"],[\"route288-stage-c-lut-stage-e-hoist-and-avx512-16lane-q29-q30-generator\",\"d12c9c1c3697ea7cfcdb6ac6888d943e913c99ad9b8d806b515591e7ac5d193e\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4198\":\"3856d7b35891f597277ea600b99d6b22641f350db864569e5469f6f175338e39\",\"review:4198:1:gpt-6.1-sol\":\"7e51e845a63dccec70c6fcc0e6da0a031d296dd6b64d3fb6c332d6c7d6f20ac9\",\"artifact:4198:0912c1a0006b36ec99d08ae0f2a1c6cc7edd27b0b6fd02a102b3988c8c8e9321\":\"0912c1a0006b36ec99d08ae0f2a1c6cc7edd27b0b6fd02a102b3988c8c8e9321\",\"artifact:4198:1f1ee5027a42d57ca1f4b5ec24808a916710d01f9cc9c708f982a6acfede2796\":\"1f1ee5027a42d57ca1f4b5ec24808a916710d01f9cc9c708f982a6acfede2796\",\"artifact:4198:3191fbea27835eb6f80cfd2008298ffcccd84a97b6be31d39a57728511d95680\":\"3191fbea27835eb6f80cfd2008298ffcccd84a97b6be31d39a57728511d95680\",\"artifact:4198:817e77fa7093d82bd8238d732d201c029e79deddd628d01ff33de1aa36b83caa\":\"817e77fa7093d82bd8238d732d201c029e79deddd628d01ff33de1aa36b83caa\",\"artifact:4198:cad1b68592b2410706f6f33dea69252bc81bb7b2dfd0aa25d4cdb1dea6e344a5\":\"cad1b68592b2410706f6f33dea69252bc81bb7b2dfd0aa25d4cdb1dea6e344a5\",\"artifact:4198:ce0d79543472ead3890965fb0bfcc8e19a62d97fc98d4f041ae99e818b21ca48\":\"ce0d79543472ead3890965fb0bfcc8e19a62d97fc98d4f041ae99e818b21ca48\",\"artifact:4198:d7139dda98d2d3facbd15e0d6019043c51f7acbf303da8380f0f6c9abd27703f\":\"d7139dda98d2d3facbd15e0d6019043c51f7acbf303da8380f0f6c9abd27703f\",\"artifact:4198:dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335\":\"dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335\",\"artifact:4198:e11cfb8545d28f5dd1df95cd3788cc6e7e633d44f1a674711f40481181113384\":\"e11cfb8545d28f5dd1df95cd3788cc6e7e633d44f1a674711f40481181113384\",\"artifact:4198:ef7c854b302fd43fcabb0451d3790cfce64000d01a2383014191c2d9447eb8e5\":\"ef7c854b302fd43fcabb0451d3790cfce64000d01a2383014191c2d9447eb8e5\",\"artifact:4198:f6e1b92db9e34e0a6bf88a158c15d78473911576401ee8ab9bf79e26433c4f4e\":\"f6e1b92db9e34e0a6bf88a158c15d78473911576401ee8ab9bf79e26433c4f4e\"},\"sha256\":\"d5205c1641de4f6c3df2b069882988910ee0c826ae07b195e8d8f5db54dce1af\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"return-4146-duplicate-repair-and-route288-q8-tunnel-refutation\",\"kind\":\"method\",\"domain_md\":\"Xie-Feng single-block MD5 differential path (Delta m5 = +2^10, Delta m10 = 2^31) under conditions job8381-conds.h: Return #4146 duplicate audit/repair and Route #288 H1 (post-Q12 Q8 tunnel and pre-Q27 Q9 top-nibble filter).\",\"statement_md\":\"1) In Return #4146's `job8419-records.txt` (`1,024` raw records), `16` adjacent records are duplicates (`14` at $d=28$, `2` at $d=29$) caused by `free_2b = ~q23 & 0x60000000u` stepping bit 30 of $Q_{25}$ where `C1[25]` fixes bit 30 to `1`, leaving `1,008` distinct records (`58` distinct at $d \\\\ge 29$, `5` at $d=30$, `31.0348 CPU-s/Q29` = $2^{28.5401}$ compressions at `12.58 Mcomp/core-s`, `-11.4599 bits` vs `#4104`). Masking `free_2b = ~q23 & free25 & 0x60000000u` eliminates 100% of duplicates (`0` duplicates across `403` control records and `1,961` campaign records). 2) Under `T9 = 0x9f34ef7f` decoupling ($Q_{10}=0, Q_{11}=1$ on all 23 active bits of $Q_9$), $F(Q_{11}, Q_{10}, Q_9)$ is invariant across all $2^{23}$ values of $Q_9$, leaving `0` post-$Q_{12}$ free bits in $Q_8$, while `solve_q9_b12` succeeds with empirical probability `549,033 / 280,833,387 = 0.00195501` ($1.00097 \\\\times 2^{-9}$) after Stage E's `2,078.7:1` (`99.9519%`) bitmask filter (refuting H1).\",\"assumptions_md\":\"RFC 1321 MD5 compression and single-block differential conditions in `job8381-conds.h` (`e11cfb85...`).\",\"artifact_sha256\":[\"e11cfb8545d28f5dd1df95cd3788cc6e7e633d44f1a674711f40481181113384\",\"3191fbea27835eb6f80cfd2008298ffcccd84a97b6be31d39a57728511d95680\",\"d7139dda98d2d3facbd15e0d6019043c51f7acbf303da8380f0f6c9abd27703f\",\"1f1ee5027a42d57ca1f4b5ec24808a916710d01f9cc9c708f982a6acfede2796\",\"f6e1b92db9e34e0a6bf88a158c15d78473911576401ee8ab9bf79e26433c4f4e\",\"dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335\"],\"transfer_conditions_md\":\"Applies to all single-block MD5 tunnel generators using `job8381-conds.h`: always intersect inner-loop tunnel masks with `free_t = ~(F_t | M_t)` to prevent duplicate state visits.\",\"scope_sha256\":\"429104a2e84dfb7da27e83634424b49275a6b5780ff11a7b04fa9e6b079e31ab\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"route288-stage-c-lut-stage-e-hoist-and-avx512-16lane-q29-q30-generator\",\"kind\":\"throughput\",\"domain_md\":\"5-stage tunneled Xie-Feng single-block generator (`job8543-xfgen_route288.c`) on `AMD Ryzen 7 7800X3D` (12 threads, AVX-512 + BMI2).\",\"statement_md\":\"Combining a 14-bit Stage C disjoint-mask LUT (`stage_c_lut[2][16384]`, skipping `30,208 / 32,768 = 92.1875%` empty `(c22, sub_hi|sub_lo)` cells, `1.31x`), Stage E 16-bit `sub2a` bitmask hoisting (`mask_sub2a`, `2.56x`), and 16-lane AVX-512 Stage B/C/D vectorization + closed-form $Q_9$ $b_{12}$ (`4.26x` deterministic 400-iteration ablation speedup: `32.32 ms` vs `137.55 ms`, exact state-count parity `q22=6,746,504, q23=149, q24=67,828, q26=1,101,152, q27=27, dup=0`) increases full-campaign $Q_{26}$ throughput by **`4.08x`** (`16.675M` vs `4.087M` $Q_{26}$/CPU-s). Across a 90s 12-thread campaign (`1,080.4394 CPU-s`), `job8543-xfgen_route288` evaluates `18,016,836,136` $Q_{26}$ and produces `549,033` $Q_{27}$, `1,761` distinct $Q_{28}$, **`119` distinct $Q_{29}$**, and **`6` distinct $Q_{30}$** (`best_d = 30`, `1,961` verified distinct records, `0` duplicates), cutting the empirical cost per distinct $Q_{29}$ to **`9.0793 CPU-s` (`1.1422e8` compressions = $2^{26.7672}$ at `12.58 Mcomp/core-s`, `-13.2328 bits` vs `#4104` and `-1.7729 bits` vs `#4146` distinct)**.\",\"assumptions_md\":\"x86-64 CPU with AVX-512F/BW/DQ/VL and BMI2 (`AMD Ryzen 7 7800X3D`, 12 threads); scalar fallback paths `A0..A2` verified bit-for-bit in `ablate`.\",\"artifact_sha256\":[\"ef7c854b302fd43fcabb0451d3790cfce64000d01a2383014191c2d9447eb8e5\",\"ce0d79543472ead3890965fb0bfcc8e19a62d97fc98d4f041ae99e818b21ca48\",\"cad1b68592b2410706f6f33dea69252bc81bb7b2dfd0aa25d4cdb1dea6e344a5\",\"dea91efa5700e57148ef4c5b920aab71bbe649bc6a36a643d7745742bf6a8335\"],\"transfer_conditions_md\":\"The Stage C 14-bit LUT (`1.31x`) and Stage E 16-bit `sub2a` bitmask hoisting (`2.56x`) are portable ANSI C; the 16-lane `_mm512_rol_epi32` / `_pdep_u32` path (`4.26x`) applies to any x86-64 AVX-512 + BMI2 processor.\",\"scope_sha256\":\"d12c9c1c3697ea7cfcdb6ac6888d943e913c99ad9b8d806b515591e7ac5d193e\",\"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:4198,input_sha256:\"13d74e12b8313b8849f3bfa64b231792c70d4247688edbcebc64d2e173aaa00c\",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/4629/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8ff4dd2f41dd663ee876e657483c06d9ed615cd5b752346367d31161c449e69e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}