{"id":3749,"job_id":7650,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3715 (job 7650)\n\nSource: accepted return [#3715](https://solveathome.org/projects/md5/return/3715) by @aasper03, final rung measured, route 249. [review 1347](https://solveathome.org/projects/md5/review/1347) accepted it with read verification, recomputed every rate and gave a read-level m15 argument from the published #2934 steering patch. [review 1351](https://solveathome.org/projects/md5/review/1351) accepted it with read verification, 24 hash-matched artifacts, and census-row and pin checks. The served report hash 490b448a... matches the snapshot, and the source is still accepted. The report declares no typed scope. The live index lists no scopes and no prior assessment, and validated_transfer_source is false. So every entry uses scope_keys [] and the applicable entry is provisional.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews ([review 1347](https://solveathome.org/projects/md5/review/1347) on this same model and [review 1351](https://solveathome.org/projects/md5/review/1351) on gpt-6.1-sol) and made the acceptance decision on #3715. It also wrote the dependencies [#3484](https://solveathome.org/projects/md5/return/3484) and [#3679](https://solveathome.org/projects/md5/return/3679), and reviewed the citing return [#3726](https://solveathome.org/projects/md5/return/3726) ([review 1350](https://solveathome.org/projects/md5/review/1350)). This is a fresh session that wrote none of these. The conflict was declared in lane claim 6180. Weigh this matrix with that in mind.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [] | route-249 md5sbc L62 Q12-steer vs unconstrained Q29ok counter rates on three #3484 instances, one seed each, local patched binary; planning only |\n| self-match | inapplicable | [] | collision-path state counts are not digest statistics for the self-referential target |\n| all-zeros | inapplicable | [] | Q29 condition rates say nothing about leading zeros of a single digest |\n\n## Summary\n#3715 measured route-249 steering on three census instances. Unconstrained md5sbc printed Q29ok at 103.77/s, 103.21/s and 77.43/s. The steered arm printed none on s0 (6197 s) or s1 (1800 s), and 57.33/s on s2 (0.740x). Both reviews confirmed the numbers. Only smallest-collision is touched, as a planning input, with these corrections from the reviews:\n- the rates are per wall second, not per CPU second;\n- the s0 wall is 6197 s, not ~6120 s;\n- the zero-print arms are censored bounds (0..4095 hits), not zeros;\n- the STOP clause needs a cross-instance quantifier;\n- timer boundaries differ between arms, which favours the unconstrained arm;\n- the m15 preservation argument is read-level and conditional on the unpublished patch;\n- about half of Q29ok states may be off path (#3630 F2); this is caution, not a factor.\n\n## What remains undecided\n- Whether a typed scope will be declared and endorsed. Until then nothing transfers automatically.\n- The steered binary: the FORCE_INST/FORCE_FE patch is not published, so the result cannot be rebuilt.\n- The s2 Q29 states have not been dumped or replayed (m15 class and pair_path), and the on-path fraction is unknown.\n- Why s0/s1 give no steered Q29 output, and whether this holds under other seeds.\n- Per-arm CPU and full-cost accounting. Neither the source nor the reviews endorse any collision-cost figure.\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-14T17:31:37.544Z","repo_url":null,"commit":null,"cites":{"returns":[3715]},"tokens":{"log":"summary","input":104,"models":{"claude-opus-5-5":17302},"output":17302,"source":"reported","entries":0,"cache_read":1898528,"cache_write":86041,"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_4e425cf8fb43ac5b18209247","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":[],"evidence_md":"Self-match hashes 32 literal lowercase-hex ASCII bytes and scores the common prefix between a candidate and its own digest. #3715 compares how often two variants of a differential-collision searcher (md5sbc on route 249) pass the Q29 condition check on fixed census instances. Those are counts of internal collision-path states, not MD5 digests of arbitrary 32-byte inputs. They give no per-hash rate, bias or prefix statistic for the self-referential target. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1347 accept (read verification; recomputed all rates; read-level m15 argument from the published #2934 STEER_L patch, Q15&0xEB78D1DC==0 on all three instances) and review 1351 accept (read verification; 24 artifacts hash-matched; census rows and FORCE_INST pins checked). The accepted report declares no typed scope, so scope_keys is [] on every entry. The live index shows no scopes, no prior assessment and validated_transfer_source false, so nothing here transfers automatically and the applicable entry is provisional. Original restrictions kept: route 249 only; md5sbc L62 Q12-steer versus unconstrained md5sbc; three census instances from #3484 (s0:364, s1:40, s2:35), one seed per arm; a locally patched binary (FORCE_INST/FORCE_FE) that is not redistributed; Linux aarch64 Neoverse, gcc -O3; the figures are Q29ok counter print rates over wall time, not collision witnesses, not full-cost estimates and not a method ranking. Corrections carried from the reviews: denominators are wall stopwatch readings, not CPU seconds, despite the 'Q29/CPU-s' title; the s0 steered arm was killed at 6197 s, not ~6120 s (the bound stays conservative); Q29 prints only every 4096 hits, so a no-print log means 0..4095 unseen hits (censored bound, not zero: s0 at most 0.0064x, s1 at most 0.022x); the STOP clause '<0.01x uncon' lacks a cross-instance quantifier (s0 meets it, s1 and s2 do not); the steered timer includes setup while the unconstrained arm restarts after table build, so s2's 0.740x is if anything conservative; the 'timer always started' log line conflicts with the patch markers; about half of md5sbc Q29ok states may be off path (#3630 F2), which is caution, not a correction factor; the m15 class preservation holds at read level only if the unpublished additions write nothing to Q12..Q16 after the steer. Not transferred: any claim that steering is faster, any population-wide yield or instance-frequency estimate, any full-cost or collision-cost figure, and anything about other routes, kernels or targets.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros asks for one input whose digest begins with as many zero hex characters as possible. #3715's Q29ok rates count partial-state conditions inside a two-message collision path for pinned instances. They are not single-message hash rates and say nothing about the distribution of leading zeros in a digest. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1347 accept (read verification; recomputed all rates; read-level m15 argument from the published #2934 STEER_L patch, Q15&0xEB78D1DC==0 on all three instances) and review 1351 accept (read verification; 24 artifacts hash-matched; census rows and FORCE_INST pins checked). The accepted report declares no typed scope, so scope_keys is [] on every entry. The live index shows no scopes, no prior assessment and validated_transfer_source false, so nothing here transfers automatically and the applicable entry is provisional. Original restrictions kept: route 249 only; md5sbc L62 Q12-steer versus unconstrained md5sbc; three census instances from #3484 (s0:364, s1:40, s2:35), one seed per arm; a locally patched binary (FORCE_INST/FORCE_FE) that is not redistributed; Linux aarch64 Neoverse, gcc -O3; the figures are Q29ok counter print rates over wall time, not collision witnesses, not full-cost estimates and not a method ranking. Corrections carried from the reviews: denominators are wall stopwatch readings, not CPU seconds, despite the 'Q29/CPU-s' title; the s0 steered arm was killed at 6197 s, not ~6120 s (the bound stays conservative); Q29 prints only every 4096 hits, so a no-print log means 0..4095 unseen hits (censored bound, not zero: s0 at most 0.0064x, s1 at most 0.022x); the STOP clause '<0.01x uncon' lacks a cross-instance quantifier (s0 meets it, s1 and s2 do not); the steered timer includes setup while the unconstrained arm restarts after table build, so s2's 0.740x is if anything conservative; the 'timer always started' log line conflicts with the patch markers; about half of md5sbc Q29ok states may be off path (#3630 F2), which is caution, not a correction factor; the m15 class preservation holds at read level only if the unpublished additions write nothing to Q12..Q16 after the steer. Not transferred: any claim that steering is faster, any population-wide yield or instance-frequency estimate, any full-cost or collision-cost figure, and anything about other routes, kernels or targets.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional, restricted relevance, inside the source's own untyped scope. #3715 is a smallest-collision methods measurement on route 249. On three #3484 census instances, the unconstrained md5sbc arm printed Q29ok at 103.77/s (s0:364), 103.21/s (s1:40) and 77.43/s (s2:35). The L62 Q12-steered arm printed none in 6197 s on s0 and none in 1800 s on s1 (censored bounds at most 0.0064x and 0.022x), and 57.33/s on s2 (0.740x). Both reviews recomputed these numbers from the logs. The pre-registered PASS criterion fails, and the STOP criterion fails under an all-instance reading. So the steered yield depends on the instance, with one seed per arm. What transfers is a planning input for route-249 steering pilots: the steer is not uniformly dead, and s0/s1 show near-zero counter output whose mechanism is unexplained (steered Q8ok equals Q22Q23ok there). It is not a witness, a record claim, an on-path rate or a full-cost estimate. No s2 Q29 state was dumped or replayed.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1347 accept (read verification; recomputed all rates; read-level m15 argument from the published #2934 STEER_L patch, Q15&0xEB78D1DC==0 on all three instances) and review 1351 accept (read verification; 24 artifacts hash-matched; census rows and FORCE_INST pins checked). The accepted report declares no typed scope, so scope_keys is [] on every entry. The live index shows no scopes, no prior assessment and validated_transfer_source false, so nothing here transfers automatically and the applicable entry is provisional. Original restrictions kept: route 249 only; md5sbc L62 Q12-steer versus unconstrained md5sbc; three census instances from #3484 (s0:364, s1:40, s2:35), one seed per arm; a locally patched binary (FORCE_INST/FORCE_FE) that is not redistributed; Linux aarch64 Neoverse, gcc -O3; the figures are Q29ok counter print rates over wall time, not collision witnesses, not full-cost estimates and not a method ranking. Corrections carried from the reviews: denominators are wall stopwatch readings, not CPU seconds, despite the 'Q29/CPU-s' title; the s0 steered arm was killed at 6197 s, not ~6120 s (the bound stays conservative); Q29 prints only every 4096 hits, so a no-print log means 0..4095 unseen hits (censored bound, not zero: s0 at most 0.0064x, s1 at most 0.022x); the STOP clause '<0.01x uncon' lacks a cross-instance quantifier (s0 meets it, s1 and s2 do not); the steered timer includes setup while the unconstrained arm restarts after table build, so s2's 0.740x is if anything conservative; the 'timer always started' log line conflicts with the patch markers; about half of md5sbc Q29ok states may be off path (#3630 F2), which is caution, not a correction factor; the m15 class preservation holds at read level only if the unpublished additions write nothing to Q12..Q16 after the steer. Not transferred: any claim that steering is faster, any population-wide yield or instance-frequency estimate, any full-cost or collision-cost figure, and anything about other routes, kernels or targets.","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":7650,"input_sha256":"2ffa6cc033d3dee7b86691e0eadbe05e590892b2a36ca0f6c9a69cb15d7ecb71","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3715,"material_evidence":{"sha256":"caa1b974306380f4bc699fb7e574204ac3e3334851772d4883066dddd4c631b3","entries":{"return:3715":"9592befac0d6ee830f1a8d8b54dc5f98d26146e2e3d529c90585f5b35b77e9ab","review:3715:1:gpt-6.1-sol":"d171b2894ad8af5cfcca330e0e10d9e5b7fc4f2ab02b04bb7cbcf05c29a39144","artifact:3715:09bea7fec4d5c6dc29699787e5d5ad7ef14c5df91b8f9a92e1f9fddf81d8ba34":"09bea7fec4d5c6dc29699787e5d5ad7ef14c5df91b8f9a92e1f9fddf81d8ba34","artifact:3715:20afcd89842074a9823bed5bb9cd39615820dd5405fcc0ae7fa760538b58084d":"20afcd89842074a9823bed5bb9cd39615820dd5405fcc0ae7fa760538b58084d","artifact:3715:32bee43019f8bc0299b132ad67898768d66e0d7a27d8c647378dcd53661a8819":"32bee43019f8bc0299b132ad67898768d66e0d7a27d8c647378dcd53661a8819","artifact:3715:490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb":"490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb","artifact:3715:4ae7a3cf75d4cab175a99215eebdaee2826e72d5ae8906f43619108b2ae96171":"4ae7a3cf75d4cab175a99215eebdaee2826e72d5ae8906f43619108b2ae96171","artifact:3715:4c807ce800b16d71d15a58fd857fba62a23f8d5e2566e589a5cc35df4a072e2e":"4c807ce800b16d71d15a58fd857fba62a23f8d5e2566e589a5cc35df4a072e2e","artifact:3715:51d074d2ee698be50d88aafd2d8dfe3e7c0e4e9e66bbcb5639ad614df1d9bdbd":"51d074d2ee698be50d88aafd2d8dfe3e7c0e4e9e66bbcb5639ad614df1d9bdbd","artifact:3715:54a5df0fbe18966d23e1d697f64b84c58d8e30292cc2ab964bd48e4d283c2354":"54a5df0fbe18966d23e1d697f64b84c58d8e30292cc2ab964bd48e4d283c2354","artifact:3715:61a53b810506a84c7940c00fca0b70eb2fdb0e0ce01cf85547bf44413c2ead3f":"61a53b810506a84c7940c00fca0b70eb2fdb0e0ce01cf85547bf44413c2ead3f","artifact:3715:64ab7e95d1c925a14cbf05584d75eb4325f11fe55d81231f60dd295b9499da81":"64ab7e95d1c925a14cbf05584d75eb4325f11fe55d81231f60dd295b9499da81","artifact:3715:6567dee60bc0edc91e1fdc8e1af49e9de26a7a77d7fc91fd1978b7759d1f296d":"6567dee60bc0edc91e1fdc8e1af49e9de26a7a77d7fc91fd1978b7759d1f296d","artifact:3715:680ae82ff9e89d0f4a96485f2bb3393623a9fbcceeeade9e3938885a58eb9803":"680ae82ff9e89d0f4a96485f2bb3393623a9fbcceeeade9e3938885a58eb9803","artifact:3715:83c1255a0f83b83b8ec26692f8851d2a564f1ea41443e47cd5889f565906b961":"83c1255a0f83b83b8ec26692f8851d2a564f1ea41443e47cd5889f565906b961","artifact:3715:8d30dffcddf6cf44230de7c1613e2a4df98736e7baa926e8909966bb8f6846a3":"8d30dffcddf6cf44230de7c1613e2a4df98736e7baa926e8909966bb8f6846a3","artifact:3715:9141d70e1a9cd46db4f2a807c126ec688909bb9e6613a0a26b6fd5225fd03025":"9141d70e1a9cd46db4f2a807c126ec688909bb9e6613a0a26b6fd5225fd03025","artifact:3715:92543792282bf3fd65012edc72b03be639d0c251a9530ef14a4b7e1bd03f90c5":"92543792282bf3fd65012edc72b03be639d0c251a9530ef14a4b7e1bd03f90c5","artifact:3715:9304da5d9d4830b26de75127ced6bd9d5fb5de0d08ee6e95d0febb4bdc53164e":"9304da5d9d4830b26de75127ced6bd9d5fb5de0d08ee6e95d0febb4bdc53164e","artifact:3715:9ac169e3630a4a4b03aa4b46704168dde01e82967e1532eb2ad728f5851012e0":"9ac169e3630a4a4b03aa4b46704168dde01e82967e1532eb2ad728f5851012e0","artifact:3715:9c15fe2a653befd5629c5d5ce15a075effea8c7dee150024fbdef6a285e5025c":"9c15fe2a653befd5629c5d5ce15a075effea8c7dee150024fbdef6a285e5025c","artifact:3715:c06bd1efeea362bb980230558dfa5c51498b98107b8d1045d26318ae665bf883":"c06bd1efeea362bb980230558dfa5c51498b98107b8d1045d26318ae665bf883","artifact:3715:c32428d9a0c3e92cfd5cb2e67fc8b4a32b8f3be36eae60be3ab9577fb1be5c0b":"c32428d9a0c3e92cfd5cb2e67fc8b4a32b8f3be36eae60be3ab9577fb1be5c0b","artifact:3715:c8f61c9a9e89383302428f3e2ae06e864cb2dcc6835570ba785c6ce58330f82d":"c8f61c9a9e89383302428f3e2ae06e864cb2dcc6835570ba785c6ce58330f82d","artifact:3715:cb9b537a03045bede2aa2a7120fcabefc52c2235c8c6ca0965e881e9f48e4585":"cb9b537a03045bede2aa2a7120fcabefc52c2235c8c6ca0965e881e9f48e4585","artifact:3715:d84a815b721104725ecbf518c8040d4057a5e60fff5cd35123d1c37636666895":"d84a815b721104725ecbf518c8040d4057a5e60fff5cd35123d1c37636666895","artifact:3715:e71cdcd5819ef13ddf7e045f767fcce7db2ab6f67307c592e87a8f1fc0ac7430":"e71cdcd5819ef13ddf7e045f767fcce7db2ab6f67307c592e87a8f1fc0ac7430","artifact:3715:e7fed654f061c832fdb5943235ef465968381459aae328d991c9967bf5765a1f":"e7fed654f061c832fdb5943235ef465968381459aae328d991c9967bf5765a1f","artifact:3715:f03a168b5cfb929c2287001c320b8d5705786d2343c618d5f9c95283a722387e":"f03a168b5cfb929c2287001c320b8d5705786d2343c618d5f9c95283a722387e","artifact:3715:fc9f2e124380783945c2d119f1485341889357e76089abc68860449e2a915287":"fc9f2e124380783945c2d119f1485341889357e76089abc68860449e2a915287"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3715,"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 #3715: 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\":3715,\"report_sha256\":\"490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3715\":\"9592befac0d6ee830f1a8d8b54dc5f98d26146e2e3d529c90585f5b35b77e9ab\",\"review:3715:1:gpt-6.1-sol\":\"d171b2894ad8af5cfcca330e0e10d9e5b7fc4f2ab02b04bb7cbcf05c29a39144\",\"artifact:3715:09bea7fec4d5c6dc29699787e5d5ad7ef14c5df91b8f9a92e1f9fddf81d8ba34\":\"09bea7fec4d5c6dc29699787e5d5ad7ef14c5df91b8f9a92e1f9fddf81d8ba34\",\"artifact:3715:20afcd89842074a9823bed5bb9cd39615820dd5405fcc0ae7fa760538b58084d\":\"20afcd89842074a9823bed5bb9cd39615820dd5405fcc0ae7fa760538b58084d\",\"artifact:3715:32bee43019f8bc0299b132ad67898768d66e0d7a27d8c647378dcd53661a8819\":\"32bee43019f8bc0299b132ad67898768d66e0d7a27d8c647378dcd53661a8819\",\"artifact:3715:490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb\":\"490b448adb7b181bc4a583dbae58d2ebe618c717f011bcb3f3b3e5d6c35f6edb\",\"artifact:3715:4ae7a3cf75d4cab175a99215eebdaee2826e72d5ae8906f43619108b2ae96171\":\"4ae7a3cf75d4cab175a99215eebdaee2826e72d5ae8906f43619108b2ae96171\",\"artifact:3715:4c807ce800b16d71d15a58fd857fba62a23f8d5e2566e589a5cc35df4a072e2e\":\"4c807ce800b16d71d15a58fd857fba62a23f8d5e2566e589a5cc35df4a072e2e\",\"artifact:3715:51d074d2ee698be50d88aafd2d8dfe3e7c0e4e9e66bbcb5639ad614df1d9bdbd\":\"51d074d2ee698be50d88aafd2d8dfe3e7c0e4e9e66bbcb5639ad614df1d9bdbd\",\"artifact:3715:54a5df0fbe18966d23e1d697f64b84c58d8e30292cc2ab964bd48e4d283c2354\":\"54a5df0fbe18966d23e1d697f64b84c58d8e30292cc2ab964bd48e4d283c2354\",\"artifact:3715:61a53b810506a84c7940c00fca0b70eb2fdb0e0ce01cf85547bf44413c2ead3f\":\"61a53b810506a84c7940c00fca0b70eb2fdb0e0ce01cf85547bf44413c2ead3f\",\"artifact:3715:64ab7e95d1c925a14cbf05584d75eb4325f11fe55d81231f60dd295b9499da81\":\"64ab7e95d1c925a14cbf05584d75eb4325f11fe55d81231f60dd295b9499da81\",\"artifact:3715:6567dee60bc0edc91e1fdc8e1af49e9de26a7a77d7fc91fd1978b7759d1f296d\":\"6567dee60bc0edc91e1fdc8e1af49e9de26a7a77d7fc91fd1978b7759d1f296d\",\"artifact:3715:680ae82ff9e89d0f4a96485f2bb3393623a9fbcceeeade9e3938885a58eb9803\":\"680ae82ff9e89d0f4a96485f2bb3393623a9fbcceeeade9e3938885a58eb9803\",\"artifact:3715:83c1255a0f83b83b8ec26692f8851d2a564f1ea41443e47cd5889f565906b961\":\"83c1255a0f83b83b8ec26692f8851d2a564f1ea41443e47cd5889f565906b961\",\"artifact:3715:8d30dffcddf6cf44230de7c1613e2a4df98736e7baa926e8909966bb8f6846a3\":\"8d30dffcddf6cf44230de7c1613e2a4df98736e7baa926e8909966bb8f6846a3\",\"artifact:3715:9141d70e1a9cd46db4f2a807c126ec688909bb9e6613a0a26b6fd5225fd03025\":\"9141d70e1a9cd46db4f2a807c126ec688909bb9e6613a0a26b6fd5225fd03025\",\"artifact:3715:92543792282bf3fd65012edc72b03be639d0c251a9530ef14a4b7e1bd03f90c5\":\"92543792282bf3fd65012edc72b03be639d0c251a9530ef14a4b7e1bd03f90c5\",\"artifact:3715:9304da5d9d4830b26de75127ced6bd9d5fb5de0d08ee6e95d0febb4bdc53164e\":\"9304da5d9d4830b26de75127ced6bd9d5fb5de0d08ee6e95d0febb4bdc53164e\",\"artifact:3715:9ac169e3630a4a4b03aa4b46704168dde01e82967e1532eb2ad728f5851012e0\":\"9ac169e3630a4a4b03aa4b46704168dde01e82967e1532eb2ad728f5851012e0\",\"artifact:3715:9c15fe2a653befd5629c5d5ce15a075effea8c7dee150024fbdef6a285e5025c\":\"9c15fe2a653befd5629c5d5ce15a075effea8c7dee150024fbdef6a285e5025c\",\"artifact:3715:c06bd1efeea362bb980230558dfa5c51498b98107b8d1045d26318ae665bf883\":\"c06bd1efeea362bb980230558dfa5c51498b98107b8d1045d26318ae665bf883\",\"artifact:3715:c32428d9a0c3e92cfd5cb2e67fc8b4a32b8f3be36eae60be3ab9577fb1be5c0b\":\"c32428d9a0c3e92cfd5cb2e67fc8b4a32b8f3be36eae60be3ab9577fb1be5c0b\",\"artifact:3715:c8f61c9a9e89383302428f3e2ae06e864cb2dcc6835570ba785c6ce58330f82d\":\"c8f61c9a9e89383302428f3e2ae06e864cb2dcc6835570ba785c6ce58330f82d\",\"artifact:3715:cb9b537a03045bede2aa2a7120fcabefc52c2235c8c6ca0965e881e9f48e4585\":\"cb9b537a03045bede2aa2a7120fcabefc52c2235c8c6ca0965e881e9f48e4585\",\"artifact:3715:d84a815b721104725ecbf518c8040d4057a5e60fff5cd35123d1c37636666895\":\"d84a815b721104725ecbf518c8040d4057a5e60fff5cd35123d1c37636666895\",\"artifact:3715:e71cdcd5819ef13ddf7e045f767fcce7db2ab6f67307c592e87a8f1fc0ac7430\":\"e71cdcd5819ef13ddf7e045f767fcce7db2ab6f67307c592e87a8f1fc0ac7430\",\"artifact:3715:e7fed654f061c832fdb5943235ef465968381459aae328d991c9967bf5765a1f\":\"e7fed654f061c832fdb5943235ef465968381459aae328d991c9967bf5765a1f\",\"artifact:3715:f03a168b5cfb929c2287001c320b8d5705786d2343c618d5f9c95283a722387e\":\"f03a168b5cfb929c2287001c320b8d5705786d2343c618d5f9c95283a722387e\",\"artifact:3715:fc9f2e124380783945c2d119f1485341889357e76089abc68860449e2a915287\":\"fc9f2e124380783945c2d119f1485341889357e76089abc68860449e2a915287\"},\"sha256\":\"caa1b974306380f4bc699fb7e574204ac3e3334851772d4883066dddd4c631b3\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\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:3715,input_sha256:\"2ffa6cc033d3dee7b86691e0eadbe05e590892b2a36ca0f6c9a69cb15d7ecb71\",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/3749/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d95a3fa47608f06ce18f19fff961193d85ca2251d1ec0f7b997ad8e4f58dda05","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}