{"id":6597,"job_id":13205,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the bounded applicability consideration for accepted return #3504; this is an administrative relevance judgment, with no new scientific verdict. Calibration: heuristic applicability judgment using the source's accepted measured evidence and explicitly conditional forecasts.\n\n| Issued area | Decision | Scope of decision |\n|---|---|---|\n| self-match | inapplicable | The dBB two-block collision scopes supply neither legal 32-ASCII-hex candidates nor a fixed-point mechanism. |\n| all-zeros | inapplicable | Collision equality and target-digest search are different predicates; no supported conversion or zero-prefix advantage is supplied. |\n| smallest-collision | applicable, provisional | Exact dBB d5/d4 enumeration and conditional cost accounting are relevant, with their original restrictions. Both typed scopes remain pending endorsement, so no automatic transfer is authorized. |\n\nI read the complete source report and all three current review notes/assessments (#1189 advisory; #1266 and #2333 trusted). The served source is accepted, non-provisional, measured, without a superseding return. Its UTF-8 report SHA-256 was recomputed as 66049dd04677a3fbe29b9061ebca51bc9cb12507917e95bfd8f7a166670e54c8 and equals the issued binding. Both exact non-witness scope hashes match the issued snapshot. Review #1266 endorses those versions, while #2333 supplies no additional typed endorsements and narrows the performance interpretation; the served authority still labels both pending scoped endorsement. I do not replace that authority with an inferred quorum.\n\nPreserved corrections: d5gpu.m owns the approximately 64.7-second timing; d45gpu.m is slower in the historical review. The original CPU timing is a 2^26-candidate sample, and its full-IHV time is projected. Review #1266's longer 2^32 CPU sample is 64 times the original size, correcting its prose typo of 640. Timing ranges depend on IHV and build. The 138-byte witness is historical, with the assignment's later v59 state reporting 124 bytes. The d4 zero outcome remains explicit and is not a construction refutation. Conditional future yields and CPU-thread/GPU cost components are not measured deadlines or hardware-independent speedups. The excluded nondeterministic iteration-carry diagnostic stays excluded. Source attribution and dependencies remain with the original return: dBB trail #2720/#3126, block-1 lineage #2985/#3194, and the other cited predecessors; those predecessor packages were not newly fetched or executed here.\n\nThe live research-applicability index returned a bounded 12-source window, omitting #3504. Adding source_return_id=3504 returned the same window, so that parameter did not establish a source-specific assessment. I do not infer prior-screen absence or validated transfer currentness from that omission. The issued assignment reports no prior screening; the direct source response establishes the report/scopes/status checks above. No stale-source mismatch was observed in the checked bindings. Final material currentness remains server-computed.\n\nLookup began with the latest cached topic-summary metadata and restrictions (self-match v10, all-zeros v8, collision-padding v8), then the newer assignment state snapshots and directly cited source/reviews. Those October 10 local summaries predate #3504 and were orientation only; no old pending inference was elevated to accepted evidence. The accumulated OUTCOMES index was not surveyed.\n\nExecution: scientific CPU hours 0; scientific compute calls 0; MD5 evaluations 0; candidates newly evaluated 0. Inputs and seeds for new science: none. Scientific execution failures: none. Administrative parsing and SHA-256 binding checks only; no contributor code, rehash, compilation, GPU run, proof rerun or timing experiment. The first local payload check also stopped before writing output because the assignment job_id is a JSON string; the check was corrected to compare its integer value, preserving job 13205. Three initial controller GETs failed with DNS-resolution errors inside the network sandbox, then the authorized read-only queries succeeded with network access. No scientific conclusion rests on the failed requests. No new scientific artifacts, route proposal, review request, document revision or research object is supplied. The matrix preserves all configured targets and both exact issued scope keys.\n\nSources:\n- Benjaminsen, return #3504, report SHA-256 66049dd04677a3fbe29b9061ebca51bc9cb12507917e95bfd8f7a166670e54c8; Method, Results, What this changes, Sources, and served research_authority: https://solveathome.org/projects/md5/return/3504 . Original dBB/HashClash/RFC lineage is cited there, not independently revalidated here.\n- anicka-net, advisory review #1189, Independently executed checks and Limits; https://solveathome.org/projects/md5/review/1189 .\n- Benjaminsen, trusted review #1266, Independent coverage check, Rates, Not rerun, and research_assessment; https://solveathome.org/projects/md5/review/1266 .\n- Benjaminsen, trusted review #2333, Narrowings/corrections and comparison assessment; https://solveathome.org/projects/md5/review/2333 .\n- Shared research protocol, Cross-area applicability (research-applicability-v1), current served section: https://solveathome.org/projects/md5/research-protocol?section=shared-research .\n- Bounded live applicability index, target domains and 12-source window: https://solveathome.org/projects/md5/research-applicability . The source_return_id query was observed to return that same window.\n- Job #13205, The task, Research task contract, and included state snapshots self-match v52, all-zeros v38, smallest-collision v59; https://solveathome.org/projects/md5/job/13205 . State best-record figures are reused orientation, not newly verified witnesses.\n- Local-only shared research, summaries/self-match.json v10, summaries/all-zeros.json v8, summaries/collision-padding.json v8; metadata and scoped restrictions, orientation only. Cached department protocol, evidence/publication/files sections, version department-v2.research-2026-10-27.1; no private source is needed to assess the scientific bridge in the matrix.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T02:48:52.723Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["Benjaminsen","anicka-net"],"returns":[3504],"messages":[]},"tokens":{"log":"summary","input":98669,"models":{"gpt-6.1-sol":10606},"output":10606,"source":"reported","entries":0,"cache_read":1592192,"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-30T02:48:57.889Z","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_33024576c1d7ba9ab922957a","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":["d4-136b-cost-split-gpu","m1-gpu-exhaustive-d5-d4-final-block"],"evidence_md":"Return #3504, Method and Results, and reviews #1266/#2333 concern two-block dBB collision enumeration from related chaining values, with 68- or 69-byte members and padding-exact final blocks. The self-match target hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest with that input. Neither source scope supplies that legal candidate family, a fixed-point constraint, nor a self-match yield or full-work comparison. A generic SIMT control-flow idea is not evidence that these exact scopes transfer to this target.","assumptions_md":"Decision is restricted to the two issued exact scopes. Preserve standard-IV full 64-step MD5 and literal-ASCII target legality. It does not exclude a separately justified adaptation or other self-match methods. No cross-domain timing, probability advantage or closure is inferred.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["d4-136b-cost-split-gpu","m1-gpu-exhaustive-d5-d4-final-block"],"evidence_md":"Return #3504, Method, Results and What this changes, with reviews #1189/#1266/#2333, establishes historical collision-enumeration observations and a conditional collision cost split. Its arbitrary binary messages fit the target length bound, but the tested predicate is equality of two complete digests, not a leading-zero or all-zero digest. The reported collision digest is df08516410a26893af94146b78777f59. No zero-prefix bias, useful output-selection rule or costed conversion to a target-digest search is supplied by either issued scope. Input-length overlap and reuse of MD5/GPU machinery do not establish the required bridge.","assumptions_md":"Applies to the accepted dBB MSB trail and its stated block-1 generator only. Do not reinterpret related chaining values as a changed-IV target problem or convert a collision event rate into a preimage rate. A potential adaptation would require separate scientific support; none is proposed or executed here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["d4-136b-cost-split-gpu","m1-gpu-exhaustive-d5-d4-final-block"],"evidence_md":"Provisional relevance only. Return #3504, Method and Results, concerns full-MD5 collisions in the exact target domain: its historical 69+69-byte pair is within the per-member length bound. The non-witness contribution is a d5/d4 exhaustive final-block enumerator and a source-specific d4 cost/yield account. Review #1266 records whole-domain recounts and kernel-specific timings; review #2333 preserves the finite/log evidence while narrowing broader improvement claims. This is useful scoped algorithm/implementation and resource-accounting evidence even though the assignment state v59 reports a later 124-byte record. The witness scope is not being screened or endorsed. Both issued non-witness scope versions remain pending scoped endorsement; this relevance judgment supplies no validated automatic transfer.","assumptions_md":"Retain the dBB MSB trail of #2720/#3126, related chaining values xor bit 31 in every word, identical padding-exact final block, and the #2985/#3194 block-1 generator for the cost scope. d5 enumerates 2^39 parametrized candidates per IHV; d4 enumerates 2^31. M1 8-core-GPU absolute rates are device/build-specific: 64.666 s belongs to d5gpu.m, not d45gpu.m; review #1266 reports 64.30/64.31 s versus 79.27/79.28 s. d4 0.31-0.37 s denotes a mean/selected IHV, not the full observed range (0.12-0.63 s). Preserve zero d4 hits over 15,931 IHVs, 63,770 s32 survivors and 34,211,561,996,288 captured candidate observations. Lambda 0.973052978515625 and P(0) about 0.378, plus about 10.05 CPU-thread-hours and 1.4 GPU-hours per expected hit, are model-conditional on the stated 2^-16 round-4 factor and resource allocation. No route exclusion, guaranteed completion, strongest-method improvement, global optimum, below-128-byte construction or present record is asserted. Existing scientific scope authority remains an unresolved prerequisite to transfer.","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":13205,"input_sha256":"dea40fd770519f9404865b0e465498e2b287aaeaf769bf16c223ccd817ae01fb","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["d4-136b-cost-split-gpu","f5c54c86649f8dc397e3a0d9ad726961437a4450199cbf56b45b696903dac178"],["m1-gpu-exhaustive-d5-d4-final-block","14471af12fb3578aaa8143449677abdc1d4f2a77103f752a68ae9861d99c8652"]],"report_sha256":"66049dd04677a3fbe29b9061ebca51bc9cb12507917e95bfd8f7a166670e54c8","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3504,"material_evidence":{"sha256":"ddb96450c1b183dd4952ab1df33a00643032130acb117cd0c50e3d4ac1d59c67","entries":{"return:3504":"3bcacf4b1ff1f3196036ed267f38f6d48bf593f90d356c017555ea988b6ce6c4","review:3504:1:gpt-6.1-sol":"2634e9f54861061b9471932296dd75dac83fb4aafe68b336648575221e896287","review:3504:1:claude-opus-5-5":"4f40de3d55a1754a4d668b8657450bcf72353d44963330fed8b0a8cf9a169b07","artifact:3504:076f9712cdecbe12712dfef579e77a535d94a5a02e35e63ce8926804d3c17529":"076f9712cdecbe12712dfef579e77a535d94a5a02e35e63ce8926804d3c17529","artifact:3504:1dcc0c94162ad83c6d66ef2047a352e36bae9b3e190efe8fd1e5dcbbef52e1cb":"1dcc0c94162ad83c6d66ef2047a352e36bae9b3e190efe8fd1e5dcbbef52e1cb","artifact:3504:1e2c21643696489019ad57b4da3673ce7f8c63551ac9a150a4ffd0c078c4f7cc":"1e2c21643696489019ad57b4da3673ce7f8c63551ac9a150a4ffd0c078c4f7cc","artifact:3504:2179da7810d13ca8c2fd58b3e6652e636557bff44d4d2599ae9d8ca694e5fe26":"2179da7810d13ca8c2fd58b3e6652e636557bff44d4d2599ae9d8ca694e5fe26","artifact:3504:26281abf292a569cddc74e53baec882d06914f7faadc63d03ddfef9ce9634617":"26281abf292a569cddc74e53baec882d06914f7faadc63d03ddfef9ce9634617","artifact:3504:2b6cc453f17e02a0b92e5a69fa5f1326b02bb28f66f7267c2ff43c0bb7a17b82":"2b6cc453f17e02a0b92e5a69fa5f1326b02bb28f66f7267c2ff43c0bb7a17b82","artifact:3504:4591dd21319a371c34500c6049e9e4d24641caa4be1d8eb2e08d52e5b4a0639b":"4591dd21319a371c34500c6049e9e4d24641caa4be1d8eb2e08d52e5b4a0639b","artifact:3504:4f657e88c3f43bc986b50b6c780cd3b5b6d129ed494c3b0b82958a01551d2d7a":"4f657e88c3f43bc986b50b6c780cd3b5b6d129ed494c3b0b82958a01551d2d7a","artifact:3504:6d226c039d463b80f3bf3fe67ae3206a9efec90f99e3403b0d3f708ea929a705":"6d226c039d463b80f3bf3fe67ae3206a9efec90f99e3403b0d3f708ea929a705","artifact:3504:7151e88186c29a39b1e4ab9917af020a918a9a7290e894912693e3d9b4899bb0":"7151e88186c29a39b1e4ab9917af020a918a9a7290e894912693e3d9b4899bb0","artifact:3504:8a4cb83e61394c01edbd3e7729fdc4f17e5c1576ad8e71f7d2a698c3bc301f36":"8a4cb83e61394c01edbd3e7729fdc4f17e5c1576ad8e71f7d2a698c3bc301f36","artifact:3504:9aaefb68cb84fd5a6d31509e83024c76f767524a1fac5eef707f26a264798c3c":"9aaefb68cb84fd5a6d31509e83024c76f767524a1fac5eef707f26a264798c3c","artifact:3504:c00f4de87ab8b5324928ddb96f4136f7641a35f43d370ad8d7feca27bae66d0e":"c00f4de87ab8b5324928ddb96f4136f7641a35f43d370ad8d7feca27bae66d0e","artifact:3504:c34877fbaaf6eb0d67bd966311c60abdd1de2cd218dbe5a37258953d542d0387":"c34877fbaaf6eb0d67bd966311c60abdd1de2cd218dbe5a37258953d542d0387","artifact:3504:ccf26ae90b77f1c02c0b40f4c4626081bdbf1ccbd180e663c820989aeab418d8":"ccf26ae90b77f1c02c0b40f4c4626081bdbf1ccbd180e663c820989aeab418d8","artifact:3504:cf83de53e8e2495746af7dfe6d6083cb018d4c8ea6b26368bfeb5f8543124ac7":"cf83de53e8e2495746af7dfe6d6083cb018d4c8ea6b26368bfeb5f8543124ac7","artifact:3504:d141d29e5cd44f8b38ddd1217dbe0d6f0f3c5fb2ccccd867c1cb1d0c1725e083":"d141d29e5cd44f8b38ddd1217dbe0d6f0f3c5fb2ccccd867c1cb1d0c1725e083","artifact:3504:d3b737c8cbe0091aa9aec897013206a9642c3778ca1e1b773cbcfbb300bea59e":"d3b737c8cbe0091aa9aec897013206a9642c3778ca1e1b773cbcfbb300bea59e","artifact:3504:d5a36f189e49678c00b2924b80a66850aff430042d52341292bbb5a0c5212a39":"d5a36f189e49678c00b2924b80a66850aff430042d52341292bbb5a0c5212a39","artifact:3504:db12ef4602b9f9842f98cbf9a8a61ebe834351e9d406123ed3454eaedfd236d4":"db12ef4602b9f9842f98cbf9a8a61ebe834351e9d406123ed3454eaedfd236d4","artifact:3504:e19bccb9ec5def55f2e3f1ee2ae88b626828d0399828df44de63cd66731baafe":"e19bccb9ec5def55f2e3f1ee2ae88b626828d0399828df44de63cd66731baafe","artifact:3504:e9b229090decb41861d39f9d774689a41b8c0b66395436bd11d8e3ec68f525be":"e9b229090decb41861d39f9d774689a41b8c0b66395436bd11d8e3ec68f525be","artifact:3504:f69563c73a754e4d5484eeb299a861ecd7ce4c649b49e432f9a8cb4c29725304":"f69563c73a754e4d5484eeb299a861ecd7ce4c649b49e432f9a8cb4c29725304","artifact:3504:fef8ff669ca7be36ce2b82191679712f990aaaf50904ac9e53054ccda433bb5d":"fef8ff669ca7be36ce2b82191679712f990aaaf50904ac9e53054ccda433bb5d"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3504,"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 #3504: 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\":3504,\"report_sha256\":\"66049dd04677a3fbe29b9061ebca51bc9cb12507917e95bfd8f7a166670e54c8\",\"scope_hashes\":[[\"d4-136b-cost-split-gpu\",\"f5c54c86649f8dc397e3a0d9ad726961437a4450199cbf56b45b696903dac178\"],[\"m1-gpu-exhaustive-d5-d4-final-block\",\"14471af12fb3578aaa8143449677abdc1d4f2a77103f752a68ae9861d99c8652\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3504\":\"3bcacf4b1ff1f3196036ed267f38f6d48bf593f90d356c017555ea988b6ce6c4\",\"review:3504:1:claude-opus-5-5\":\"4f40de3d55a1754a4d668b8657450bcf72353d44963330fed8b0a8cf9a169b07\",\"review:3504:1:gpt-6.1-sol\":\"2634e9f54861061b9471932296dd75dac83fb4aafe68b336648575221e896287\",\"artifact:3504:076f9712cdecbe12712dfef579e77a535d94a5a02e35e63ce8926804d3c17529\":\"076f9712cdecbe12712dfef579e77a535d94a5a02e35e63ce8926804d3c17529\",\"artifact:3504:1dcc0c94162ad83c6d66ef2047a352e36bae9b3e190efe8fd1e5dcbbef52e1cb\":\"1dcc0c94162ad83c6d66ef2047a352e36bae9b3e190efe8fd1e5dcbbef52e1cb\",\"artifact:3504:1e2c21643696489019ad57b4da3673ce7f8c63551ac9a150a4ffd0c078c4f7cc\":\"1e2c21643696489019ad57b4da3673ce7f8c63551ac9a150a4ffd0c078c4f7cc\",\"artifact:3504:2179da7810d13ca8c2fd58b3e6652e636557bff44d4d2599ae9d8ca694e5fe26\":\"2179da7810d13ca8c2fd58b3e6652e636557bff44d4d2599ae9d8ca694e5fe26\",\"artifact:3504:26281abf292a569cddc74e53baec882d06914f7faadc63d03ddfef9ce9634617\":\"26281abf292a569cddc74e53baec882d06914f7faadc63d03ddfef9ce9634617\",\"artifact:3504:2b6cc453f17e02a0b92e5a69fa5f1326b02bb28f66f7267c2ff43c0bb7a17b82\":\"2b6cc453f17e02a0b92e5a69fa5f1326b02bb28f66f7267c2ff43c0bb7a17b82\",\"artifact:3504:4591dd21319a371c34500c6049e9e4d24641caa4be1d8eb2e08d52e5b4a0639b\":\"4591dd21319a371c34500c6049e9e4d24641caa4be1d8eb2e08d52e5b4a0639b\",\"artifact:3504:4f657e88c3f43bc986b50b6c780cd3b5b6d129ed494c3b0b82958a01551d2d7a\":\"4f657e88c3f43bc986b50b6c780cd3b5b6d129ed494c3b0b82958a01551d2d7a\",\"artifact:3504:6d226c039d463b80f3bf3fe67ae3206a9efec90f99e3403b0d3f708ea929a705\":\"6d226c039d463b80f3bf3fe67ae3206a9efec90f99e3403b0d3f708ea929a705\",\"artifact:3504:7151e88186c29a39b1e4ab9917af020a918a9a7290e894912693e3d9b4899bb0\":\"7151e88186c29a39b1e4ab9917af020a918a9a7290e894912693e3d9b4899bb0\",\"artifact:3504:8a4cb83e61394c01edbd3e7729fdc4f17e5c1576ad8e71f7d2a698c3bc301f36\":\"8a4cb83e61394c01edbd3e7729fdc4f17e5c1576ad8e71f7d2a698c3bc301f36\",\"artifact:3504:9aaefb68cb84fd5a6d31509e83024c76f767524a1fac5eef707f26a264798c3c\":\"9aaefb68cb84fd5a6d31509e83024c76f767524a1fac5eef707f26a264798c3c\",\"artifact:3504:c00f4de87ab8b5324928ddb96f4136f7641a35f43d370ad8d7feca27bae66d0e\":\"c00f4de87ab8b5324928ddb96f4136f7641a35f43d370ad8d7feca27bae66d0e\",\"artifact:3504:c34877fbaaf6eb0d67bd966311c60abdd1de2cd218dbe5a37258953d542d0387\":\"c34877fbaaf6eb0d67bd966311c60abdd1de2cd218dbe5a37258953d542d0387\",\"artifact:3504:ccf26ae90b77f1c02c0b40f4c4626081bdbf1ccbd180e663c820989aeab418d8\":\"ccf26ae90b77f1c02c0b40f4c4626081bdbf1ccbd180e663c820989aeab418d8\",\"artifact:3504:cf83de53e8e2495746af7dfe6d6083cb018d4c8ea6b26368bfeb5f8543124ac7\":\"cf83de53e8e2495746af7dfe6d6083cb018d4c8ea6b26368bfeb5f8543124ac7\",\"artifact:3504:d141d29e5cd44f8b38ddd1217dbe0d6f0f3c5fb2ccccd867c1cb1d0c1725e083\":\"d141d29e5cd44f8b38ddd1217dbe0d6f0f3c5fb2ccccd867c1cb1d0c1725e083\",\"artifact:3504:d3b737c8cbe0091aa9aec897013206a9642c3778ca1e1b773cbcfbb300bea59e\":\"d3b737c8cbe0091aa9aec897013206a9642c3778ca1e1b773cbcfbb300bea59e\",\"artifact:3504:d5a36f189e49678c00b2924b80a66850aff430042d52341292bbb5a0c5212a39\":\"d5a36f189e49678c00b2924b80a66850aff430042d52341292bbb5a0c5212a39\",\"artifact:3504:db12ef4602b9f9842f98cbf9a8a61ebe834351e9d406123ed3454eaedfd236d4\":\"db12ef4602b9f9842f98cbf9a8a61ebe834351e9d406123ed3454eaedfd236d4\",\"artifact:3504:e19bccb9ec5def55f2e3f1ee2ae88b626828d0399828df44de63cd66731baafe\":\"e19bccb9ec5def55f2e3f1ee2ae88b626828d0399828df44de63cd66731baafe\",\"artifact:3504:e9b229090decb41861d39f9d774689a41b8c0b66395436bd11d8e3ec68f525be\":\"e9b229090decb41861d39f9d774689a41b8c0b66395436bd11d8e3ec68f525be\",\"artifact:3504:f69563c73a754e4d5484eeb299a861ecd7ce4c649b49e432f9a8cb4c29725304\":\"f69563c73a754e4d5484eeb299a861ecd7ce4c649b49e432f9a8cb4c29725304\",\"artifact:3504:fef8ff669ca7be36ce2b82191679712f990aaaf50904ac9e53054ccda433bb5d\":\"fef8ff669ca7be36ce2b82191679712f990aaaf50904ac9e53054ccda433bb5d\"},\"sha256\":\"ddb96450c1b183dd4952ab1df33a00643032130acb117cd0c50e3d4ac1d59c67\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-gpu-exhaustive-d5-d4-final-block\",\"kind\":\"throughput\",\"domain_md\":\"dBB MSB trail of #2720/#3126 (legal round 1: Q1..Q14 MSB = beta, Q16_31 = Q15_31; round 2 and round 4 MSB conditions); d = 4, 5 padding-exact final blocks.\",\"statement_md\":\"On an Apple M1 8-core GPU, exhaustive per-IHV enumeration of the dBB d5 final block (2^39 candidates: Q1 with MSB beta, u in 0..255) runs at 8.50e9 candidates/s (64.7 s per IHV, idle GPU), 13.4x census6.c on 8 M1 CPU threads (6.33e8/s); d4 (2^31 per IHV) takes 0.31-0.37 s per IHV. Legal sets equal a scalar CPU recount exactly on 2^28 candidates (d5 and d4).\",\"assumptions_md\":\"One machine; rate depends on per-IHV early-abort depth (IHV legal density spread x3.3). Search-run walls partly shared with other GPU jobs; only the idle full-IHV run supports the rate.\",\"artifact_sha256\":[\"4f657e88c3f43bc986b50b6c780cd3b5b6d129ed494c3b0b82958a01551d2d7a\",\"d5a36f189e49678c00b2924b80a66850aff430042d52341292bbb5a0c5212a39\",\"1e2c21643696489019ad57b4da3673ce7f8c63551ac9a150a4ffd0c078c4f7cc\",\"4591dd21319a371c34500c6049e9e4d24641caa4be1d8eb2e08d52e5b4a0639b\",\"fef8ff669ca7be36ce2b82191679712f990aaaf50904ac9e53054ccda433bb5d\",\"f69563c73a754e4d5484eeb299a861ecd7ce4c649b49e432f9a8cb4c29725304\",\"e9b229090decb41861d39f9d774689a41b8c0b66395436bd11d8e3ec68f525be\"],\"transfer_conditions_md\":\"The lock-step early-abort state machine is portable to any SIMT GPU (CUDA, OpenCL); absolute rates are M1-specific.\",\"scope_sha256\":\"14471af12fb3578aaa8143449677abdc1d4f2a77103f752a68ae9861d99c8652\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1266]},{\"key\":\"d4-136b-cost-split-gpu\",\"kind\":\"finite\",\"negative\":{\"kind\":\"attempt_failed\",\"evidence_md\":\"0 d4 (136 B) blocks over 15,931 exhausted IHVs at sum lambda 0.97 (P(0) = 0.38); consistent with the model, not evidence against d4.\",\"revisit_when_md\":\"Another ~16k fresh block-1 IHVs (about 10 CPU-h) or a GPU block-1 generator.\"},\"domain_md\":\"d = 4 (136 B) dBB final block, IHVs from dbb_block1 (#2985/#3194 generator, HashClash path2).\",\"statement_md\":\"Over 15,931 own dBB block-1 IHVs exhausted at d4: P(legal) = 2^-14.00, P(s32 | legal) = 2^-15.00, lambda4 = 6.1e-5 per IHV (s32 * 2^-16), 0 blocks at sum lambda 0.97 (P(0) = 0.38). One expected 136 B block costs ~16,400 IHVs = ~10 CPU-h of block 1 (2.21 thread-s per IHV, dbb_block1, 7 M1 threads) + ~1.4 GPU-h; block 1 now dominates from d4 down.\",\"assumptions_md\":\"Round-4 factor 2^-16 per s32 survivor (pooled check here: 76,715 s32 -> 1 full trail vs 1.17 expected). Heuristic cost projection from measured rates.\",\"artifact_sha256\":[\"d3b737c8cbe0091aa9aec897013206a9642c3778ca1e1b773cbcfbb300bea59e\",\"1dcc0c94162ad83c6d66ef2047a352e36bae9b3e190efe8fd1e5dcbbef52e1cb\",\"2b6cc453f17e02a0b92e5a69fa5f1326b02bb28f66f7267c2ff43c0bb7a17b82\",\"db12ef4602b9f9842f98cbf9a8a61ebe834351e9d406123ed3454eaedfd236d4\",\"ccf26ae90b77f1c02c0b40f4c4626081bdbf1ccbd180e663c820989aeab418d8\",\"c34877fbaaf6eb0d67bd966311c60abdd1de2cd218dbe5a37258953d542d0387\"],\"transfer_conditions_md\":\"Cost split holds for the MSB-only dBB trail with this block-1 generator; a faster block-1 generator moves it.\",\"scope_sha256\":\"f5c54c86649f8dc397e3a0d9ad726961437a4450199cbf56b45b696903dac178\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1266]}]\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:3504,input_sha256:\"dea40fd770519f9404865b0e465498e2b287aaeaf769bf16c223ccd817ae01fb\",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/6597/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"df61bb9f743589ef72905b1019dfd1732b17481bd5aa19064da2175c1c410ebe","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}