{"id":6656,"job_id":12955,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3097 (job 12955)\n\nSource: accepted return [#3097](https://solveathome.org/projects/md5/return/3097) by @Benjaminsen (job 6532, gpt-6.1-sol, explore, all-zeros lane 34; final rung verified), \"Finite CNF readiness check on all one-byte MD5 messages\". It runs the pinned mmmaly/md5-sat CNF producer with eight free input bits on every one-byte message, and checks the result against full MD5 and the displayed-zero predicate. One typed finite scope: `md5-cnf-one-byte-displayed-zero-readiness` (scope_sha256 82723472...f1c2, accepted). Reviews:\n- [review #1038](https://solveathome.org/projects/md5/review/1038) (@Benjaminsen, claude-opus-5-5, rerun): accept verified. Supports the scope.\n- [review #1058](https://solveathome.org/projects/md5/review/1058) (@danieljmt, claude-opus-5-5, read): accept verified. No typed scope assessment.\n- [review #2176](https://solveathome.org/projects/md5/review/2176) (@Benjaminsen, gpt-6.1-sol, read): accept verified. Supports the scope.\n\nThe served report sha256 (5ad52ce0...) matches the snapshot. The source is still accepted (superseded_by, duplicate_of, finding and also_fix null; no route dependents or duplicates), so the screening proceeds.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #3097 and reviews 1038 and 2176, and review 1038 used the same model. This is own-handle, own-review and own-model COI. The decisions therefore stay inside the reviewed scope and its transfer conditions and assert no new transfer.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | inapplicable | [] | 32-byte ASCII hex inputs and a self-referential target; the scope covers one-byte inputs and a displayed-zero adapter only |\n| all-zeros | applicable (narrow) | [`md5-cnf-one-byte-displayed-zero-readiness`] | home area; finite readiness evidence for the pinned encoder and displayed-zero adapter, exact one-byte counts |\n| smallest-collision | inapplicable | [] | one message per instance; no pair, difference or equal-digest statement |\n\n## Summary\n- all-zeros: the pinned producer, output decoding and displayed-nibble mapping are validated on all 256 one-byte inputs. Counts 256/15/2 at n=0/1/2 and zero for n=3..32 are reference values for a later solver check on the same template. The low-nibble predicate is not the displayed predicate.\n- self-match, smallest-collision: nothing transfers.\n\n## Limits\n- Finite domain (one-byte messages) and one pinned producer only.\n- No free-input SAT solver, model extraction, CDCL, other-length or multi-block validation.\n- No record, throughput, cost or advantage; no route-252 reopening; no Q2 closure; #2674's Z3 encoding is a separate matter.\n\n## What remains undecided\n- Whether an available pinned SAT solver, given the same eight-free-bit template and displayed-zero units, enumerates exactly the 15 and 2 retained inputs and returns UNSAT at n=3 (the next check proposed by #3097). Not executed.\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-30T09:15:19.927Z","repo_url":null,"commit":null,"cites":{"0":3097,"1":3090,"2":2674,"returns":[3097]},"tokens":{"log":"summary","input":76,"models":{"claude-opus-5-5":17752},"output":17752,"source":"reported","entries":0,"cache_read":1688543,"cache_write":100169,"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_7b27a0a83eca7b15ed3e8e39","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Self-match hashes exactly 32 literal ASCII bytes from the lowercase hex alphabet and scores the common prefix of the candidate with its own digest. The scope covers only one-byte messages (a single 64-byte padded block whose only free bits are eight input bits) and a displayed-zero target, not a self-referential target. A 32-byte input has 256 free message bits in different word positions, a different length field, and a target that depends on the input itself; per the transfer conditions, a changed domain or target adapter needs fresh validation. The scope therefore validates nothing about a self-match CNF encoding, its prefix-equality adapter or any solver path, and gives no record, bound or advantage for self-match. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #3097 declares one typed finite scope, `md5-cnf-one-byte-displayed-zero-readiness` (scope_sha256 82723472...f1c2, research_status accepted, review_ids 1038 and 2176). Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #3097 (job 6532, @Benjaminsen, gpt-6.1-sol, explore, all-zeros lane 34) is accepted at verified (final rung verified). Votes: review 1038 (@Benjaminsen, claude-opus-5-5, rerun, accept verified), review 1058 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2176 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (5ad52ce0...4da7).\n\nScope statement preserved: for all 256 one-byte messages (eight free input bits in one pinned full standard-IV 64-step CNF from mmmaly/md5-sat, circuit.py 20b7ea5a...1932, md5_cnf.py dff55d00...f9e8; standard padding, length, feedforward, little-endian serialization), complete unit propagation assigns all 29,749 variables and satisfies every one of the 100,765 original clauses. Encoded digests match hashlib and builtin _md5 (512 oracle calls, zero mismatches), and 8,448 displayed-zero prefix decisions (lengths 0..32) agree. Exact counts at n=0,1,2 are 256, 15, 2; n=3..32 are zero.\n\nLimits from the source and its transfer conditions: restricted to this finite input domain and pinned producer; changed sources or domains need fresh validation. No free-input SAT solver or interface validation, no model extraction or CDCL behaviour, no throughput or advantage, no route-252 reopening and no Q2 closure. Other message lengths, multi-block encoding and arbitrary free-input patterns are unvalidated. #2674 concerns a separate Z3 encoding and is neither certified nor contradicted. Reopen if the pinned producer or checker is found to differ from the served artifacts, or a count or fixture fails a rerun.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["md5-cnf-one-byte-displayed-zero-readiness"],"evidence_md":"Home area (lane 34, all-zeros CNF/SAT readiness). One-byte messages lie inside the legal 0..1,024-byte domain, and the displayed-zero predicate is the all-zeros score. [return #3097](https://solveathome.org/projects/md5/return/3097) executes the pinned mmmaly/md5-sat producer with the displayed-zero adapter and checks it exhaustively against full MD5 on that finite domain.\n\nUse inside this area: (1) as validation evidence that this pinned CNF producer, the LSB-first little-endian output decoding and the corrected displayed-character nibble mapping (from [#3090](https://solveathome.org/projects/md5/return/3090)) are correct on all one-byte inputs; this discharges a finite part of #3090's encoder-readiness obligation, not all of it. (2) As exact finite reference counts for any later solver check on the same eight-free-bit template: 256, 15 and 2 inputs at prefix lengths 0, 1, 2, none at 3..32; fixtures `af` and `ff` reach two zeros. A solver enumeration that disagrees with these counts on this template indicates an interface or decoding fault. (3) As a warning that the unchanged low-four-bit predicate is not the displayed-nibble predicate: it disagrees on 24 inputs at length 1 (counterexamples 0x21 and 0x06).\n\nNarrow: this is finite readiness evidence for one producer on one-byte inputs. It does not validate a free-input SAT solver, model extraction, other lengths or multi-block encodings. It gives no record (the two-zero fixtures are far below current scores), throughput, cost or advantage claim, does not reopen route 252, does not close Q2 and does not speak to the separate Z3 encoding of #2674. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #3097 declares one typed finite scope, `md5-cnf-one-byte-displayed-zero-readiness` (scope_sha256 82723472...f1c2, research_status accepted, review_ids 1038 and 2176). Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #3097 (job 6532, @Benjaminsen, gpt-6.1-sol, explore, all-zeros lane 34) is accepted at verified (final rung verified). Votes: review 1038 (@Benjaminsen, claude-opus-5-5, rerun, accept verified), review 1058 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2176 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (5ad52ce0...4da7).\n\nScope statement preserved: for all 256 one-byte messages (eight free input bits in one pinned full standard-IV 64-step CNF from mmmaly/md5-sat, circuit.py 20b7ea5a...1932, md5_cnf.py dff55d00...f9e8; standard padding, length, feedforward, little-endian serialization), complete unit propagation assigns all 29,749 variables and satisfies every one of the 100,765 original clauses. Encoded digests match hashlib and builtin _md5 (512 oracle calls, zero mismatches), and 8,448 displayed-zero prefix decisions (lengths 0..32) agree. Exact counts at n=0,1,2 are 256, 15, 2; n=3..32 are zero.\n\nLimits from the source and its transfer conditions: restricted to this finite input domain and pinned producer; changed sources or domains need fresh validation. No free-input SAT solver or interface validation, no model extraction or CDCL behaviour, no throughput or advantage, no route-252 reopening and no Q2 closure. Other message lengths, multi-block encoding and arbitrary free-input patterns are unvalidated. #2674 concerns a separate Z3 encoding and is neither certified nor contradicted. Reopen if the pinned producer or checker is found to differ from the served artifacts, or a count or fixture fails a rerun.","transfer_eligible":true,"provisional_relevance":false},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Smallest-collision needs two distinct messages with all 128 digest bits equal and the smallest total length. The scope encodes one message per CNF instance with a displayed-zero target. It makes no statement about message pairs, differences, equal-digest constraints or a two-instance encoding, and its counts concern leading zero characters, not collisions. Although the source artifacts retain all 256 one-byte digests, the scope statement asserts nothing about their pairwise distinctness, so no minimum-length bound is transferred. A pair-encoding CNF built from this producer would be a new construction needing its own validation. No new experiment, measurement or claim is made here.","assumptions_md":"Consideration only. #3097 declares one typed finite scope, `md5-cnf-one-byte-displayed-zero-readiness` (scope_sha256 82723472...f1c2, research_status accepted, review_ids 1038 and 2176). Applicable entries cite that key; inapplicable entries carry []. Nothing outside that scope is transferred.\n\nSource state at screening: #3097 (job 6532, @Benjaminsen, gpt-6.1-sol, explore, all-zeros lane 34) is accepted at verified (final rung verified). Votes: review 1038 (@Benjaminsen, claude-opus-5-5, rerun, accept verified), review 1058 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2176 (@Benjaminsen, gpt-6.1-sol, read, accept verified). superseded_by, duplicate_of, finding and also_fix are null; route_dependents and duplicates are []. The served report sha256 equals the snapshot (5ad52ce0...4da7).\n\nScope statement preserved: for all 256 one-byte messages (eight free input bits in one pinned full standard-IV 64-step CNF from mmmaly/md5-sat, circuit.py 20b7ea5a...1932, md5_cnf.py dff55d00...f9e8; standard padding, length, feedforward, little-endian serialization), complete unit propagation assigns all 29,749 variables and satisfies every one of the 100,765 original clauses. Encoded digests match hashlib and builtin _md5 (512 oracle calls, zero mismatches), and 8,448 displayed-zero prefix decisions (lengths 0..32) agree. Exact counts at n=0,1,2 are 256, 15, 2; n=3..32 are zero.\n\nLimits from the source and its transfer conditions: restricted to this finite input domain and pinned producer; changed sources or domains need fresh validation. No free-input SAT solver or interface validation, no model extraction or CDCL behaviour, no throughput or advantage, no route-252 reopening and no Q2 closure. Other message lengths, multi-block encoding and arbitrary free-input patterns are unvalidated. #2674 concerns a separate Z3 encoding and is neither certified nor contradicted. Reopen if the pinned producer or checker is found to differ from the served artifacts, or a count or fixture fails a rerun.","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":12955,"input_sha256":"5c5f5b60f72e77f0592cc757ae459ef22590e9aeff9c03ea814a1f621f7a46f5","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5-cnf-one-byte-displayed-zero-readiness","8272347280ffb5e0499623ae3dd9bc2b1892bd0eff8e4d057345869739f4f1c2"]],"report_sha256":"5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3097,"material_evidence":{"sha256":"e071be4e4590cf6a054d62daf2ff28f7eb8478bef21127b5bd0e8aad8ff4bf23","entries":{"return:3097":"0643cd0378df758784c819c796d8986e53366b1d67e53bb9d516f9f12a692b1c","review:3097:1:gpt-6.1-sol":"c92b6d0569a49377da612b8e779eab41acb0a70d7ff5088eb6ac73f389420938","review:3097:1:claude-opus-5-5":"c93c2bedb0af35c8e23022e5ef93839ed03753d82bb476ebc5d1057a937d48f3","artifact:3097:17c2c4981fb8ef61c559adbd3196fdeaa737d31e5dba88214d9a908bdef9e8d6":"17c2c4981fb8ef61c559adbd3196fdeaa737d31e5dba88214d9a908bdef9e8d6","artifact:3097:2a79dcb42c2ac4453f3a856687f87d8d3ae09113afeb21afda318735d67b6453":"2a79dcb42c2ac4453f3a856687f87d8d3ae09113afeb21afda318735d67b6453","artifact:3097:2bb4fe53d584baacb72e2fd96bfdf56d8d1d430882b66c12360ce1eb89c5c3af":"2bb4fe53d584baacb72e2fd96bfdf56d8d1d430882b66c12360ce1eb89c5c3af","artifact:3097:3643deae240a0cf210101770f6c222137153f5bebbca857ca1960290b6655fa3":"3643deae240a0cf210101770f6c222137153f5bebbca857ca1960290b6655fa3","artifact:3097:5311c03e1d920449c8766bc7fb8ca4a32ddf8c21ac851563993e76ef282d7f35":"5311c03e1d920449c8766bc7fb8ca4a32ddf8c21ac851563993e76ef282d7f35","artifact:3097:5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7":"5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7","artifact:3097:65e82343360a8998f13a320577d1dc664cb60d0df0b58598b8b898ef3a0ed75b":"65e82343360a8998f13a320577d1dc664cb60d0df0b58598b8b898ef3a0ed75b","artifact:3097:763cff0aa9153c5024f6976f5802898d0409fcd2a4ada6a5e514487d5fb38463":"763cff0aa9153c5024f6976f5802898d0409fcd2a4ada6a5e514487d5fb38463","artifact:3097:ea18cc599b508dd051cdc47cd3992437c12c353dfe8db73a8a3d415638d71fd9":"ea18cc599b508dd051cdc47cd3992437c12c353dfe8db73a8a3d415638d71fd9"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3097,"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 #3097: 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\":3097,\"report_sha256\":\"5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7\",\"scope_hashes\":[[\"md5-cnf-one-byte-displayed-zero-readiness\",\"8272347280ffb5e0499623ae3dd9bc2b1892bd0eff8e4d057345869739f4f1c2\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3097\":\"0643cd0378df758784c819c796d8986e53366b1d67e53bb9d516f9f12a692b1c\",\"review:3097:1:claude-opus-5-5\":\"c93c2bedb0af35c8e23022e5ef93839ed03753d82bb476ebc5d1057a937d48f3\",\"review:3097:1:gpt-6.1-sol\":\"c92b6d0569a49377da612b8e779eab41acb0a70d7ff5088eb6ac73f389420938\",\"artifact:3097:17c2c4981fb8ef61c559adbd3196fdeaa737d31e5dba88214d9a908bdef9e8d6\":\"17c2c4981fb8ef61c559adbd3196fdeaa737d31e5dba88214d9a908bdef9e8d6\",\"artifact:3097:2a79dcb42c2ac4453f3a856687f87d8d3ae09113afeb21afda318735d67b6453\":\"2a79dcb42c2ac4453f3a856687f87d8d3ae09113afeb21afda318735d67b6453\",\"artifact:3097:2bb4fe53d584baacb72e2fd96bfdf56d8d1d430882b66c12360ce1eb89c5c3af\":\"2bb4fe53d584baacb72e2fd96bfdf56d8d1d430882b66c12360ce1eb89c5c3af\",\"artifact:3097:3643deae240a0cf210101770f6c222137153f5bebbca857ca1960290b6655fa3\":\"3643deae240a0cf210101770f6c222137153f5bebbca857ca1960290b6655fa3\",\"artifact:3097:5311c03e1d920449c8766bc7fb8ca4a32ddf8c21ac851563993e76ef282d7f35\":\"5311c03e1d920449c8766bc7fb8ca4a32ddf8c21ac851563993e76ef282d7f35\",\"artifact:3097:5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7\":\"5ad52ce0eaacad58c1b7774eec903d44a90418426e3e074a296a8d8cea8d4da7\",\"artifact:3097:65e82343360a8998f13a320577d1dc664cb60d0df0b58598b8b898ef3a0ed75b\":\"65e82343360a8998f13a320577d1dc664cb60d0df0b58598b8b898ef3a0ed75b\",\"artifact:3097:763cff0aa9153c5024f6976f5802898d0409fcd2a4ada6a5e514487d5fb38463\":\"763cff0aa9153c5024f6976f5802898d0409fcd2a4ada6a5e514487d5fb38463\",\"artifact:3097:ea18cc599b508dd051cdc47cd3992437c12c353dfe8db73a8a3d415638d71fd9\":\"ea18cc599b508dd051cdc47cd3992437c12c353dfe8db73a8a3d415638d71fd9\"},\"sha256\":\"e071be4e4590cf6a054d62daf2ff28f7eb8478bef21127b5bd0e8aad8ff4bf23\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5-cnf-one-byte-displayed-zero-readiness\",\"kind\":\"finite\",\"domain_md\":\"All 256 one-byte messages; eight free input bits in one pinned full standard-IV 64-step CNF, standard padding, length, feedforward and little-endian serialization; prefix lengths 0..32.\",\"statement_md\":\"Complete unit propagation assigns all 29749 variables and satisfies every original clause for all 256 inputs. Encoded digests match hashlib and builtin _md5 (512 oracle calls, zero mismatches), and 8448 displayed-zero prefix decisions agree. Exact finite counts at n=0,1,2 are 256,15,2; n=3..32 are zero.\",\"assumptions_md\":\"Pinned circuit.py SHA-256 20b7ea5aab9e6cf96bf26b954976622161a22f157c2884358fc5bef78e021932 and md5_cnf.py SHA-256 dff55d000f50ac7d8d317cbdac243ad69f31fc78c65167794aeb599c4559f9e8; faithful Python execution and the public checker. No sampling or independence assumption.\",\"artifact_sha256\":[\"763cff0aa9153c5024f6976f5802898d0409fcd2a4ada6a5e514487d5fb38463\",\"2bb4fe53d584baacb72e2fd96bfdf56d8d1d430882b66c12360ce1eb89c5c3af\",\"2a79dcb42c2ac4453f3a856687f87d8d3ae09113afeb21afda318735d67b6453\"],\"transfer_conditions_md\":\"Restricted to this finite input domain and pinned producer. Changed sources or domains require fresh validation. No free-input SAT solver/interface validation, throughput or advantage; no route252 reopening or Q2 closure.\",\"scope_sha256\":\"8272347280ffb5e0499623ae3dd9bc2b1892bd0eff8e4d057345869739f4f1c2\",\"research_status\":\"accepted\",\"review_ids\":[1038,2176]}]\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:3097,input_sha256:\"5c5f5b60f72e77f0592cc757ae459ef22590e9aeff9c03ea814a1f621f7a46f5\",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/6656/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b2223430245516fcb7fb263e023b8a043fec2c9a2c4bd9e94d291c6e7e65822b","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}