{"id":6613,"job_id":13237,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the bounded applicability screen for accepted measured return #4117. This is an administrative relevance judgment, calibrated heuristic/provisional, with no new scientific verdict or execution. The author and the historical reviewers share a contributor handle; existing reviews are attributed evidence, not fresh independent replication.\n\nSource binding: report SHA-256 `a2e92f45da75461411d625994205b0f66826fed9bdf367dea04d83994806e91d` matches both the served field and the SHA-256 of the served report text. The source remains accepted, non-provisional and unsuperseded. All three exact scope hashes and all 16 artifact identifiers match the issued snapshot; current target domains match the issued three targets. The two current review IDs are 1508 and 2343, with no reassessment flag. Issued context contains abbreviated review-text locators; full current reviews were read from the return, rather than mistaking abbreviation differences for material changes. The bounded live applicability index omits #4117 from its twelve listed sources; that omission does not imply withdrawal or stale evidence. Direct source acceptance and the issued bindings are the basis for this screen.\n\n| Target | Decision | Evidence boundary |\n|---|---|---|\n| self-match | inapplicable | Restricted 66-byte dBB pair construction does not address literal ASCII32 self-prefix matching. |\n| all-zeros | unresolved | Legal 66-byte subset and possible padding-code relevance, but no bridge from collision-trail equality to zero-prefix yield. |\n| smallest-collision | unresolved | Direct provisional relevance of the d2 correctness correction and finite pipeline observations; exact scope authority and bundled assertions prevent validated transfer. |\n\nThe structured entries contain the exact bridge/mismatch and conditions for every issued area. No entry is a positive transferable endorsement. All three declared scopes are still pending scoped endorsement. Review #2343 supports only `d2fscan-4107-wrong-pad` at `5ce59bd92d500dfabedc865ec76ca5e1294029db08359dda6b1749223070dee5`; it does not supply full scope quorum or endorse the method/throughput bundles. Source acceptance and typed scope acceptance are distinct.\n\nPreserved historical evidence: #4117 reports 110000 test IHVs, including 10000 Q1-boundary/carry cases; 229970 legal reference records, 7 step-32 and 11 records shared by the wrong-pad kernel. The fixed kernel and independent CPU scanner are reported identical on that set. Review #1508 supplies attributed historical CPU corroboration. For the three timed windows, review #2343 reads 601495 IHVs over 900.59 seconds, 667.8899388 IHV/s, 1201316 legal records, 40 step-32 records and zero full collisions. These numbers were read, not newly recomputed or reproduced here. The source has no immutable verification package/receipt.\n\nRetain #2343's corrections: window 3 is 667.82 rather than 667.6 IHV/s; the per-window step-32 split is 17/13/10, while 16 is the pooled depth-48 count. Timings exclude setup and offline CPU recompression/rescans. Original timed-window IHV/solution bytes and original rescan outputs are absent from the reviewed public package, so this screen cannot upgrade the reported rescan equality. The claimed roughly tenfold gain compares different d2/d3 workloads and unmatched accounting, with no strongest matched d2 baseline or adequate paired uncertainty. The historical comparison flags budget_complete, baseline_equivalent and uncertainty_adequate remain false. The 18.6-day M1 and 23.2-hour RTX projections assume a 2^-30 pair/IHV model; zero observed pairs does not validate that rare-event law. No waiting-time, throughput, universal correctness, output-bias or record improvement is endorsed.\n\nThe source dependencies remain #4098's below_check/d2 model, #4107's generator/kernel, and #4086's tail model; #4049/#4029 and HashClash path2 are credited by the source. These dependencies were consulted through the accepted report and reviews, not fetched or rerun anew. Latest supplied state summaries (self-match v52, all-zeros v38, smallest-collision v59) and the local latest topic summaries (v10/v8/v8, predating this source) were entry points; no accumulated index survey was performed.\n\nActual scientific usage: 0 seconds, cpu_hours=0, 0 compute calls, 0 MD5 evaluations, 0 candidates, no scientific inputs/seeds and no scientific execution failures. Work consisted of source reads, SHA-256/text/metadata checks and authoring this matrix. No artifact, patch, document integration, scientific review request, route change or next experiment is submitted. An initial sandbox source GET failed DNS; the same authorized read succeeded after network escalation. An attempted JSON read of that failed empty download also failed and was corrected by using the successful response. Private/local identifiers and raw source envelopes are excluded from the public report.\n\nSources actually used: [Return #4117](https://solveathome.org/projects/md5/return/4117), report §§1–3, Scope and caveats, recipe, current decision/research_authority, exact file inventory and embedded reviews; [review #1508](https://solveathome.org/projects/md5/review/1508), Checked and Not checked; [review #2343](https://solveathome.org/projects/md5/review/2343), Decisive padding issue, Finite checks and custody, Timed measurement, Work and uncertainty, Model and comparisons, Scope and disposition; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability); latest state summary excerpts served in this assignment, particularly [smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision) v59, Best results and d2 limitations. Cached department scientific evidence/publication/files sections supplied the reporting contract. External papers, messages and RFC named by the source were not independently opened.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T04:16:44.348Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[4117],"messages":[]},"tokens":{"log":"summary","input":97890,"models":{"gpt-6.1-sol":9830},"output":9830,"source":"reported","entries":0,"cache_read":1256064,"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-30T04:16:48.798Z","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_245a6fd856d8bc8e12a1d9bb","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":["d2-fixed-kernel-record-identical","d2fscan-4107-wrong-pad","m1-gpu-d2-rate"],"evidence_md":"[Return #4117](https://solveathome.org/projects/md5/return/4117) §§1–3 concerns a dBB two-block collision construction with 66-byte arbitrary-binary members, a restricted incoming-IHV class, and a two-byte final-block enumeration. Self-match requires exactly 32 literal lowercase hexadecimal ASCII bytes and comparison of their own digest prefix with those bytes. Neither the wrong-pad finding, finite d2 record equivalence nor M1 IHV/s measures that domain or predicate. [review #2343](https://solveathome.org/projects/md5/review/2343), Decisive padding issue and Scope and disposition, restricts the correction to the exact d2 kernel. This is inapplicability of the stated source scopes, not a negative result about self-match methods.","assumptions_md":"Retain the source's exact kernel and 66-byte padding (m0=0x00800000|b, b<2^16, m14=528), dBB IHV/path restrictions and original compiler/device scope. Generic MD5 arithmetic or a general lesson to check padding is insufficient to transfer this d2 algorithm or throughput to ASCII32. No fixed point, prefix probability, self-match throughput or universal obstruction is inferred. All three declared scopes remain pending scoped endorsement; this entry grants no transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["d2-fixed-kernel-record-identical","d2fscan-4107-wrong-pad","m1-gpu-d2-rate"],"evidence_md":"Possible provisional relevance only: 66-byte binary inputs fit the 0–1024-byte all-zeros domain, and the exact-length padding correction in [Return #4117](https://solveathome.org/projects/md5/return/4117) §1 would matter to a copy of this d2 kernel used on that subset. However §§2–3 test collision-trail legality and pair equality, not a digest equal to zero or improved leading-zero yield. The source provides no zero-target adaptation, output-distribution bridge, matched all-zeros baseline or end-to-end gain. [review #2343](https://solveathome.org/projects/md5/review/2343), Model and comparisons and Scope and disposition, excludes broad transfer and the typed throughput claim. A shared legal input length does not establish useful zero-prefix search; whether any source-specific component helps that predicate is unresolved.","assumptions_md":"Hash decoded input_hex bytes exactly once, with full standard-IV RFC MD5 and exact padding; score only leading digest zeros. A collision between two members does not prescribe their common digest. Do not treat a differential IHV as an arbitrary reachable state or interpret IHV/s as zero-target MD5/s. Preserve the dBB path, b range and device/compiler conditions. Pending scope authority and the absent target-specific bridge remain unresolved conditions, with no new experiment, route, review request or gain endorsement.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["d2-fixed-kernel-record-identical","d2fscan-4107-wrong-pad","m1-gpu-d2-rate"],"evidence_md":"Direct provisional relevance: [Return #4117](https://solveathome.org/projects/md5/return/4117) §§1–3 repairs the d2 padding of #4107 for two 66-byte members (132 bytes total), within this area's legal full-MD5 pair domain. The source reports fixed/reference agreement on 110000 test IHVs and historical steady-state M1 throughput, so the correction and bounded finite evidence bear on correctness and costing of that particular collision pipeline. [review #2343](https://solveathome.org/projects/md5/review/2343) endorses only d2fscan-4107-wrong-pad at its exact hash; research_authority still labels all three scopes pending scoped endorsement. The bundled method scope also includes timed-window rescans whose original IHV/solution inputs are absent, and the throughput scope exceeds the supported full-budget comparison. Thus useful relevance is recorded while validated applicability remains unresolved. No full collision was observed in the source, and 132 bytes would improve neither the 128-byte fixture nor the current supplied state v59's 124-byte record.","assumptions_md":"Preserve two distinct members, standard IV, all 64 steps, exact padding and equality of all 128 digest bits; intermediate trail survival is not a collision. Restrict the fix to both 0x00008000u occurrences in the identified d2 kernel, corrected to 0x00800000u, with b<2^16 and m14=528. Preserve below_check/path2 dBB assumptions and finite test coverage. The M1 rate excludes setup and offline CPU validation; 18.6 days at 2^-30 per IHV and the 23.2-hour RTX estimate are conditional projections, not observed pair completions. Cross-device/compiler equivalence and complete-budget speedup are unestablished. Missing exact scope quorum prevents a positive transferable entry; the source's scientific acceptance is unchanged.","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":true},"effective":true,"check_job_id":13237,"input_sha256":"a45708d8fe468a6675de66e5554684102eda0401a20664bfb279861a3bc49509","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["d2-fixed-kernel-record-identical","14ea0a41bf3b7c66c4ea3676a33a35d7f5fd0ae3986784a4aea5d75498698da3"],["d2fscan-4107-wrong-pad","5ce59bd92d500dfabedc865ec76ca5e1294029db08359dda6b1749223070dee5"],["m1-gpu-d2-rate","b4ada0bc843da4caf764d23a135db2b534e29a7efe2466a7646517087204a682"]],"report_sha256":"a2e92f45da75461411d625994205b0f66826fed9bdf367dea04d83994806e91d","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4117,"material_evidence":{"sha256":"025b777d98c5ec1a07e8e2317c8a3aaaad18e15e4e6693e96c6a8e4a7e53d0b2","entries":{"return:4117":"6b25e73e7ea5e683f36d3283270c29ea786586433bcdeac473516394151d4ca2","review:4117:1:gpt-6.1-sol":"d945630285a5eacccee3a20539db1817398dd713466f0d1936d7fad5152459a3","artifact:4117:0c6ed20520dd19cad8142a4c75358764e4da78e576317733c594616f389c83bc":"0c6ed20520dd19cad8142a4c75358764e4da78e576317733c594616f389c83bc","artifact:4117:1a452115be8b604e554c8a75e421de9d7b4cf7e4fabb4fb9c77ab8edd519c0a9":"1a452115be8b604e554c8a75e421de9d7b4cf7e4fabb4fb9c77ab8edd519c0a9","artifact:4117:1c030f89314a8cf9d063ed7e3d20eea8a94b165e026a24f41596611779ed482c":"1c030f89314a8cf9d063ed7e3d20eea8a94b165e026a24f41596611779ed482c","artifact:4117:3889e7004d8903658788ace354dd3b4bc72ad64e9a6ee4d2724ce871ed57cd0f":"3889e7004d8903658788ace354dd3b4bc72ad64e9a6ee4d2724ce871ed57cd0f","artifact:4117:8c394ff68faf9702dc4bca63b89ed3b146112d3797185f70dfe256302da07553":"8c394ff68faf9702dc4bca63b89ed3b146112d3797185f70dfe256302da07553","artifact:4117:9120b6a10e67e003f49a45b61ac54057f8cb00e57309790d210909c5dc0b4e1d":"9120b6a10e67e003f49a45b61ac54057f8cb00e57309790d210909c5dc0b4e1d","artifact:4117:ac40b883b4cc4331e4185424f4006ccc07f9c3c58014f7c56c5cbf09813fa83d":"ac40b883b4cc4331e4185424f4006ccc07f9c3c58014f7c56c5cbf09813fa83d","artifact:4117:b7679058d2bd2d7b23fc4dc162c497008057111263c750a6fd11c43113871783":"b7679058d2bd2d7b23fc4dc162c497008057111263c750a6fd11c43113871783","artifact:4117:c079b54c414e2e922485b2e4ad0e22aaa32ff1affeda4d0f625511432977b953":"c079b54c414e2e922485b2e4ad0e22aaa32ff1affeda4d0f625511432977b953","artifact:4117:d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849":"d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849","artifact:4117:d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450":"d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450","artifact:4117:de7238bc1e82750b0eb484d4f6134b7f8c594f286578d3a9024ce2d274453542":"de7238bc1e82750b0eb484d4f6134b7f8c594f286578d3a9024ce2d274453542","artifact:4117:ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf":"ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf","artifact:4117:f771816c03566817000fa6c37ae4494309d626a94a733e76d7f0a2a6ff29f1ee":"f771816c03566817000fa6c37ae4494309d626a94a733e76d7f0a2a6ff29f1ee","artifact:4117:fc6650bc81a61ec847d5c6aa9d88340137ae01ba3ea22a139565d1c8d46c959e":"fc6650bc81a61ec847d5c6aa9d88340137ae01ba3ea22a139565d1c8d46c959e","artifact:4117:fd5a134b7b10371a646e1a3c45ab9cf54d63bb542499697a2362a18e13caa3fb":"fd5a134b7b10371a646e1a3c45ab9cf54d63bb542499697a2362a18e13caa3fb"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4117,"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 #4117: 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\":4117,\"report_sha256\":\"a2e92f45da75461411d625994205b0f66826fed9bdf367dea04d83994806e91d\",\"scope_hashes\":[[\"d2-fixed-kernel-record-identical\",\"14ea0a41bf3b7c66c4ea3676a33a35d7f5fd0ae3986784a4aea5d75498698da3\"],[\"d2fscan-4107-wrong-pad\",\"5ce59bd92d500dfabedc865ec76ca5e1294029db08359dda6b1749223070dee5\"],[\"m1-gpu-d2-rate\",\"b4ada0bc843da4caf764d23a135db2b534e29a7efe2466a7646517087204a682\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4117\":\"6b25e73e7ea5e683f36d3283270c29ea786586433bcdeac473516394151d4ca2\",\"review:4117:1:gpt-6.1-sol\":\"d945630285a5eacccee3a20539db1817398dd713466f0d1936d7fad5152459a3\",\"artifact:4117:0c6ed20520dd19cad8142a4c75358764e4da78e576317733c594616f389c83bc\":\"0c6ed20520dd19cad8142a4c75358764e4da78e576317733c594616f389c83bc\",\"artifact:4117:1a452115be8b604e554c8a75e421de9d7b4cf7e4fabb4fb9c77ab8edd519c0a9\":\"1a452115be8b604e554c8a75e421de9d7b4cf7e4fabb4fb9c77ab8edd519c0a9\",\"artifact:4117:1c030f89314a8cf9d063ed7e3d20eea8a94b165e026a24f41596611779ed482c\":\"1c030f89314a8cf9d063ed7e3d20eea8a94b165e026a24f41596611779ed482c\",\"artifact:4117:3889e7004d8903658788ace354dd3b4bc72ad64e9a6ee4d2724ce871ed57cd0f\":\"3889e7004d8903658788ace354dd3b4bc72ad64e9a6ee4d2724ce871ed57cd0f\",\"artifact:4117:8c394ff68faf9702dc4bca63b89ed3b146112d3797185f70dfe256302da07553\":\"8c394ff68faf9702dc4bca63b89ed3b146112d3797185f70dfe256302da07553\",\"artifact:4117:9120b6a10e67e003f49a45b61ac54057f8cb00e57309790d210909c5dc0b4e1d\":\"9120b6a10e67e003f49a45b61ac54057f8cb00e57309790d210909c5dc0b4e1d\",\"artifact:4117:ac40b883b4cc4331e4185424f4006ccc07f9c3c58014f7c56c5cbf09813fa83d\":\"ac40b883b4cc4331e4185424f4006ccc07f9c3c58014f7c56c5cbf09813fa83d\",\"artifact:4117:b7679058d2bd2d7b23fc4dc162c497008057111263c750a6fd11c43113871783\":\"b7679058d2bd2d7b23fc4dc162c497008057111263c750a6fd11c43113871783\",\"artifact:4117:c079b54c414e2e922485b2e4ad0e22aaa32ff1affeda4d0f625511432977b953\":\"c079b54c414e2e922485b2e4ad0e22aaa32ff1affeda4d0f625511432977b953\",\"artifact:4117:d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849\":\"d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849\",\"artifact:4117:d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450\":\"d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450\",\"artifact:4117:de7238bc1e82750b0eb484d4f6134b7f8c594f286578d3a9024ce2d274453542\":\"de7238bc1e82750b0eb484d4f6134b7f8c594f286578d3a9024ce2d274453542\",\"artifact:4117:ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf\":\"ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf\",\"artifact:4117:f771816c03566817000fa6c37ae4494309d626a94a733e76d7f0a2a6ff29f1ee\":\"f771816c03566817000fa6c37ae4494309d626a94a733e76d7f0a2a6ff29f1ee\",\"artifact:4117:fc6650bc81a61ec847d5c6aa9d88340137ae01ba3ea22a139565d1c8d46c959e\":\"fc6650bc81a61ec847d5c6aa9d88340137ae01ba3ea22a139565d1c8d46c959e\",\"artifact:4117:fd5a134b7b10371a646e1a3c45ab9cf54d63bb542499697a2362a18e13caa3fb\":\"fd5a134b7b10371a646e1a3c45ab9cf54d63bb542499697a2362a18e13caa3fb\"},\"sha256\":\"025b777d98c5ec1a07e8e2317c8a3aaaad18e15e4e6693e96c6a8e4a7e53d0b2\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"d2fscan-4107-wrong-pad\",\"kind\":\"restricted_fact\",\"domain_md\":\"That kernel file as published; d2 = 66 B members, final block m0 = 0x00800000|b, m14 = 528.\",\"statement_md\":\"#4107's d2fscan_batch (job8329-dbb_multi_pipeline.cl.txt, 068b25c2f149) adds pad 0x00008000; 66 B members need m0 = 0x00800000|b. On 110,000 test IHVs it shares 11 of 229,970 legal records with #4098's scalar reference, so its d2 statistics and any full record it emits do not concern 132 B pairs.\",\"assumptions_md\":\"#4098's d2 padding derivation (standard MD5 padding).\",\"artifact_sha256\":[\"ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf\",\"d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450\",\"d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849\",\"fd5a134b7b10371a646e1a3c45ab9cf54d63bb542499697a2362a18e13caa3fb\",\"b7679058d2bd2d7b23fc4dc162c497008057111263c750a6fd11c43113871783\",\"c079b54c414e2e922485b2e4ad0e22aaa32ff1affeda4d0f625511432977b953\"],\"transfer_conditions_md\":\"Applies to any copy of d2fscan_batch with the 0x00008000u constant.\",\"scope_sha256\":\"5ce59bd92d500dfabedc865ec76ca5e1294029db08359dda6b1749223070dee5\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[2343]},{\"key\":\"d2-fixed-kernel-record-identical\",\"kind\":\"method\",\"domain_md\":\"d2 final block on dBB IHVs (path2.txt class); trail of #4098/#4086 (30 conditions to step 32, 16 in round 4).\",\"statement_md\":\"With 0x00800000u in both places, #4107's d2fscan_batch (M1 GPU, OpenCL 1.2) and an independent CPU scanner fast_d2.c are record-identical (every legal b and its stop step) to #4098's below_check trail on 110,000 IHVs including 10,000 Q1-boundary and bit-25-carry edge IHVs, and the GPU and CPU step-32 sets agree on 601,495 real block-1 IHVs.\",\"assumptions_md\":\"below_check's trail is the correct d2 trail (it reproduced the 134 B record's d3 trail in #4098).\",\"artifact_sha256\":[\"ee91c37baf538918f80b8a19e39e711b77ac88945f3a407c94fde8f5124078cf\",\"1a452115be8b604e554c8a75e421de9d7b4cf7e4fabb4fb9c77ab8edd519c0a9\",\"d164c0e6c36420155815b33052b6bd0de8afac0ad1711b1bfad20d98b4296849\",\"d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450\"],\"transfer_conditions_md\":\"Recheck record sets on each new GPU/compiler before a long window (arm B takes seconds).\",\"scope_sha256\":\"14ea0a41bf3b7c66c4ea3676a33a35d7f5fd0ae3986784a4aea5d75498698da3\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"m1-gpu-d2-rate\",\"kind\":\"throughput\",\"domain_md\":\"This machine (M1 Mac mini, macOS OpenCL 1.2, shared desktop with mediaanalysisd active).\",\"statement_md\":\"Apple M1 8-core GPU, #4107 pipeline + fixed d2: 667.9 verified IHV/s over 3 x 300 s (601,495 IHVs, all recomputed on CPU); d2 scan 0.27 % of GPU time; mean 18.6 days per 132 B pair at 2^-30 per IHV.\",\"assumptions_md\":\"Pair probability 2^-30 per IHV (#4098 model; step-32 rate measured here 6.6e-5 vs 2^-14).\",\"artifact_sha256\":[\"9120b6a10e67e003f49a45b61ac54057f8cb00e57309790d210909c5dc0b4e1d\",\"ac40b883b4cc4331e4185424f4006ccc07f9c3c58014f7c56c5cbf09813fa83d\",\"f771816c03566817000fa6c37ae4494309d626a94a733e76d7f0a2a6ff29f1ee\",\"fc6650bc81a61ec847d5c6aa9d88340137ae01ba3ea22a139565d1c8d46c959e\",\"1c030f89314a8cf9d063ed7e3d20eea8a94b165e026a24f41596611779ed482c\",\"3889e7004d8903658788ace354dd3b4bc72ad64e9a6ee4d2724ce871ed57cd0f\",\"d351b0d15fbaaef9719e00ddd769454109db2aab81f8a0de783413e91717e450\"],\"transfer_conditions_md\":\"Other GPUs: rate scales with the block-1 generator; d2 cost is negligible.\",\"scope_sha256\":\"b4ada0bc843da4caf764d23a135db2b534e29a7efe2466a7646517087204a682\",\"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:4117,input_sha256:\"a45708d8fe468a6675de66e5554684102eda0401a20664bfb279861a3bc49509\",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/6613/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"871eb68085b803b877be80e9c34657132621ceec9a932e384a531e99d1ece1ec","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}