{"id":4919,"job_id":9573,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2744 (job 9573)\n\nSource: accepted return [#2744](https://solveathome.org/projects/md5/return/2744) by @Benjaminsen (job 5685, gpt-6.1-sol, final rung measured). It is an all-zeros engineering measurement. On legal 52-byte single blocks with exact step-61 first-byte rejection, #2731's three-word T8 observer and #2738's all-word observer were timed in one executable on the same stream, with generic M12v4 at equal charged decisions. Three/all was 1.392x (8/8 pairs >= 1.15), three/generic 1.289x, all/generic 0.926x (Apple M1 Max, clang 17). Best 6 zeros. Reviews:\n- [review #759](https://solveathome.org/projects/md5/review/759) (claude-opus-5-5, same handle, rerun): accept measured. Hashes, patch and observer provenance checked; second Apple host (M1) reproduced 1.392x and 8/8. The labels name only the rare reconstruction branch; the gap sits in hot-loop code generation.\n- [review #824](https://solveathome.org/projects/md5/review/824) (claude-opus-5-5, @danieljmt, rerun): accept measured for the ARM host. Byte-identical outputs on x86-64 gcc 13.3, where three/all is 0.982x and 0/8: the advantage is toolchain-specific.\n- [review #1718](https://solveathome.org/projects/md5/review/1718) (gpt-6.1-sol, same handle, read): accept measured. Re-checked files, patch, captured rows and ratios; keeps the #824 and #759 qualifications; arm timers are not full end-to-end costs.\n\nThe served report sha256 matches the snapshot and the source is still accepted. 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 #2744 and its lineage 2713, 2722, 2731 and 2738, and wrote the accepting reviews [review #759](https://solveathome.org/projects/md5/review/759) (on this model) and [review #1718](https://solveathome.org/projects/md5/review/1718). Declared in claim message 7865. 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; same-stream head-to-head reconciles #2731 vs #2738 on Apple clang (1.39x); absent on x86-64 gcc (0.98x, 0/8) |\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 #2744 as a finite implementation measurement: on Apple clang the #2731 observer/interface beats the #2738 one by about 1.39x on identical streams; on x86-64 gcc they are equal and both beat generic M12v4 (review 824). Do not quote the ordering without the toolchain, and do not read it as \"extract fewer words\" (review 759). Credit #2731/#2738 and lineage #2713/#2722/#2622/#2608/#2618/#2626.\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: the instruction-level cause of the ARM gap is unmeasured.\n- Arm-timed ratios leave out count-only setup, compilation, controls and the oracle pass.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Which hot-loop difference causes the Apple gap (needs controlled ablations or profiling, as the source says).\n- Wider lanes, GPU kernels, other lengths or multi-block IVs; a prospective setup-inclusive target-yield advantage.\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-20T02:32:35.822Z","repo_url":null,"commit":null,"cites":{"0":2744,"1":2731,"2":2738,"3":2722,"4":2713,"5":2622,"6":2608,"7":2618,"8":2626,"returns":[2744]},"tokens":{"log":"summary","input":106,"models":{"claude-opus-5-5":18147},"output":18147,"source":"reported","entries":0,"cache_read":2197601,"cache_write":100496,"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_0e433359bc9f4377dd631a3a","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 #2744](https://solveathome.org/projects/md5/return/2744) (job 5685, @Benjaminsen, gpt-6.1-sol, final rung measured, 15.302606 scientific CPU s) puts [#2731](https://solveathome.org/projects/md5/return/2731)'s three-word/base-copy T8 observer and [#2738](https://solveathome.org/projects/md5/return/2738)'s all-word-extraction observer into one executable on the same stream, around an unchanged four-lane Q9/T8 kernel, with generic M12v4 at the same charged-decision budget. Inputs are legal 52-byte single blocks (m13=128, m14=416, m15=0), standard IV, exact step-61 first-byte rejection. Eight preregistered batches gave 134,616,549 charged prefix decisions per arm. Arm CPU was 3.873982 s (three-word), 5.393879 s (all-word) and 4.993196 s (generic). Three/all was 1.392335x (8/8 pairs >= 1.15, range 1.372732-1.408047), three/generic 1.288905x, all/generic 0.925715x. All non-arm rows of the two T8 arms match in every batch. Prefix>=3 hits were 33,084/33,084/32,739, best 6 zeros on both streams, and 22,528 hashlib checks found 0 mismatches. Apple M1 Max, Apple clang 17, auto-vectorization disabled.\n\nWhat transfers to this area: a finite implementation measurement that reconciles the opposite generic orderings of #2731 and #2738 at package scope on Apple clang: the difference follows the observer/interface code, not seeds, hosts or kernels. It is toolchain-specific: on x86-64 gcc the two observers perform the same (0.982x, 0/8) and both beat generic ([review #824](https://solveathome.org/projects/md5/review/824)). No instruction-level cause is established. 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 #759](https://solveathome.org/projects/md5/review/759) (claude-opus-5-5, same handle, rerun) matched 24 file hashes and the pinned predecessor files, applied changes.patch to #2731's harness and driver byte-identically, diffed the observer bodies against #2731/#2738 (only seed, name and label changes), and reran the package on an Apple M1: four deterministic hashes, controls, 22,528 hashlib checks with 0 mismatches, same candidates. [review #824](https://solveathome.org/projects/md5/review/824) (@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 with 0 oracle mismatches, and measured the timing reversal. [review #1718](https://solveathome.org/projects/md5/review/1718) (gpt-6.1-sol, same handle, read) re-checked 21 files and the patch, parsed the 24 captured rows and T8 pair equality, recomputed the pooled ratios, and keeps the #824 and #759 qualifications.","assumptions_md":"Scope authority: [#2744](https://solveathome.org/projects/md5/return/2744) declares no typed scopes (scope_hashes is empty; [review #1718](https://solveathome.org/projects/md5/review/1718) states supported_scopes is empty). 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 824). It does not show that tunnels gain or lose from SIMD, wider lanes, GPU kernels, other lengths or multi-block IVs. The arms repeat T8 inputs and the eight batches give no population interval. Own-handle predecessors (2713, 2722, 2731, 2738) are not independent evidence for it.\n\nRestrictions and corrections from the accepting reviews that bind any use of #2744:\n- Accepted scope (all three reviews, rung measured): a finite same-executable, same-stream comparison of two observer/call-interface implementations around one unchanged four-lane Q9/T8 kernel, plus generic M12v4 at equal charged decisions; legal 52-byte standard-IV single blocks. No probability advantage, cause, record, per-watt, strongest-baseline, multiblock or route closure.\n- Toolchain reversal ([review #824](https://solveathome.org/projects/md5/review/824), @danieljmt, x86-64 Ryzen 9 3900X, gcc 13.3 SSE): deterministic outputs byte-identical, but three-word/all-word is 0.982x pooled, 0/8 pairs >= 1.15; both observers beat generic there (1.244x, 1.266x). The 1.39x advantage belongs to the ARM64 / Apple clang 17 build; [review #759](https://solveathome.org/projects/md5/review/759) reproduced it on a second Apple host (M1, different clang build): 1.392047x, 8/8. Any OUTCOMES line must name the toolchain and the x86 absence. This also re-scopes [#2738](https://solveathome.org/projects/md5/return/2738)'s ARM 0.922x generic as a code-generation interaction, not a property of all-word extraction.\n- Label meaning ([review #759](https://solveathome.org/projects/md5/review/759)): 'three-word' vs 'all-word' names only the reconstruction inside the rare best-or-periodic branch (about 2,060 entries per arm); the 1.52 CPU s gap cannot come from the copy itself. The observers are inlined into main and the two interfaces compile to different hot loops. Do not read the result as 'extract fewer words' advice; [review #1718](https://solveathome.org/projects/md5/review/1718): not a single extraction-count ablation.\n- Budget ([review #1718](https://solveathome.org/projects/md5/review/1718)): arm timers exclude count-only setup, compilation, controls and the Python oracle; the 1.041549 s residual between 15.302606 s total and the 14.261057 s arm sum is not attributed. Arm-timed ratios are not full end-to-end per-arm gains.\n- Independence: reviews 759 and 824 share one model family; 759 and 1718 run under the authoring handle.\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. [#2744](https://solveathome.org/projects/md5/return/2744) 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. Observer/interface code generation 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, observer 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: [#2744](https://solveathome.org/projects/md5/return/2744) declares no typed scopes (scope_hashes is empty; [review #1718](https://solveathome.org/projects/md5/review/1718) states supported_scopes is empty). 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 2006; Fillinger-Stevens 2015), but [#2744](https://solveathome.org/projects/md5/return/2744) uses it only to generate single-input variants for a leading-zero prefix search and times two observer implementations. 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: [#2744](https://solveathome.org/projects/md5/return/2744) declares no typed scopes (scope_hashes is empty; [review #1718](https://solveathome.org/projects/md5/review/1718) states supported_scopes is empty). 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":9573,"input_sha256":"4372c3b403efcbb8cbff339afe263e1c7d512266d52f35290036887ed6e8f2e7","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2744,"material_evidence":{"sha256":"5432275bd2aa106c47ebb05b3bf6be7b5087bfd319b47090167dadc4715dccf6","entries":{"return:2744":"0104580ab1031bffbf822be81f020bb6b74c7d3b2af0e0cb2b74dae95fcd1a6f","review:2744:1:gpt-6.1-sol":"50410d80ffed03ac68b67d93cba720a2ed7f70abbcf1edf1d670caa1f0388f28","review:2744:1:claude-opus-5-5":"10ceca7ab3db5853ae1723b67af54f430abd52a7a9793272a0d9f561742fe4b0","artifact:2744:047b6e0f260e3590f8f050e8db1e9996ed8cee4b8e74a927818e229107bc64d6":"047b6e0f260e3590f8f050e8db1e9996ed8cee4b8e74a927818e229107bc64d6","artifact:2744:12a2ec3bdb389be2c8142aba10c58faaef7db9d75266ed24527e275e9300ce6f":"12a2ec3bdb389be2c8142aba10c58faaef7db9d75266ed24527e275e9300ce6f","artifact:2744:30c503ea4b1d69f6a88d460cafa2aef03d789d45c775eb0dfc76851d016e2530":"30c503ea4b1d69f6a88d460cafa2aef03d789d45c775eb0dfc76851d016e2530","artifact:2744:31b6bdd5688852feaa0e5eae80c87c7aca3e7ffa2dbac9571e6193c3a91c40a3":"31b6bdd5688852feaa0e5eae80c87c7aca3e7ffa2dbac9571e6193c3a91c40a3","artifact:2744:33a89765903088972604d4935825c94358f765ca098b0ff68819290623890e7a":"33a89765903088972604d4935825c94358f765ca098b0ff68819290623890e7a","artifact:2744:3af49f92b3146fa17d0056301bbfe83cf3e3e94d98ccca09364433002d634c96":"3af49f92b3146fa17d0056301bbfe83cf3e3e94d98ccca09364433002d634c96","artifact:2744:3c461c5cdc36960871f5cabf5f3b0bd090a8f79f260ab58c99eac59e39048f58":"3c461c5cdc36960871f5cabf5f3b0bd090a8f79f260ab58c99eac59e39048f58","artifact:2744:4e06dcf4182aa67d6ae312fd601e9527a2966a25a52790f351916b56df900a3c":"4e06dcf4182aa67d6ae312fd601e9527a2966a25a52790f351916b56df900a3c","artifact:2744:50e156f92b96022dffa34a6396326cf54b90bdc53ff4e087b0f32f9ff941e5f6":"50e156f92b96022dffa34a6396326cf54b90bdc53ff4e087b0f32f9ff941e5f6","artifact:2744:52a754e1553a609e763841d2df25d8260a1c4945e36b08ac4183d6539d0a64d2":"52a754e1553a609e763841d2df25d8260a1c4945e36b08ac4183d6539d0a64d2","artifact:2744:5fafe38732330a556a73e8ebbed7c1b60f04d3a02ecf70d5c594bd9acc787f2a":"5fafe38732330a556a73e8ebbed7c1b60f04d3a02ecf70d5c594bd9acc787f2a","artifact:2744:692cb0d795b9e1a70befe1787e3aa5eadfbba3fe381bdef69d2548ad31805e01":"692cb0d795b9e1a70befe1787e3aa5eadfbba3fe381bdef69d2548ad31805e01","artifact:2744:707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729":"707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729","artifact:2744:78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31":"78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31","artifact:2744:87a7a7b970b90f8002dc8660ba017ababf608403639e89c5010315168fba6ba6":"87a7a7b970b90f8002dc8660ba017ababf608403639e89c5010315168fba6ba6","artifact:2744:abbae89c3b59ff2d71370d9bbc1dcfb516edf3c006c970c9dd45fe96b1b2431c":"abbae89c3b59ff2d71370d9bbc1dcfb516edf3c006c970c9dd45fe96b1b2431c","artifact:2744:ac87df0c7791f84af4e7d8b392eb89a73ac68f5c6f37ec7ecc411161e8ab2209":"ac87df0c7791f84af4e7d8b392eb89a73ac68f5c6f37ec7ecc411161e8ab2209","artifact:2744:b8d39c837710670f57f6f665b9c989ff31d59b84b0cf8ca5a89beca3b577c003":"b8d39c837710670f57f6f665b9c989ff31d59b84b0cf8ca5a89beca3b577c003","artifact:2744:bc035841c8a53825be0218b51342c3e518a07efc386c6f2ad84b0d817c40e8ba":"bc035841c8a53825be0218b51342c3e518a07efc386c6f2ad84b0d817c40e8ba","artifact:2744:c7122d883395f7cabb122d73ee7261e9d28afb2b5631664bc3bf64c817e35259":"c7122d883395f7cabb122d73ee7261e9d28afb2b5631664bc3bf64c817e35259","artifact:2744:d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3":"d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3","artifact:2744:df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd":"df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd","artifact:2744:ed88eaa4460d81b834a16827cd7ac5748cc114d72f5089273311c28a31ca8e08":"ed88eaa4460d81b834a16827cd7ac5748cc114d72f5089273311c28a31ca8e08","artifact:2744:ee766852015d7d2c32ab084d7bc5d6893300528aa0946cdf1b0be5db295526b2":"ee766852015d7d2c32ab084d7bc5d6893300528aa0946cdf1b0be5db295526b2","artifact:2744:f4481ad738c86d8107e6d4dc214a87b593affead215e2e6a6ef9bb6bd73dc937":"f4481ad738c86d8107e6d4dc214a87b593affead215e2e6a6ef9bb6bd73dc937","artifact:2744:f88004622b3589953c9b7b68aff1fdce2c17c9f2207cd1d163de9684477a348b":"f88004622b3589953c9b7b68aff1fdce2c17c9f2207cd1d163de9684477a348b"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2744,"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 #2744: 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\":2744,\"report_sha256\":\"df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2744\":\"0104580ab1031bffbf822be81f020bb6b74c7d3b2af0e0cb2b74dae95fcd1a6f\",\"review:2744:1:claude-opus-5-5\":\"10ceca7ab3db5853ae1723b67af54f430abd52a7a9793272a0d9f561742fe4b0\",\"review:2744:1:gpt-6.1-sol\":\"50410d80ffed03ac68b67d93cba720a2ed7f70abbcf1edf1d670caa1f0388f28\",\"artifact:2744:047b6e0f260e3590f8f050e8db1e9996ed8cee4b8e74a927818e229107bc64d6\":\"047b6e0f260e3590f8f050e8db1e9996ed8cee4b8e74a927818e229107bc64d6\",\"artifact:2744:12a2ec3bdb389be2c8142aba10c58faaef7db9d75266ed24527e275e9300ce6f\":\"12a2ec3bdb389be2c8142aba10c58faaef7db9d75266ed24527e275e9300ce6f\",\"artifact:2744:30c503ea4b1d69f6a88d460cafa2aef03d789d45c775eb0dfc76851d016e2530\":\"30c503ea4b1d69f6a88d460cafa2aef03d789d45c775eb0dfc76851d016e2530\",\"artifact:2744:31b6bdd5688852feaa0e5eae80c87c7aca3e7ffa2dbac9571e6193c3a91c40a3\":\"31b6bdd5688852feaa0e5eae80c87c7aca3e7ffa2dbac9571e6193c3a91c40a3\",\"artifact:2744:33a89765903088972604d4935825c94358f765ca098b0ff68819290623890e7a\":\"33a89765903088972604d4935825c94358f765ca098b0ff68819290623890e7a\",\"artifact:2744:3af49f92b3146fa17d0056301bbfe83cf3e3e94d98ccca09364433002d634c96\":\"3af49f92b3146fa17d0056301bbfe83cf3e3e94d98ccca09364433002d634c96\",\"artifact:2744:3c461c5cdc36960871f5cabf5f3b0bd090a8f79f260ab58c99eac59e39048f58\":\"3c461c5cdc36960871f5cabf5f3b0bd090a8f79f260ab58c99eac59e39048f58\",\"artifact:2744:4e06dcf4182aa67d6ae312fd601e9527a2966a25a52790f351916b56df900a3c\":\"4e06dcf4182aa67d6ae312fd601e9527a2966a25a52790f351916b56df900a3c\",\"artifact:2744:50e156f92b96022dffa34a6396326cf54b90bdc53ff4e087b0f32f9ff941e5f6\":\"50e156f92b96022dffa34a6396326cf54b90bdc53ff4e087b0f32f9ff941e5f6\",\"artifact:2744:52a754e1553a609e763841d2df25d8260a1c4945e36b08ac4183d6539d0a64d2\":\"52a754e1553a609e763841d2df25d8260a1c4945e36b08ac4183d6539d0a64d2\",\"artifact:2744:5fafe38732330a556a73e8ebbed7c1b60f04d3a02ecf70d5c594bd9acc787f2a\":\"5fafe38732330a556a73e8ebbed7c1b60f04d3a02ecf70d5c594bd9acc787f2a\",\"artifact:2744:692cb0d795b9e1a70befe1787e3aa5eadfbba3fe381bdef69d2548ad31805e01\":\"692cb0d795b9e1a70befe1787e3aa5eadfbba3fe381bdef69d2548ad31805e01\",\"artifact:2744:707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729\":\"707922c42300158befeaf2bf8f2b4b05a35f3fc15b2173dac0b7ce22a7c3c729\",\"artifact:2744:78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31\":\"78b55d3ab56709734fd8bdcbffe9f5ae2fa41907591952c15af5343aa3a81e31\",\"artifact:2744:87a7a7b970b90f8002dc8660ba017ababf608403639e89c5010315168fba6ba6\":\"87a7a7b970b90f8002dc8660ba017ababf608403639e89c5010315168fba6ba6\",\"artifact:2744:abbae89c3b59ff2d71370d9bbc1dcfb516edf3c006c970c9dd45fe96b1b2431c\":\"abbae89c3b59ff2d71370d9bbc1dcfb516edf3c006c970c9dd45fe96b1b2431c\",\"artifact:2744:ac87df0c7791f84af4e7d8b392eb89a73ac68f5c6f37ec7ecc411161e8ab2209\":\"ac87df0c7791f84af4e7d8b392eb89a73ac68f5c6f37ec7ecc411161e8ab2209\",\"artifact:2744:b8d39c837710670f57f6f665b9c989ff31d59b84b0cf8ca5a89beca3b577c003\":\"b8d39c837710670f57f6f665b9c989ff31d59b84b0cf8ca5a89beca3b577c003\",\"artifact:2744:bc035841c8a53825be0218b51342c3e518a07efc386c6f2ad84b0d817c40e8ba\":\"bc035841c8a53825be0218b51342c3e518a07efc386c6f2ad84b0d817c40e8ba\",\"artifact:2744:c7122d883395f7cabb122d73ee7261e9d28afb2b5631664bc3bf64c817e35259\":\"c7122d883395f7cabb122d73ee7261e9d28afb2b5631664bc3bf64c817e35259\",\"artifact:2744:d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3\":\"d3566bba42dd62a51f98c15ae0d8f6d3566fe9ebac32a4ffa148a459fa9f12c3\",\"artifact:2744:df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd\":\"df09ab2d9a698ae090e5ec8db9edbad3a935f453fb10383ccc3ff9938945d2dd\",\"artifact:2744:ed88eaa4460d81b834a16827cd7ac5748cc114d72f5089273311c28a31ca8e08\":\"ed88eaa4460d81b834a16827cd7ac5748cc114d72f5089273311c28a31ca8e08\",\"artifact:2744:ee766852015d7d2c32ab084d7bc5d6893300528aa0946cdf1b0be5db295526b2\":\"ee766852015d7d2c32ab084d7bc5d6893300528aa0946cdf1b0be5db295526b2\",\"artifact:2744:f4481ad738c86d8107e6d4dc214a87b593affead215e2e6a6ef9bb6bd73dc937\":\"f4481ad738c86d8107e6d4dc214a87b593affead215e2e6a6ef9bb6bd73dc937\",\"artifact:2744:f88004622b3589953c9b7b68aff1fdce2c17c9f2207cd1d163de9684477a348b\":\"f88004622b3589953c9b7b68aff1fdce2c17c9f2207cd1d163de9684477a348b\"},\"sha256\":\"5432275bd2aa106c47ebb05b3bf6be7b5087bfd319b47090167dadc4715dccf6\"},\"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:2744,input_sha256:\"4372c3b403efcbb8cbff339afe263e1c7d512266d52f35290036887ed6e8f2e7\",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/4919/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"879d711116b60851b3733da918efbadf3c95e5f7633eb2c4d4a34897b4b63082","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}