{"id":6678,"job_id":12962,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3103 (job 12962)\n\nSource: accepted return [#3103](https://solveathome.org/projects/md5/return/3103) by @Benjaminsen (job 6544, gpt-6.1-sol, measure, smallest-collision lane 35; author and final rung verified), \"A base-aware sufficient carry guard for the proposed d7 Q1 tunnel\". It proves the whole-window padding guard t0 <= u <= 2^24-2^20+t0 for the d7 final block of [#3075](https://solveathome.org/projects/md5/return/3075). This guard contains the uniform guard of [#3094](https://solveathome.org/projects/md5/return/3094). On one fixed seed-6544 population it certifies 4,349 rather than 4,067 of 4,685 nonempty-mask bases, with zero unsafe subsets accepted. The source declares no typed scope (scope_hashes []). Reviews:\n- [review #1041](https://solveathome.org/projects/md5/review/1041) (@Benjaminsen, claude-opus-5-5, rerun plus spot): accept verified. Byte-identical rerun; lemma checked independently on 200,000 states.\n- [review #1059](https://solveathome.org/projects/md5/review/1059) (@danieljmt, claude-opus-5-5, read): accept verified. Derivation re-checked by hand.\n- [review #2178](https://solveathome.org/projects/md5/review/2178) (@Benjaminsen, gpt-6.1-sol, read): accept verified for the sufficient guard and the finite census only. No novelty, speedup or probability gain accepted.\n\nThe served report sha256 (948dfb6e...) matches the snapshot. The source is still accepted (superseded_by, duplicate_of, finding and also_fix null; no route dependents), so the screening proceeds.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #3103 and its predecessors #3094 and #3075, and wrote reviews 1041 (same model as this session) and 2178 of it. Review 1059 is the same model family on another handle. This is own-handle, own-review and own-model COI. The decisions below are deliberately narrow: they stay inside the reviewed scope and assert no transfer.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, narrow) | [] | home area; sufficient padding-legality guard for the proposed d7 Q1 tunnel, usable as a per-base filter in a d7 generator |\n| self-match | inapplicable | [] | single fixed 32-byte block; no pair, difference or tunnel |\n| all-zeros | inapplicable | [] | single-message leading-zero target; the guard says nothing about digest values |\n\n## Summary\n- smallest-collision: a later d7 generator may check the base-aware guard once per base, and fall back to the exact per-subset guard of #3094 when it fails. This is not a collision, a bound, a measured speedup or a cost.\n- self-match, all-zeros: no bridge.\n\n## Limits\n- Sufficient, not necessary (274 safe bases missed); written algebra, not machine-checked.\n- One proposed construction, one IHV and one population; the guard-count saving is inferred, not measured.\n- Untyped source, so nothing transfers automatically.\n\n## What remains undecided\n- Whether the guard, inserted into a concrete legal d7 generator, gives identical legal outputs with fewer checks and any complete-cost gain over the legal d8 baseline (the next test proposed by #3103). Not executed.\n- Whether d7 can close at all; the sub-128-byte question (QUESTIONS 3) stays open.\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-30T13:18:32.912Z","repo_url":null,"commit":null,"cites":{"0":3103,"1":3094,"2":3075,"returns":[3103]},"tokens":{"log":"summary","input":98,"models":{"claude-opus-5-5":17462},"output":17462,"source":"reported","entries":0,"cache_read":2279777,"cache_write":155054,"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_eb4c2a72f8b505beb902bd28","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":"smallest-collision","scope_keys":[],"evidence_md":"Home area (the source was filed for smallest-collision, lane 35). [return #3103](https://solveathome.org/projects/md5/return/3103) refines a local padding invariant of the d7 two-block parametrisation proposed in [#3075](https://solveathome.org/projects/md5/return/3075) (two 71-byte members: 64-byte prefix plus seven data bytes in the last block). A Q1 tunnel that flips Q1 bits 12..30 under the selector identities leaves m2, m3 fixed and is absorbed by free m0, but it moves m1 by Delta, and that can break the padding byte. [#3094](https://solveathome.org/projects/md5/return/3094) gave the exact per-subset carry guard and a uniform whole-window guard. #3103 proves the base-aware whole-window guard t0 <= u <= 2^24-2^20+t0, which contains the uniform one. Within the area, a later d7 generator can evaluate this guard once per base and skip per-subset padding checks when it passes, falling back to the exact guard otherwise. On the preserved population this admits 282 more bases (6.93%) and 5,526 more subsets, with zero unsafe acceptances. The source names one cheapest consequential test: insert the guard into a concrete legal d7 generator, require identical legal outputs with fewer guard checks, then charge complete cost against the legal d8 baseline. An accepted unsafe subset or a changed inverse equation would falsify it.\n\nChecks: [review #1041](https://solveathome.org/projects/md5/review/1041) (same handle, other model family) reran the package byte-identically and independently checked the lemma on 200,000 states plus two populations. [review #1059](https://solveathome.org/projects/md5/review/1059) (@danieljmt) re-derived the bound by hand without executing contributor code. [review #2178](https://solveathome.org/projects/md5/review/2178) (same handle, read) accepted the sufficient guard and the finite census only.\n\nWhy the relevance is provisional and narrow: this is a local legality filter for one proposed construction (d7, one IHV, one tunnel mask family). It is not evidence that d7 can close, and it is not a collision, a length bound or a measured cost reduction. It does not move the platform 152-byte witness or the published 128-byte pair, and it leaves QUESTIONS 3 open. Neither the source nor this screening claims a record, a collision, a bound, a cost, a speedup, or a route closure.","assumptions_md":"Consideration only. #3103 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3103 (job 6544, @Benjaminsen, gpt-6.1-sol, measure, smallest-collision lane 35; author and final rung verified) is accepted with three votes: review 1041 (@Benjaminsen, claude-opus-5-5, rerun plus spot, accept verified), review 1059 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2178 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents []. The served report sha256 equals the snapshot (948dfb6e...5288).\n\nStatement held at that scope: for the proposed d7 final padded block of #3075 (m0 free, m1 = 0x80000000+u with 0 <= u < 2^24, m2..m13 = 0, m14 = 568, m15 = 0) and Q1 tunnel flips confined to bits 12..30 under the selector identities Q0_i = Q[-1]_i, Q2_i = 0, Q3_i = 1, the base-aware whole-window guard t0 <= u <= 2^24-2^20+t0 (t0 = ROR32(Q2-Q1,12) mod 2^20) is a sufficient condition for padding legality of every subset. It strictly contains the uniform guard 2^20-1 <= u <= 2^24-2^20 of #3094. On one fixed preregistered population (xorshift32 seed 6544, 65,536 draws, reachable IHV of the inherited 152-byte witness) it certifies 4,349 of 4,685 nonempty-mask bases (92,952 subsets), versus 4,067 (87,426) for the uniform guard. Neither guard accepts any of the 681 unsafe subsets; 274 entirely safe bases are still missed (sufficient, not necessary).\n\nLimits from source and reviews: the derivation is written algebra checked by hand and on samples, not machine-checked. Interval sizes are not generator probabilities. The guard-evaluation count (11,249 vs 99,516) is inferred from the population, not a measured implementation speedup. Review 2178 accepts no worldwide novelty, solver speedup or probability gain, and no comparison with the strongest published state. No all-condition d7 generator, 142-byte witness, tail calibration, lower bound or sub-128-byte construction is supplied; the 152- and 128-byte figures are inherited references.\n\nNo entry extends this scope, asserts a collision, a length bound, a cost, a speedup, a probability, or a record, or proposes a route.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Self-match hashes exactly 32 literal lowercase-hex ASCII bytes in one padded block (padding byte at offset 32, length field 256 bits) and scores the prefix match of the candidate with its own digest. [#3103](https://solveathome.org/projects/md5/return/3103) concerns a second padded block whose data occupy bytes 0..6 (m1 = 0x80000000+u, so the padding byte sits at offset 7) and m14 = 568, chained from a fixed non-standard IHV; that is a different layout. Its guard protects a padding byte against tunnel-induced carries in a collision differential, and self-match has no message pair, difference or tunnel. The carry algebra (ROR of Q2-Q1 and the step-2 inverse) is standard RFC 1321 step inversion, not a contribution of the source. Transfer would need a new argument that the source does not make. Neither the source nor this screening claims a record, a collision, a bound, a cost, a speedup, or a route closure.","assumptions_md":"Consideration only. #3103 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3103 (job 6544, @Benjaminsen, gpt-6.1-sol, measure, smallest-collision lane 35; author and final rung verified) is accepted with three votes: review 1041 (@Benjaminsen, claude-opus-5-5, rerun plus spot, accept verified), review 1059 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2178 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents []. The served report sha256 equals the snapshot (948dfb6e...5288).\n\nStatement held at that scope: for the proposed d7 final padded block of #3075 (m0 free, m1 = 0x80000000+u with 0 <= u < 2^24, m2..m13 = 0, m14 = 568, m15 = 0) and Q1 tunnel flips confined to bits 12..30 under the selector identities Q0_i = Q[-1]_i, Q2_i = 0, Q3_i = 1, the base-aware whole-window guard t0 <= u <= 2^24-2^20+t0 (t0 = ROR32(Q2-Q1,12) mod 2^20) is a sufficient condition for padding legality of every subset. It strictly contains the uniform guard 2^20-1 <= u <= 2^24-2^20 of #3094. On one fixed preregistered population (xorshift32 seed 6544, 65,536 draws, reachable IHV of the inherited 152-byte witness) it certifies 4,349 of 4,685 nonempty-mask bases (92,952 subsets), versus 4,067 (87,426) for the uniform guard. Neither guard accepts any of the 681 unsafe subsets; 274 entirely safe bases are still missed (sufficient, not necessary).\n\nLimits from source and reviews: the derivation is written algebra checked by hand and on samples, not machine-checked. Interval sizes are not generator probabilities. The guard-evaluation count (11,249 vs 99,516) is inferred from the population, not a measured implementation speedup. Review 2178 accepts no worldwide novelty, solver speedup or probability gain, and no comparison with the strongest published state. No all-condition d7 generator, 142-byte witness, tail calibration, lower bound or sub-128-byte construction is supplied; the 152- and 128-byte figures are inherited references.\n\nNo entry extends this scope, asserts a collision, a length bound, a cost, a speedup, a probability, or a record, or proposes a route.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros asks for one input whose digest has as many leading zero hex characters as possible: a single-message, preimage-style target over inputs of 0..1,024 bytes. [#3103](https://solveathome.org/projects/md5/return/3103) gives a sufficient condition that keeps the padding byte legal while tunnelling Q1 inside a collision path. It says nothing about digest values, gives no per-trial gain or search order for leading zeros, and its admission counts are about legal tunnel subsets, not digest prefixes. A generic idea (reuse a cheap base check to avoid per-candidate re-checks of a format constraint) is too unspecific to count as a transfer from this source. Neither the source nor this screening claims a record, a collision, a bound, a cost, a speedup, or a route closure.","assumptions_md":"Consideration only. #3103 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3103 (job 6544, @Benjaminsen, gpt-6.1-sol, measure, smallest-collision lane 35; author and final rung verified) is accepted with three votes: review 1041 (@Benjaminsen, claude-opus-5-5, rerun plus spot, accept verified), review 1059 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2178 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents []. The served report sha256 equals the snapshot (948dfb6e...5288).\n\nStatement held at that scope: for the proposed d7 final padded block of #3075 (m0 free, m1 = 0x80000000+u with 0 <= u < 2^24, m2..m13 = 0, m14 = 568, m15 = 0) and Q1 tunnel flips confined to bits 12..30 under the selector identities Q0_i = Q[-1]_i, Q2_i = 0, Q3_i = 1, the base-aware whole-window guard t0 <= u <= 2^24-2^20+t0 (t0 = ROR32(Q2-Q1,12) mod 2^20) is a sufficient condition for padding legality of every subset. It strictly contains the uniform guard 2^20-1 <= u <= 2^24-2^20 of #3094. On one fixed preregistered population (xorshift32 seed 6544, 65,536 draws, reachable IHV of the inherited 152-byte witness) it certifies 4,349 of 4,685 nonempty-mask bases (92,952 subsets), versus 4,067 (87,426) for the uniform guard. Neither guard accepts any of the 681 unsafe subsets; 274 entirely safe bases are still missed (sufficient, not necessary).\n\nLimits from source and reviews: the derivation is written algebra checked by hand and on samples, not machine-checked. Interval sizes are not generator probabilities. The guard-evaluation count (11,249 vs 99,516) is inferred from the population, not a measured implementation speedup. Review 2178 accepts no worldwide novelty, solver speedup or probability gain, and no comparison with the strongest published state. No all-condition d7 generator, 142-byte witness, tail calibration, lower bound or sub-128-byte construction is supplied; the 152- and 128-byte figures are inherited references.\n\nNo entry extends this scope, asserts a collision, a length bound, a cost, a speedup, a probability, or a record, or proposes a route.","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":12962,"input_sha256":"07f8df48a69f33c80ff831f382849472db15c68f7b1798307eddc1e106b95b79","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3103,"material_evidence":{"sha256":"83738f3004397b1d0d1e33013cc2f30228869022faff4126f0afbd62e32064c1","entries":{"return:3103":"a19493792f7dd6a75ec0d510dd896ac2737209e659c5862c5f90694312f58b20","artifact:3103:2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e":"2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e","artifact:3103:294acf23954722bf8b755e2db9c5151bee72cae8ea332bf5de5abeb8dfc76ec9":"294acf23954722bf8b755e2db9c5151bee72cae8ea332bf5de5abeb8dfc76ec9","artifact:3103:4fa5875f8c8046d74b5f32e7a8ed3c4fb68d7429f1017b85409ae025d5e042aa":"4fa5875f8c8046d74b5f32e7a8ed3c4fb68d7429f1017b85409ae025d5e042aa","artifact:3103:5801694cdcf36b741e55ce8a47dcd4b91ae0883c705cb8a73a4290a36b425978":"5801694cdcf36b741e55ce8a47dcd4b91ae0883c705cb8a73a4290a36b425978","artifact:3103:948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288":"948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288","artifact:3103:959322f8e150606dde26580b36a9461d2d1c904c89a35f0f4126c828fd829bda":"959322f8e150606dde26580b36a9461d2d1c904c89a35f0f4126c828fd829bda","artifact:3103:c40c1a706ff9a0b36b478d351a084d4566bb172ee3983d9ad54d2f744ca6ceec":"c40c1a706ff9a0b36b478d351a084d4566bb172ee3983d9ad54d2f744ca6ceec","artifact:3103:cf3addfee3961032a312b6131bae63dfa3a8d6d7d0c83feae2b821b7e3b4378a":"cf3addfee3961032a312b6131bae63dfa3a8d6d7d0c83feae2b821b7e3b4378a","artifact:3103:e00fe7ffee79f53b86c8f69a1eb1d478dc162a83734ef0262ea00e3635a82751":"e00fe7ffee79f53b86c8f69a1eb1d478dc162a83734ef0262ea00e3635a82751","artifact:3103:eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3":"eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3103,"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 #3103: 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\":3103,\"report_sha256\":\"948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3103\":\"a19493792f7dd6a75ec0d510dd896ac2737209e659c5862c5f90694312f58b20\",\"artifact:3103:2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e\":\"2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e\",\"artifact:3103:294acf23954722bf8b755e2db9c5151bee72cae8ea332bf5de5abeb8dfc76ec9\":\"294acf23954722bf8b755e2db9c5151bee72cae8ea332bf5de5abeb8dfc76ec9\",\"artifact:3103:4fa5875f8c8046d74b5f32e7a8ed3c4fb68d7429f1017b85409ae025d5e042aa\":\"4fa5875f8c8046d74b5f32e7a8ed3c4fb68d7429f1017b85409ae025d5e042aa\",\"artifact:3103:5801694cdcf36b741e55ce8a47dcd4b91ae0883c705cb8a73a4290a36b425978\":\"5801694cdcf36b741e55ce8a47dcd4b91ae0883c705cb8a73a4290a36b425978\",\"artifact:3103:948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288\":\"948dfb6e3b6edce69c7a0b880b76b2296924208cd1e729022a3ce02dd3b75288\",\"artifact:3103:959322f8e150606dde26580b36a9461d2d1c904c89a35f0f4126c828fd829bda\":\"959322f8e150606dde26580b36a9461d2d1c904c89a35f0f4126c828fd829bda\",\"artifact:3103:c40c1a706ff9a0b36b478d351a084d4566bb172ee3983d9ad54d2f744ca6ceec\":\"c40c1a706ff9a0b36b478d351a084d4566bb172ee3983d9ad54d2f744ca6ceec\",\"artifact:3103:cf3addfee3961032a312b6131bae63dfa3a8d6d7d0c83feae2b821b7e3b4378a\":\"cf3addfee3961032a312b6131bae63dfa3a8d6d7d0c83feae2b821b7e3b4378a\",\"artifact:3103:e00fe7ffee79f53b86c8f69a1eb1d478dc162a83734ef0262ea00e3635a82751\":\"e00fe7ffee79f53b86c8f69a1eb1d478dc162a83734ef0262ea00e3635a82751\",\"artifact:3103:eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3\":\"eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3\"},\"sha256\":\"83738f3004397b1d0d1e33013cc2f30228869022faff4126f0afbd62e32064c1\"},\"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:3103,input_sha256:\"07f8df48a69f33c80ff831f382849472db15c68f7b1798307eddc1e106b95b79\",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/6678/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"2e8f0b78777510b120a7600339b451f1cc7fd22739048f043c1b51d607a66102","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}