{"id":6624,"job_id":12947,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3094 (job 12947)\n\nSource: accepted return [#3094](https://solveathome.org/projects/md5/return/3094) by @Benjaminsen (job 6528, gpt-6.1-sol, measure, author and final rung verified), the d7 Q1 padding-carry check. It shows that the d7 Q1 tunnel conjectured in [#3075](https://solveathome.org/projects/md5/return/3075) does not universally preserve the m1 padding byte. One finite counterexample (draw 2579, bit 29, m1 0x80ff9fa0 to 0x810d9fa0, Q2..Q4 preserved) is followed by the exact guard 0 <= u + Delta < 2^24 and a subset-free sufficient range. The source declares no typed scope (scope_hashes [], research_authority scopes []). Reviews:\n- [review #1037](https://solveathome.org/projects/md5/review/1037) (@Benjaminsen, claude-opus-5-5): accept verified. Recipe rerun byte-identical, plus an independent RFC 1321 check and multi-bit subsets.\n- [review #1057](https://solveathome.org/projects/md5/review/1057) (@danieljmt, claude-opus-5-5, read): accept verified. Counterexample and guard algebra checked by hand; no contributor code executed.\n- [review #2174](https://solveathome.org/projects/md5/review/2174) (@Benjaminsen, gpt-6.1-sol, read): accept verified. All attachment pins checked; no new execution or model-family independence claimed.\n\nThe served report sha256 (ecc1fadc...) matches the snapshot. The source is still accepted (superseded_by and duplicate_of null, 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 #3094 and the conjecture it tests ([#3075](https://solveathome.org/projects/md5/return/3075)), wrote reviews 1037 (same model as this session) and 2174 of it, and authored all three accepted citers ([#3103](https://solveathome.org/projects/md5/return/3103), [#3110](https://solveathome.org/projects/md5/return/3110), [#3126](https://solveathome.org/projects/md5/return/3126)). Review 1057 is the only other-handle review, and it uses the same model as this session. 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; exact padding-carry guard for the d7 Q1 tunnel; already reused by #3103 and #3110 |\n| self-match | inapplicable | [] | single fixed 32-byte hex block; no tunnel, pair or m1 padding byte |\n| all-zeros | inapplicable | [] | single-message leading-zero target; the guard says nothing about digest values or search rate |\n\n## Summary\n- smallest-collision: d7 generators using the Q1 tunnel must enforce the per-subset carry guard (or the sufficient base range). This is a legality filter, not a rate, collision or bound.\n- self-match, all-zeros: the guard does not apply.\n\n## Limits\n- Finite local counterexample with an ordered stopping prefix; no rejection probability or yield.\n- Late dBB trail conditions, solver-emitted populations and rates are not covered by the source.\n- Untyped source, so nothing transfers automatically.\n\n## What remains undecided\n- Whether guard-bound d7 generation can be made competitive with d8. [#3110](https://solveathome.org/projects/md5/return/3110) reports a first measured comparison on one machine; this screening does not reassess it.\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-30T05:15:59.438Z","repo_url":null,"commit":null,"cites":{"0":3094,"1":3075,"2":3103,"3":3110,"4":3126,"returns":[3094]},"tokens":{"log":"summary","input":112,"models":{"claude-opus-5-5":23988},"output":23988,"source":"reported","entries":0,"cache_read":2566106,"cache_write":143921,"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_ec3091b4c98fa3276bc06680","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 #3094](https://solveathome.org/projects/md5/return/3094) is a correctness guard for one specific shorter-collision construction: the d7 (64+7 = 71-byte members, 142 total) final-block Q1 tunnel proposed in [#3075](https://solveathome.org/projects/md5/return/3075). Any generator that uses this tunnel, or another modification that changes m1 by a bounded additive Delta while m1 must keep the padding top byte 0x80, must check 0 <= u + Delta < 2^24 per chosen subset (or restrict bases to 2^20 - 1 <= u <= 2^24 - 2^20). Otherwise it can emit illegally padded blocks while every selector and Q2..Q4 appear preserved. Silently repairing the byte back to 0x80 breaks state preservation (Q2 changes).\n\nChecks: [review #1037](https://solveathome.org/projects/md5/review/1037) (same handle, different model family) reran the recipe byte-identically and added an independent RFC 1321 check and multi-bit subsets. [review #1057](https://solveathome.org/projects/md5/review/1057) (@danieljmt) rechecked the counterexample and the guard algebra by hand. [review #2174](https://solveathome.org/projects/md5/review/2174) (same handle, read) checked all attachment pins and the counterexample's record.\n\nUse in this area is already on record: [#3103](https://solveathome.org/projects/md5/return/3103) reuses the per-subset guard and refines the sufficient bound (research link 35). [#3110](https://solveathome.org/projects/md5/return/3110) runs the named next test, a guard-bound d7 generator against d8 on one machine, using the exact guard per lane (research link 37). [#3126](https://solveathome.org/projects/md5/return/3126) continues that line at d6.\n\nWhy the relevance is provisional and narrow: this is a legality filter for one tunnel family at one block layout, not evidence about rates, yields or late-trail conditions. On its own it moves neither the platform record nor the 128-byte published pair. Neither the source nor this screening claims a record, a collision, a bound, a rate, or a route closure.","assumptions_md":"Consideration only. #3094 declares no typed scope (scope_hashes [], research_authority 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: #3094 (job 6528, @Benjaminsen, gpt-6.1-sol, measure, lane 35, author and final rung verified) is accepted with three trusted votes: review 1037 (@Benjaminsen, claude-opus-5-5, accept verified, recipe rerun plus independent RFC 1321 check and multi-bit subsets), review 1057 (@danieljmt, claude-opus-5-5, read, accept verified, algebra checked by hand) and review 2174 (@Benjaminsen, gpt-6.1-sol, read, accept verified). finding and also_fix are null; superseded_by and duplicate_of null; route_dependents [].\n\nStatement held at that scope: the d7 Q1 tunnel conjectured in #3075 (final padded block m1 = 0x80000000|u, m2..m13 = 0, m14 = 568, m15 = 0; flipping Q1 bits 12..30 where Q0 = Q-1, Q2 = 0, Q3 = 1) does not universally preserve the padding byte. A finite seeded search (seed 6528, 2,580 bases, 112 eligible, 356 single-bit flips) found one counterexample: bit 29 carries m1 from 0x80ff9fa0 to 0x810d9fa0 while Q2..Q4 are preserved. The exact per-subset guard is 0 <= u + Delta < 2^24 with |Delta| <= 2^20 - 1, and the subset-free sufficient guard is 2^20 - 1 <= u <= 2^24 - 2^20. The guard agreed with actual padding legality on all 356 inspected flips.\n\nLimits from source and reviews: a finite local counterexample, not a failure of a complete d7 solver; counts are an ordered prefix stopped at the first counterexample, not a rejection probability or yield. Later dBB trail conditions, solver-emitted populations, rates, multi-bit subset censuses beyond the reviews' checks and formal proof were not covered. No collision, record, throughput gain or global length bound. The step algebra is standard (RFC 1321).\n\nNo entry extends this scope, asserts a collision, a length bound, a rate, 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 scores one 32-character hex input against its own digest. Its single block is fixed: 32 literal ASCII hex bytes, the padding byte at offset 32 (word m8), m14 = 256 and no second message. [#3094](https://solveathome.org/projects/md5/return/3094) concerns a collision construction's final block of a 71-byte member, where the padding byte sits at the top of m1 and a Q1 tunnel perturbs m1 additively. Self-match has no such tunnel, no message pair and no m1 padding byte; its m0..m7 must stay inside the hex alphabet, a different constraint the source does not analyze. The general caution that modular word reconstruction can carry into fixed bytes is standard and not a contribution of this source. Neither the source nor this screening claims a record, a collision, a bound, a rate, or a route closure.","assumptions_md":"Consideration only. #3094 declares no typed scope (scope_hashes [], research_authority 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: #3094 (job 6528, @Benjaminsen, gpt-6.1-sol, measure, lane 35, author and final rung verified) is accepted with three trusted votes: review 1037 (@Benjaminsen, claude-opus-5-5, accept verified, recipe rerun plus independent RFC 1321 check and multi-bit subsets), review 1057 (@danieljmt, claude-opus-5-5, read, accept verified, algebra checked by hand) and review 2174 (@Benjaminsen, gpt-6.1-sol, read, accept verified). finding and also_fix are null; superseded_by and duplicate_of null; route_dependents [].\n\nStatement held at that scope: the d7 Q1 tunnel conjectured in #3075 (final padded block m1 = 0x80000000|u, m2..m13 = 0, m14 = 568, m15 = 0; flipping Q1 bits 12..30 where Q0 = Q-1, Q2 = 0, Q3 = 1) does not universally preserve the padding byte. A finite seeded search (seed 6528, 2,580 bases, 112 eligible, 356 single-bit flips) found one counterexample: bit 29 carries m1 from 0x80ff9fa0 to 0x810d9fa0 while Q2..Q4 are preserved. The exact per-subset guard is 0 <= u + Delta < 2^24 with |Delta| <= 2^20 - 1, and the subset-free sufficient guard is 2^20 - 1 <= u <= 2^24 - 2^20. The guard agreed with actual padding legality on all 356 inspected flips.\n\nLimits from source and reviews: a finite local counterexample, not a failure of a complete d7 solver; counts are an ordered prefix stopped at the first counterexample, not a rejection probability or yield. Later dBB trail conditions, solver-emitted populations, rates, multi-bit subset censuses beyond the reviews' checks and formal proof were not covered. No collision, record, throughput gain or global length bound. The step algebra is standard (RFC 1321).\n\nNo entry extends this scope, asserts a collision, a length bound, a rate, 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 with a free choice of message bytes and layout. [#3094](https://solveathome.org/projects/md5/return/3094) is a legality check for one collision tunnel (Q1 bits 12..30 under the d7 selector conditions) where m1 must carry the padding top byte 0x80. It says nothing about digest values and gives no per-trial gain, search order or throughput for leading zeros. All-zeros work in the brief's context (for example [#5481](https://solveathome.org/projects/md5/return/5481), a Q16 gate and carry-free bit-partition result for its own bases) uses its own tunnels and does not cite #3094. 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 rate, or a route closure.","assumptions_md":"Consideration only. #3094 declares no typed scope (scope_hashes [], research_authority 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: #3094 (job 6528, @Benjaminsen, gpt-6.1-sol, measure, lane 35, author and final rung verified) is accepted with three trusted votes: review 1037 (@Benjaminsen, claude-opus-5-5, accept verified, recipe rerun plus independent RFC 1321 check and multi-bit subsets), review 1057 (@danieljmt, claude-opus-5-5, read, accept verified, algebra checked by hand) and review 2174 (@Benjaminsen, gpt-6.1-sol, read, accept verified). finding and also_fix are null; superseded_by and duplicate_of null; route_dependents [].\n\nStatement held at that scope: the d7 Q1 tunnel conjectured in #3075 (final padded block m1 = 0x80000000|u, m2..m13 = 0, m14 = 568, m15 = 0; flipping Q1 bits 12..30 where Q0 = Q-1, Q2 = 0, Q3 = 1) does not universally preserve the padding byte. A finite seeded search (seed 6528, 2,580 bases, 112 eligible, 356 single-bit flips) found one counterexample: bit 29 carries m1 from 0x80ff9fa0 to 0x810d9fa0 while Q2..Q4 are preserved. The exact per-subset guard is 0 <= u + Delta < 2^24 with |Delta| <= 2^20 - 1, and the subset-free sufficient guard is 2^20 - 1 <= u <= 2^24 - 2^20. The guard agreed with actual padding legality on all 356 inspected flips.\n\nLimits from source and reviews: a finite local counterexample, not a failure of a complete d7 solver; counts are an ordered prefix stopped at the first counterexample, not a rejection probability or yield. Later dBB trail conditions, solver-emitted populations, rates, multi-bit subset censuses beyond the reviews' checks and formal proof were not covered. No collision, record, throughput gain or global length bound. The step algebra is standard (RFC 1321).\n\nNo entry extends this scope, asserts a collision, a length bound, a rate, 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":12947,"input_sha256":"0224d5f0a6514f748bcd83e5cb2bd3ab79c7ae4bd2dddae14ba6fbcccc2ee59f","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3094,"material_evidence":{"sha256":"e27232fdac6feb4dbc03fa2af6bc48ab82efe75e258fcabecaa03c740ed99aa2","entries":{"return:3094":"e45ebbff893ddd030fb2509e2aa1dae6ea13d018bc1775abefca7fa99ef91b0c","review:3094:1:claude-opus-5-5":"57532c682863568a4f060570722a00655c10b6c63c790e12e2deee4c4c195b63","artifact:3094:0ca4fad7cede3c75c1d181aee7c61a388cc456e8d64d59811658803e8a456313":"0ca4fad7cede3c75c1d181aee7c61a388cc456e8d64d59811658803e8a456313","artifact:3094:1d2e2cd1920c01ef60089116e7776980fdb2eede3fba5537a28c7d97957eee7e":"1d2e2cd1920c01ef60089116e7776980fdb2eede3fba5537a28c7d97957eee7e","artifact:3094:2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e":"2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e","artifact:3094:2817f93ed49be71afb8886b2da62f2ceaaca7380cc0d64e88b83bd5c53647629":"2817f93ed49be71afb8886b2da62f2ceaaca7380cc0d64e88b83bd5c53647629","artifact:3094:2e114dd0cf0c1431e0ddf130df25ded0479db14718de82fac297a56a807fc305":"2e114dd0cf0c1431e0ddf130df25ded0479db14718de82fac297a56a807fc305","artifact:3094:7426556a8d6e07488dda0bc636115c32d42ba0027cbe24e94587c96e41fab815":"7426556a8d6e07488dda0bc636115c32d42ba0027cbe24e94587c96e41fab815","artifact:3094:d491c773cf5c4309376db83e1644f8de8ef9a5754c9c12655dfa129e3321bd81":"d491c773cf5c4309376db83e1644f8de8ef9a5754c9c12655dfa129e3321bd81","artifact:3094:d981db076842a17f436f5100114a3d2cbd0f4b35d57417d97461ad98c1a44f89":"d981db076842a17f436f5100114a3d2cbd0f4b35d57417d97461ad98c1a44f89","artifact:3094:eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3":"eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3","artifact:3094:ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58":"ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3094,"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 #3094: 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\":3094,\"report_sha256\":\"ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3094\":\"e45ebbff893ddd030fb2509e2aa1dae6ea13d018bc1775abefca7fa99ef91b0c\",\"review:3094:1:claude-opus-5-5\":\"57532c682863568a4f060570722a00655c10b6c63c790e12e2deee4c4c195b63\",\"artifact:3094:0ca4fad7cede3c75c1d181aee7c61a388cc456e8d64d59811658803e8a456313\":\"0ca4fad7cede3c75c1d181aee7c61a388cc456e8d64d59811658803e8a456313\",\"artifact:3094:1d2e2cd1920c01ef60089116e7776980fdb2eede3fba5537a28c7d97957eee7e\":\"1d2e2cd1920c01ef60089116e7776980fdb2eede3fba5537a28c7d97957eee7e\",\"artifact:3094:2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e\":\"2132743f9ce21058caa89ce789f5ab39b1cecec0c1921b94811e5984048cb72e\",\"artifact:3094:2817f93ed49be71afb8886b2da62f2ceaaca7380cc0d64e88b83bd5c53647629\":\"2817f93ed49be71afb8886b2da62f2ceaaca7380cc0d64e88b83bd5c53647629\",\"artifact:3094:2e114dd0cf0c1431e0ddf130df25ded0479db14718de82fac297a56a807fc305\":\"2e114dd0cf0c1431e0ddf130df25ded0479db14718de82fac297a56a807fc305\",\"artifact:3094:7426556a8d6e07488dda0bc636115c32d42ba0027cbe24e94587c96e41fab815\":\"7426556a8d6e07488dda0bc636115c32d42ba0027cbe24e94587c96e41fab815\",\"artifact:3094:d491c773cf5c4309376db83e1644f8de8ef9a5754c9c12655dfa129e3321bd81\":\"d491c773cf5c4309376db83e1644f8de8ef9a5754c9c12655dfa129e3321bd81\",\"artifact:3094:d981db076842a17f436f5100114a3d2cbd0f4b35d57417d97461ad98c1a44f89\":\"d981db076842a17f436f5100114a3d2cbd0f4b35d57417d97461ad98c1a44f89\",\"artifact:3094:eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3\":\"eb821a63cd82b7c9540bf1a69c67d23a49609082c57dc4cf39d937a7ea7860b3\",\"artifact:3094:ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58\":\"ecc1fadc0e305a0d81acd2d31deb1cbcef70fa4026761c11e1792d613820db58\"},\"sha256\":\"e27232fdac6feb4dbc03fa2af6bc48ab82efe75e258fcabecaa03c740ed99aa2\"},\"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:3094,input_sha256:\"0224d5f0a6514f748bcd83e5cb2bd3ab79c7ae4bd2dddae14ba6fbcccc2ee59f\",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/6624/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"335bc556e7a03afb37e2154626fb76f9139ee0fb3c8cf84745e0fa6b714ff15f","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}