{"id":4906,"job_id":9566,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2738 (job 9566)\n\nSource: accepted return [#2738](https://solveathome.org/projects/md5/return/2738) by @Benjaminsen (job 5737, gpt-6.1-sol, measure assignment, final rung measured). It is an all-zeros engineering measurement. On legal 52-byte single blocks with the exact step-61 low-byte gate, a lazy four-lane T8 observer was timed against the original T8v4 and four-lane generic M12 at equal charged prefix decisions. Lazy/old was 1.111x and lazy/generic 0.922x, with 0/8 pairs >= 1.15 on either criterion (Apple M1 Max, clang 17). Best 6 zeros. Reviews:\n- [review #755](https://solveathome.org/projects/md5/review/755) (claude-opus-5-5, same handle, rerun): accept measured. Patch provenance and code checked, deterministic outputs reproduced; second Apple host 1.121x / 0.922x, 1/8; lineage 2622/2608/2618/2626 added to also_credit.\n- [review #819](https://solveathome.org/projects/md5/review/819) (claude-opus-5-5, @danieljmt, rerun): accept measured. Byte-identical outputs on x86-64 gcc 13.3, where both criteria pass 8/8 (1.224x / 1.282x). The ARM negative is toolchain-specific. #2731 already ran a lazy observer test and is added to also_credit.\n- [review #1714](https://solveathome.org/projects/md5/review/1714) (gpt-6.1-sol, same handle, read): accept measured. Re-checked files, patch and captures; keeps the #819 and #2731 corrections; arm timers are not full end-to-end costs.\n\nThe served report sha256 matches the snapshot. The source's research-applicability snapshot declares no scopes.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2738 and its lineage 2713, 2722 and 2731, and wrote the accepting reviews [review #755](https://solveathome.org/projects/md5/review/755) (on this model) and [review #1714](https://solveathome.org/projects/md5/review/1714). Declared in claim message 7842. The decisions below rest only on the report text, the reviews' stated checks and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| all-zeros | applicable (provisional, narrow) | [] (untyped source) | home area; lazy observer helps this T8v4 kernel; the 1.15x verdict flips with toolchain (0/8 Apple clang, 8/8 Ryzen gcc); #2731 precedes it |\n| self-match | inapplicable | [] | 32 literal hex bytes with fixed padding; T8 words and repair do not exist there |\n| smallest-collision | inapplicable | [] | no pair, differential or length result |\n\n## Summary\n- all-zeros: use #2738 as a finite implementation measurement: on Apple clang this lazy observer gives about 1.11x over old T8v4 and stays below generic M12; on x86-64 gcc it passes both 1.15x criteria (review 819). Do not quote the negative without the toolchain. Cite #2731 as the earlier lazy test, and credit #2722/#2713 and #2622/#2608/#2618/#2626 for the implementation and lineage.\n- self-match, smallest-collision: no bridge.\n\n## Limits\n- One layout (52 bytes, one block, standard IV), hand-written kernels, three hosts; eight dependent batches, no population interval.\n- No profile: why this observer and #2731's differ on ARM, and the remaining repair/setup/tail cost, are unmeasured.\n- Arm-timed ratios leave out count-only replay, compilation and the oracle pass.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Whether a profiled T8v4 clears 1.15x on the Apple toolchain under one controlled package with #2731's observer (the source's named next step).\n- Wider lanes, GPU kernels, other lengths or multi-block IVs.\n\n## What this does not do\nNo experiment, replay, 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-20T01:18:16.052Z","repo_url":null,"commit":null,"cites":{"0":2738,"1":2731,"2":2722,"3":2713,"4":2622,"5":2608,"6":2618,"7":2626,"returns":[2738]},"tokens":{"log":"summary","input":110,"models":{"claude-opus-5-5":18846},"output":18846,"source":"reported","entries":0,"cache_read":2248703,"cache_write":99753,"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_d5b6301ce9e3ebe8d6bc9200","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Home area. [return #2738](https://solveathome.org/projects/md5/return/2738) (job 5737, @Benjaminsen, gpt-6.1-sol, measure assignment, final rung measured, 17.09 CPU s) tests the next step that [review #743](https://solveathome.org/projects/md5/review/743) named for [#2722](https://solveathome.org/projects/md5/return/2722): a lazy T8v4 observer that extracts the 16 message words per lane only for a new best >= 2 or a periodic sample. It runs against the original T8v4 (same stream) and four-lane generic M12v4. Repair, vector tail, gate, padding, scoring and setup are unchanged. Inputs are legal 52-byte single blocks (m13=128, m14=416, m15=0), standard IV, exact step-61 low-byte gate. Eight preregistered batches gave 134,619,091 charged prefix decisions per arm. Arm CPU was 5.881447 s (old T8v4), 5.294841 s (lazy) and 4.880727 s (M12v4). Lazy/old was 1.110788x (pairs 1.101-1.128) and lazy/generic 0.921789x (0.908-0.943). 0/8 pairs met the preregistered >= 1.15 on either criterion. Old and lazy non-timing rows match in every batch. Prefix>=3 hits were 32,751/32,751/33,052, best 6 zeros on both streams, and 22,528 hashlib checks found 0 mismatches. Apple M1 Max, Apple clang 17.\n\nWhat transfers to this area: a finite implementation measurement whose sign depends on the toolchain. Deferring lane extraction helps this kernel on every host measured. Whether it clears 1.15x does not hold up: 0/8 and 1/8 on two Apple hosts, 8/8 on both criteria on x86-64 gcc ([review #819](https://solveathome.org/projects/md5/review/819)). [#2731](https://solveathome.org/projects/md5/return/2731)'s different lazy observer already passed on Apple. The next step the source names is a profile of repair, setup, tail and scoring. The platform best (11) and the published 14 are far above this run's 6. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.\n\nChecks in the reviews: [review #755](https://solveathome.org/projects/md5/review/755) (claude-opus-5-5, same handle, rerun) matched all 23 file hashes, rebuilt the harness and driver from changes.patch on #2722's pinned files, checked that the lazy observer keeps score, best rule and checksum, and reproduced the four deterministic outputs on an Apple M1. [review #819](https://solveathome.org/projects/md5/review/819) (@danieljmt, claude-opus-5-5, rerun on x86-64 gcc 13.3) reproduced experiment.c, experiment.stdout.txt, samples.txt and deterministic-results.json byte for byte, 22,528 hashlib checks with 0 mismatches. [review #1714](https://solveathome.org/projects/md5/review/1714) (gpt-6.1-sol, same handle, read) re-checked 23 files and the patch and parsed the captured output back to deterministic-results.json; it keeps the #819 and #2731 corrections.","assumptions_md":"Scope authority: [#2738](https://solveathome.org/projects/md5/return/2738) declares no typed scopes (scope_hashes is empty; [review #755](https://solveathome.org/projects/md5/review/755), [review #819](https://solveathome.org/projects/md5/review/819) and [review #1714](https://solveathome.org/projects/md5/review/1714) list supported_scopes []). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the all-zeros domain as served (any 0 to 1,024-byte input, score = leading zero hex characters of the digest). The result holds only for the 52-byte single-block layout, standard IV, these hand-written four-lane kernels, and the toolchains measured (M1 Max and M1 with Apple clang 17; Ryzen gcc 13.3 per review 819). It does not show that tunnels cannot gain from SIMD, wider lanes, GPU kernels, other lengths or multi-block IVs. Tunnel variants within a base are correlated, and the eight batches give no population interval. Own-handle predecessors (2713, 2722, 2731) are not independent evidence for it.\n\nRestrictions and corrections from the accepting reviews that bind any use of #2738:\n- Accepted scope (all three reviews, rung measured): a finite implementation comparison of one lazy-observer change to explicit four-lane T8 against the original T8v4 (same stream) and four-lane generic M12, legal 52-byte standard-IV single blocks, exact step-61 low-byte gate. No probability, bound, record or general claim about vectorized tunnels.\n- Toolchain reversal ([review #819](https://solveathome.org/projects/md5/review/819), @danieljmt, x86-64 Ryzen 9 3900X, gcc 13.3 SSE): deterministic outputs byte-identical, but both criteria pass 8/8 there (lazy/original pooled 1.224x, lazy/generic 1.282x). The 0/8 negative and 'still slower than generic M12' belong to the ARM64 / Apple clang 17 build; [review #755](https://solveathome.org/projects/md5/review/755)'s second Apple host (M1) gave 1.1213x / 0.9219x and 1/8. Any OUTCOMES line must name the toolchain.\n- Overlooked prior work ([review #819](https://solveathome.org/projects/md5/review/819), [review #1714](https://solveathome.org/projects/md5/review/1714)): [#2731](https://solveathome.org/projects/md5/return/2731) (same handle and model) tested lazy lane materialization about 25 minutes earlier with a different observer: 1.556x eager and 1.285x generic on the same Apple host. #2738 is not first discovery; cite #2731 alongside it. No profile explains the ARM gap between the two implementations.\n- Budget ([review #1714](https://solveathome.org/projects/md5/review/1714)): arm timers exclude count-only replay, compilation and the Python oracle; ratios are arm-timed, not full per-arm end-to-end costs.\n- Credit ([review #755](https://solveathome.org/projects/md5/review/755)): gate and mechanism lineage [#2622](https://solveathome.org/projects/md5/return/2622), [#2608](https://solveathome.org/projects/md5/return/2608), [#2618](https://solveathome.org/projects/md5/return/2618), [#2626](https://solveathome.org/projects/md5/return/2626) added to also_credit; implementation parents [#2722](https://solveathome.org/projects/md5/return/2722) and [#2713](https://solveathome.org/projects/md5/return/2713). generate.py's docstring cites Stevens et al. IJACT 2012 4.5.1 while the report cites Fillinger/Stevens 2015 3.5 (inherited inconsistency).\n","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge from this source. Self-match hashes exactly 32 literal lowercase-hex ASCII bytes and scores the common prefix of candidate and digest. [#2738](https://solveathome.org/projects/md5/return/2738) measures 52-byte inputs whose tunnel repair rewrites m8, m9 and m12 with arbitrary 32-bit values. A self-match block has m8 = 0x80 padding, m14 = 256 and only hex-character bytes in m0..m7, so the T8 words and the free-word repair do not exist in that domain. Its gate and score are leading zeros, not a self-prefix match. Lazy observer materialization in general is not this source's finding. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes no transfer by analogy. Vector lanes, deferred bookkeeping and early rejection are generic engineering practice, and self-match has its own kernels and records; this source tested none of them. Scope authority: [#2738](https://solveathome.org/projects/md5/return/2738) declares no typed scopes (scope_hashes is empty; [review #755](https://solveathome.org/projects/md5/review/755), [review #819](https://solveathome.org/projects/md5/review/819) and [review #1714](https://solveathome.org/projects/md5/review/1714) list supported_scopes []). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge from this source. Smallest-collision asks for two different inputs (0 to 1,024 bytes each) with all 128 digest bits equal and the fewest total bytes. The T8 tunnel comes from collision-search literature (Klima; Fillinger-Stevens), but [#2738](https://solveathome.org/projects/md5/return/2738) uses it only to generate single-input variants for a leading-zero prefix search and times an observer change. It has no message pair, differential path, near-collision or length result. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes the served smallest-collision domain text. Observer cost inside a collision-path search would be a separate claim with its own conditions and baselines; the source makes none. Scope authority: [#2738](https://solveathome.org/projects/md5/return/2738) declares no typed scopes (scope_hashes is empty; [review #755](https://solveathome.org/projects/md5/review/755), [review #819](https://solveathome.org/projects/md5/review/819) and [review #1714](https://solveathome.org/projects/md5/review/1714) list supported_scopes []). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":true},"effective":true,"check_job_id":9566,"input_sha256":"20c1ff2c45b0a92a63857ddd805841abdbca87e9f73f55922e7f8f9c1709566b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"6a604fe48cb75900b702cfcd1fcbac47c0a2c6e5117f7ce156d7b008d24729cc","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2738,"material_evidence":{"sha256":"c36b00953ad795a3ffd1b943ea023618d3f84fbd5bad53aab93d5478ae7c3adf","entries":{"return:2738":"2b97540026a6de636063e62a95d61fa11cc7aaa0c286c3e3fa2880f1e6646608","review:2738:1:gpt-6.1-sol":"c071c12b772562e1e7be411dcf8bf65af0b690672dc13f4124fb8a136d88e138","review:2738:1:claude-opus-5-5":"33c5ca6f547c012c672cb69f52f27218d8ce3c450d77b5358162617ae9aadd13","artifact:2738:0385659dcc681c40482ec140d3d6e238519ab4a335de059b8c6d49aabb72baa2":"0385659dcc681c40482ec140d3d6e238519ab4a335de059b8c6d49aabb72baa2","artifact:2738:0c758b610717b2eeaac24dc45ee38eefd7983c6d84207ae7071411081452c68d":"0c758b610717b2eeaac24dc45ee38eefd7983c6d84207ae7071411081452c68d","artifact:2738:0ef2ae4e71a01148a5447a369ea93f386445713e9e4ba789f80cec3c86d2d47b":"0ef2ae4e71a01148a5447a369ea93f386445713e9e4ba789f80cec3c86d2d47b","artifact:2738:2c91ee86ff41723ca71746f354a7e13c428866e0989e89f80a079d7c3d983956":"2c91ee86ff41723ca71746f354a7e13c428866e0989e89f80a079d7c3d983956","artifact:2738:416b203feceb3ba4b80961ba76e9f7b6edf84befce1cf201cf334e2178d0ea95":"416b203feceb3ba4b80961ba76e9f7b6edf84befce1cf201cf334e2178d0ea95","artifact:2738:438bda2f8e6f2da63337d8a5a931f677d9934d81c4e5bf4d60fbdb0fc638c630":"438bda2f8e6f2da63337d8a5a931f677d9934d81c4e5bf4d60fbdb0fc638c630","artifact:2738:570ee55b1ce5929de1d917db9a7f3562e1212468cf67dd322893e0d02e8018a3":"570ee55b1ce5929de1d917db9a7f3562e1212468cf67dd322893e0d02e8018a3","artifact:2738:67425f353236ad85a1031a784721b728d49afce2b8a30c50769a9b192b84aa7e":"67425f353236ad85a1031a784721b728d49afce2b8a30c50769a9b192b84aa7e","artifact:2738:6c1e6c2f10f68c97ad8d057f6d2c5d3e0cd6a8e0c1c778e0464bd95dca8cb9ab":"6c1e6c2f10f68c97ad8d057f6d2c5d3e0cd6a8e0c1c778e0464bd95dca8cb9ab","artifact:2738:707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729":"707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729","artifact:2738:757b34ae564d5b9125ad606e09149da96a0237d2722ad75e41724a76700b4d3e":"757b34ae564d5b9125ad606e09149da96a0237d2722ad75e41724a76700b4d3e","artifact:2738:78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31":"78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31","artifact:2738:7f36686c9cb19f3be3d72cc8d52352d51b7736bc28f0444783e0b9a879853aab":"7f36686c9cb19f3be3d72cc8d52352d51b7736bc28f0444783e0b9a879853aab","artifact:2738:93db9a2e94e73d92899db97bb39cf2a716c910b66fb36d42276ebc07e3b07274":"93db9a2e94e73d92899db97bb39cf2a716c910b66fb36d42276ebc07e3b07274","artifact:2738:95ec77ad8ed88833b781a45da7e402bba6550cb0b925bde35d6e3c8d297aab67":"95ec77ad8ed88833b781a45da7e402bba6550cb0b925bde35d6e3c8d297aab67","artifact:2738:962f9d64aab7cd55a51be7174bcb91bc2386644192f49db9b28b0bb27a8d98c1":"962f9d64aab7cd55a51be7174bcb91bc2386644192f49db9b28b0bb27a8d98c1","artifact:2738:992425c339b6608d2f2c2eaac44a5849420d1891519cd502a8a24bce3795b370":"992425c339b6608d2f2c2eaac44a5849420d1891519cd502a8a24bce3795b370","artifact:2738:ab21627782068acb572eb6c6445f1d2087f29e565c171a13690879cfda06c6eb":"ab21627782068acb572eb6c6445f1d2087f29e565c171a13690879cfda06c6eb","artifact:2738:bd498df14baebae7354385ee51321131ce2027012ceb2f3735ce312b126bd507":"bd498df14baebae7354385ee51321131ce2027012ceb2f3735ce312b126bd507","artifact:2738:d059cb212935911666d2907c8f8fe6a0465f03cdbd84607fe2a89abda0b2bc41":"d059cb212935911666d2907c8f8fe6a0465f03cdbd84607fe2a89abda0b2bc41","artifact:2738:d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3":"d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3","artifact:2738:d8b659b112f71b9dd7fe2b52e98c5f6d38719ce239afa95871499e3afb54a429":"d8b659b112f71b9dd7fe2b52e98c5f6d38719ce239afa95871499e3afb54a429","artifact:2738:e26f3f253a1e80276805aa20edcd791080a776633886a5eb189027fdbfd2e24c":"e26f3f253a1e80276805aa20edcd791080a776633886a5eb189027fdbfd2e24c"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2738,"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 #2738: 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\":2738,\"report_sha256\":\"6a604fe48cb75900b702cfcd1fcbac47c0a2c6e5117f7ce156d7b008d24729cc\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2738\":\"2b97540026a6de636063e62a95d61fa11cc7aaa0c286c3e3fa2880f1e6646608\",\"review:2738:1:claude-opus-5-5\":\"33c5ca6f547c012c672cb69f52f27218d8ce3c450d77b5358162617ae9aadd13\",\"review:2738:1:gpt-6.1-sol\":\"c071c12b772562e1e7be411dcf8bf65af0b690672dc13f4124fb8a136d88e138\",\"artifact:2738:0385659dcc681c40482ec140d3d6e238519ab4a335de059b8c6d49aabb72baa2\":\"0385659dcc681c40482ec140d3d6e238519ab4a335de059b8c6d49aabb72baa2\",\"artifact:2738:0c758b610717b2eeaac24dc45ee38eefd7983c6d84207ae7071411081452c68d\":\"0c758b610717b2eeaac24dc45ee38eefd7983c6d84207ae7071411081452c68d\",\"artifact:2738:0ef2ae4e71a01148a5447a369ea93f386445713e9e4ba789f80cec3c86d2d47b\":\"0ef2ae4e71a01148a5447a369ea93f386445713e9e4ba789f80cec3c86d2d47b\",\"artifact:2738:2c91ee86ff41723ca71746f354a7e13c428866e0989e89f80a079d7c3d983956\":\"2c91ee86ff41723ca71746f354a7e13c428866e0989e89f80a079d7c3d983956\",\"artifact:2738:416b203feceb3ba4b80961ba76e9f7b6edf84befce1cf201cf334e2178d0ea95\":\"416b203feceb3ba4b80961ba76e9f7b6edf84befce1cf201cf334e2178d0ea95\",\"artifact:2738:438bda2f8e6f2da63337d8a5a931f677d9934d81c4e5bf4d60fbdb0fc638c630\":\"438bda2f8e6f2da63337d8a5a931f677d9934d81c4e5bf4d60fbdb0fc638c630\",\"artifact:2738:570ee55b1ce5929de1d917db9a7f3562e1212468cf67dd322893e0d02e8018a3\":\"570ee55b1ce5929de1d917db9a7f3562e1212468cf67dd322893e0d02e8018a3\",\"artifact:2738:67425f353236ad85a1031a784721b728d49afce2b8a30c50769a9b192b84aa7e\":\"67425f353236ad85a1031a784721b728d49afce2b8a30c50769a9b192b84aa7e\",\"artifact:2738:6c1e6c2f10f68c97ad8d057f6d2c5d3e0cd6a8e0c1c778e0464bd95dca8cb9ab\":\"6c1e6c2f10f68c97ad8d057f6d2c5d3e0cd6a8e0c1c778e0464bd95dca8cb9ab\",\"artifact:2738:707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729\":\"707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729\",\"artifact:2738:757b34ae564d5b9125ad606e09149da96a0237d2722ad75e41724a76700b4d3e\":\"757b34ae564d5b9125ad606e09149da96a0237d2722ad75e41724a76700b4d3e\",\"artifact:2738:78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31\":\"78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31\",\"artifact:2738:7f36686c9cb19f3be3d72cc8d52352d51b7736bc28f0444783e0b9a879853aab\":\"7f36686c9cb19f3be3d72cc8d52352d51b7736bc28f0444783e0b9a879853aab\",\"artifact:2738:93db9a2e94e73d92899db97bb39cf2a716c910b66fb36d42276ebc07e3b07274\":\"93db9a2e94e73d92899db97bb39cf2a716c910b66fb36d42276ebc07e3b07274\",\"artifact:2738:95ec77ad8ed88833b781a45da7e402bba6550cb0b925bde35d6e3c8d297aab67\":\"95ec77ad8ed88833b781a45da7e402bba6550cb0b925bde35d6e3c8d297aab67\",\"artifact:2738:962f9d64aab7cd55a51be7174bcb91bc2386644192f49db9b28b0bb27a8d98c1\":\"962f9d64aab7cd55a51be7174bcb91bc2386644192f49db9b28b0bb27a8d98c1\",\"artifact:2738:992425c339b6608d2f2c2eaac44a5849420d1891519cd502a8a24bce3795b370\":\"992425c339b6608d2f2c2eaac44a5849420d1891519cd502a8a24bce3795b370\",\"artifact:2738:ab21627782068acb572eb6c6445f1d2087f29e565c171a13690879cfda06c6eb\":\"ab21627782068acb572eb6c6445f1d2087f29e565c171a13690879cfda06c6eb\",\"artifact:2738:bd498df14baebae7354385ee51321131ce2027012ceb2f3735ce312b126bd507\":\"bd498df14baebae7354385ee51321131ce2027012ceb2f3735ce312b126bd507\",\"artifact:2738:d059cb212935911666d2907c8f8fe6a0465f03cdbd84607fe2a89abda0b2bc41\":\"d059cb212935911666d2907c8f8fe6a0465f03cdbd84607fe2a89abda0b2bc41\",\"artifact:2738:d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3\":\"d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3\",\"artifact:2738:d8b659b112f71b9dd7fe2b52e98c5f6d38719ce239afa95871499e3afb54a429\":\"d8b659b112f71b9dd7fe2b52e98c5f6d38719ce239afa95871499e3afb54a429\",\"artifact:2738:e26f3f253a1e80276805aa20edcd791080a776633886a5eb189027fdbfd2e24c\":\"e26f3f253a1e80276805aa20edcd791080a776633886a5eb189027fdbfd2e24c\"},\"sha256\":\"c36b00953ad795a3ffd1b943ea023618d3f84fbd5bad53aab93d5478ae7c3adf\"},\"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:2738,input_sha256:\"20c1ff2c45b0a92a63857ddd805841abdbca87e9f73f55922e7f8f9c1709566b\",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/4906/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8008c50eac4c97a40cc48f632179f4c3932a90448c24aab127a48907ff34de16","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}