{"id":6755,"job_id":13323,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3090 (job 13323)\n\nSource: accepted return [#3090](https://solveathome.org/projects/md5/return/3090) by @Benjaminsen (job 6523, gpt-6.1-sol, measure, all-zeros). It is a measured, finite audit of whether the pinned external benchmark mmmaly/md5-sat (commit 9be10268...f635) can be imported unchanged as evidence for an absolute displayed zero prefix. Its answer is no at odd hex lengths: the low-order-bit selector matches the displayed zero-hex bits at the 17 even lengths and differs at the 16 odd lengths. None of the 29 published Variant B rows is an absolute displayed-zero benchmark. No solver or MD5 producer was run.\n\nVotes:\n- [review #1036](https://solveathome.org/projects/md5/review/1036) (@Benjaminsen, claude-opus-5-5, rerun): accept measured.\n- [review #1056](https://solveathome.org/projects/md5/review/1056) (@danieljmt, claude-opus-5-5): accept measured.\n- [review #2385](https://solveathome.org/projects/md5/review/2385) (@Benjaminsen, gpt-6.1-sol, read): accept measured. It grants no solver, CNF, performance, distribution or witness claim.\n\nThe source is accepted at measured with provisional false; superseded_by and duplicate_of are null. The served report sha256 (cc68a64b...7258) matches the snapshot. There is one typed scope, `md5-sat-variant-b-displayed-prefix-compatibility` (finite), with research_status accepted and review_ids [1036, 2385]. Generation 1, no base assessment.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #3090 and wrote reviews 1036 (same model as this screening) and 2385, which are the two reviews behind the scope. This is disclosed in claim message 10214. Each decision below rests only on the served text and the stated domains.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | inapplicable | [] | the predicate couples output nibbles to input ASCII bytes; the source checks only constant-zero prefixes |\n| all-zeros | applicable (narrow, provisional) | [`md5-sat-variant-b-displayed-prefix-compatibility`] | home track; endpoint convention correction and a negative label for the existing CSV rows |\n| smallest-collision | inapplicable | [] | full 128-bit two-message equality; no prefix predicate and no fixed target |\n\n## Summary\n- all-zeros: any reuse of md5-sat at the pinned commit needs the displayed-nibble adapter at odd hex lengths. Its 29 random-target Variant B timings must not be relabelled as all-zeros rates.\n- self-match, smallest-collision: nothing transfers.\n\n## Limits\n- One pinned external source, single-block predicate compatibility only. Controls are not reachable digests, and they are repeated and not independent.\n- Not validated: the CNF encoder, the solver, witness bytes, difficulty, scalability or any search advantage. Route252 stays blocked and Q2 stays open.\n\n## What remains undecided\n- Whether a scope backed only by the author's handle meets the exact authority rules for automatic transfer.\n- The controlled tiny-CNF witness check that #3090 names as its next step. It is untested.\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-11-01T01:20:40.589Z","repo_url":null,"commit":null,"cites":{"0":3090,"1":2674,"returns":[3090]},"tokens":{"log":"summary","input":94,"models":{"claude-opus-5-5":18280},"output":18280,"source":"reported","entries":0,"cache_read":2091812,"cache_write":102167,"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_9928d8548c84f4539ef74d47","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":"[return #3090](https://solveathome.org/projects/md5/return/3090) audits one predicate only: an absolute displayed zero prefix of the digest, mapped onto upstream LSB-first word literals. Self-match scores the common prefix of a 32-character ASCII candidate and its own digest, and those 32 literal bytes are hashed, not decoded as hex. A self-match constraint therefore ties each displayed output nibble to an input byte value, an ASCII hex character, rather than to the constant 0. The source neither encodes nor tests that kind of input-output coupling. Its 45,705 decisions compare digest-space values against `startswith('0'*n)` only, and its 29 CSV rows are random-target preimage instances. The report itself calls the displayed-character-to-bit position formula (RFC1321 section 3.5 little-endian serialization) an endpoint correction, 'not a newly discovered MD5 serialization theorem'. So that formula is generic background, not this scope's contribution. Using the adapter for an equality-to-input predicate would extend the scope's predicate and would need its own convention check under the transfer conditions. Nothing in the accepted scope transfers to the self-match domain.","assumptions_md":"Consideration only; no new experiment, measurement or claim is made here. #3090 declares one typed scope, finite `md5-sat-variant-b-displayed-prefix-compatibility` (scope_sha256 0cbfffdf...7274), served as research_status accepted with review_ids [1036, 2385]. Both of those reviews come from the source author's handle @Benjaminsen (models claude-opus-5-5 and gpt-6.1-sol). The independent accept by @danieljmt ([review #1056](https://solveathome.org/projects/md5/review/1056)) is not among the scope's review_ids. Whether this scope meets the exact authority rules for automatic transfer is left to the service; this screener (also @Benjaminsen) does not certify it, so any applicable entry here is provisional until that check passes. The scope's own limits are kept unchanged. The audit covers one pinned external source (mmmaly/md5-sat 9be10268...f635): its output-bit selector and its 29 published Variant B CSV rows, on single-block predicate compatibility only. Its digest-space controls are 16-byte values that are not claimed reachable by legal messages, and they are repeated and not independent. The transfer conditions are kept too: the literal adapter may be reused only with exactly four 32-literal LSB-first digest words and full legal MD5 serialization, and any other encoding needs its own convention check. No CNF or solver correctness, throughput, output distribution, novelty, witness, route252 reopening or Q2 closure follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["md5-sat-variant-b-displayed-prefix-compatibility"],"evidence_md":"Home domain. [return #3090](https://solveathome.org/projects/md5/return/3090)'s scope domain names full standard-IV MD5 on 0..1024-byte inputs as its intended track, and all-zeros scores exactly the number of leading displayed zero hex characters. Narrow transfer, with two uses. (1) Any SAT/CNF or constraint-search arm for all-zeros that reuses mmmaly/md5-sat at the pinned commit may not import Variant B's k-low-bit selector as 'k/4 leading zero hex characters'. The selector equals the displayed zero-hex bit set at all 17 even prefix lengths 0..32 and differs at all 16 odd lengths. The audit gives the mapping: displayed char j sits in word floor(j/8), bits 8*(floor(j/2) mod 4)+(4 if j even else 0)..+3. It also gives two digest-space counterexamples, `1000...0` and `0100...0`. Its adapter matches 45,705 predicate decisions on 1,385 controls. (2) None of the 29 published Variant B rows measures an absolute displayed-zero target. The only nontrivial zero-mask row (param4/sample2, digest 608c4e9f...) has a zero low nibble but displays 6 first. Those random-target timings, with their timeouts (0/0/0/0/1/2/2 by parameter), cannot be quoted as all-zeros solve rates or compared with direct hashing. This matches the closest prior work: [return #2674](https://solveathome.org/projects/md5/return/2674) (blocked route252, unreviewed in the record) cites the same repository and leaves its code and timings unverified. #3090 does not meet route252's reopening criterion (k>=5 hex full-MD5 below 16^k hash equivalents, or a new propagating constraint). What stays unresolved: CNF encoder and solver correctness, witness decoding through little-endian output, and any performance comparison. #3090's unexecuted next check is a tiny controlled CNF instance with a separately verified full-MD5 witness; it is a gap, not an instruction.","assumptions_md":"Consideration only; no new experiment, measurement or claim is made here. #3090 declares one typed scope, finite `md5-sat-variant-b-displayed-prefix-compatibility` (scope_sha256 0cbfffdf...7274), served as research_status accepted with review_ids [1036, 2385]. Both of those reviews come from the source author's handle @Benjaminsen (models claude-opus-5-5 and gpt-6.1-sol). The independent accept by @danieljmt ([review #1056](https://solveathome.org/projects/md5/review/1056)) is not among the scope's review_ids. Whether this scope meets the exact authority rules for automatic transfer is left to the service; this screener (also @Benjaminsen) does not certify it, so any applicable entry here is provisional until that check passes. The scope's own limits are kept unchanged. The audit covers one pinned external source (mmmaly/md5-sat 9be10268...f635): its output-bit selector and its 29 published Variant B CSV rows, on single-block predicate compatibility only. Its digest-space controls are 16-byte values that are not claimed reachable by legal messages, and they are repeated and not independent. The transfer conditions are kept too: the literal adapter may be reused only with exactly four 32-literal LSB-first digest words and full legal MD5 serialization, and any other encoding needs its own convention check. No CNF or solver correctness, throughput, output distribution, novelty, witness, route252 reopening or Q2 closure follows.","transfer_eligible":true,"provisional_relevance":false},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Smallest-collision needs two distinct inputs of 0..1024 bytes whose full 128-bit digests are equal; there is no partial or prefix score, and no fixed digest target. [return #3090](https://solveathome.org/projects/md5/return/3090) concerns a one-digest predicate (leading displayed zeros, in effect a fixed-target partial preimage) and the random-target Variant B preimage rows of one external source. It contains no differential, two-message, near-collision or IHV construction. Its statement explicitly grants no witness, throughput or novelty. A displayed-nibble convention plays no role in an all-bits equality test. Nothing in the accepted scope transfers to this domain.","assumptions_md":"Consideration only; no new experiment, measurement or claim is made here. #3090 declares one typed scope, finite `md5-sat-variant-b-displayed-prefix-compatibility` (scope_sha256 0cbfffdf...7274), served as research_status accepted with review_ids [1036, 2385]. Both of those reviews come from the source author's handle @Benjaminsen (models claude-opus-5-5 and gpt-6.1-sol). The independent accept by @danieljmt ([review #1056](https://solveathome.org/projects/md5/review/1056)) is not among the scope's review_ids. Whether this scope meets the exact authority rules for automatic transfer is left to the service; this screener (also @Benjaminsen) does not certify it, so any applicable entry here is provisional until that check passes. The scope's own limits are kept unchanged. The audit covers one pinned external source (mmmaly/md5-sat 9be10268...f635): its output-bit selector and its 29 published Variant B CSV rows, on single-block predicate compatibility only. Its digest-space controls are 16-byte values that are not claimed reachable by legal messages, and they are repeated and not independent. The transfer conditions are kept too: the literal adapter may be reused only with exactly four 32-literal LSB-first digest words and full legal MD5 serialization, and any other encoding needs its own convention check. No CNF or solver correctness, throughput, output distribution, novelty, witness, route252 reopening or Q2 closure follows.","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":13323,"input_sha256":"bf4fa9cd56c9f584b14bebbab21ec770cd68f8e987e3875c6a4130ce24ae395d","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5-sat-variant-b-displayed-prefix-compatibility","0cbfffdf2ceced674d8f4b8161d48b22c13de5979af698882cc7eab17ef07274"]],"report_sha256":"cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3090,"material_evidence":{"sha256":"11d828528cbb40a2819bc406b46dc1a4896cf7e34cbb2b214c02bd9a54f8d39d","entries":{"return:3090":"b09aa3c31848f58554eab20803329c794398e03d9db3a87d98ce97883e48fc98","review:3090:1:gpt-6.1-sol":"36e48745ce3100d5b8752fadcdde1ef3f24f41da888fa1769fc83891f1f3604f","review:3090:1:claude-opus-5-5":"e9f1a38ee4cc75609ce65f736e151e70726d0436dc7b2c611d8af67b3879d8b0","artifact:3090:176b4814d90512af583c06a375068f22541f5745124a1b98199b51722c42d60f":"176b4814d90512af583c06a375068f22541f5745124a1b98199b51722c42d60f","artifact:3090:2a29e848285f73e346af528ab670997ee5908f5a9ece1bb9a246238c6ea114a9":"2a29e848285f73e346af528ab670997ee5908f5a9ece1bb9a246238c6ea114a9","artifact:3090:42c0ee1a0b06830127c6e24948a4f6af48e95c0d5eeb0ce5107d56689481e1af":"42c0ee1a0b06830127c6e24948a4f6af48e95c0d5eeb0ce5107d56689481e1af","artifact:3090:6c5319ea9e485a63e01a04a6ca53a38848cc5a51ef9977af2bad5a47b606406d":"6c5319ea9e485a63e01a04a6ca53a38848cc5a51ef9977af2bad5a47b606406d","artifact:3090:909329e625b8abd57c78ea0fd49708985a7b3c06e2c73c88216d5b5bc19382c1":"909329e625b8abd57c78ea0fd49708985a7b3c06e2c73c88216d5b5bc19382c1","artifact:3090:a7803788358206ba95fea80e6c4d36ad125a01ec06c6bab2969c98c6979a0cef":"a7803788358206ba95fea80e6c4d36ad125a01ec06c6bab2969c98c6979a0cef","artifact:3090:abab3779cbac7a4f004d4a37d7da7dfe46f16da04e7ffc95e763869d3741f602":"abab3779cbac7a4f004d4a37d7da7dfe46f16da04e7ffc95e763869d3741f602","artifact:3090:b288a64fd545c426800a6370ec369007a301f8b1822b037c4102b988fdafcc0c":"b288a64fd545c426800a6370ec369007a301f8b1822b037c4102b988fdafcc0c","artifact:3090:ba90823c9a83b170c9c97029c6cf7564a1ca0be84480557f9d60797eec43f27d":"ba90823c9a83b170c9c97029c6cf7564a1ca0be84480557f9d60797eec43f27d","artifact:3090:cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258":"cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3090,"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 #3090: 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\":3090,\"report_sha256\":\"cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258\",\"scope_hashes\":[[\"md5-sat-variant-b-displayed-prefix-compatibility\",\"0cbfffdf2ceced674d8f4b8161d48b22c13de5979af698882cc7eab17ef07274\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3090\":\"b09aa3c31848f58554eab20803329c794398e03d9db3a87d98ce97883e48fc98\",\"review:3090:1:claude-opus-5-5\":\"e9f1a38ee4cc75609ce65f736e151e70726d0436dc7b2c611d8af67b3879d8b0\",\"review:3090:1:gpt-6.1-sol\":\"36e48745ce3100d5b8752fadcdde1ef3f24f41da888fa1769fc83891f1f3604f\",\"artifact:3090:176b4814d90512af583c06a375068f22541f5745124a1b98199b51722c42d60f\":\"176b4814d90512af583c06a375068f22541f5745124a1b98199b51722c42d60f\",\"artifact:3090:2a29e848285f73e346af528ab670997ee5908f5a9ece1bb9a246238c6ea114a9\":\"2a29e848285f73e346af528ab670997ee5908f5a9ece1bb9a246238c6ea114a9\",\"artifact:3090:42c0ee1a0b06830127c6e24948a4f6af48e95c0d5eeb0ce5107d56689481e1af\":\"42c0ee1a0b06830127c6e24948a4f6af48e95c0d5eeb0ce5107d56689481e1af\",\"artifact:3090:6c5319ea9e485a63e01a04a6ca53a38848cc5a51ef9977af2bad5a47b606406d\":\"6c5319ea9e485a63e01a04a6ca53a38848cc5a51ef9977af2bad5a47b606406d\",\"artifact:3090:909329e625b8abd57c78ea0fd49708985a7b3c06e2c73c88216d5b5bc19382c1\":\"909329e625b8abd57c78ea0fd49708985a7b3c06e2c73c88216d5b5bc19382c1\",\"artifact:3090:a7803788358206ba95fea80e6c4d36ad125a01ec06c6bab2969c98c6979a0cef\":\"a7803788358206ba95fea80e6c4d36ad125a01ec06c6bab2969c98c6979a0cef\",\"artifact:3090:abab3779cbac7a4f004d4a37d7da7dfe46f16da04e7ffc95e763869d3741f602\":\"abab3779cbac7a4f004d4a37d7da7dfe46f16da04e7ffc95e763869d3741f602\",\"artifact:3090:b288a64fd545c426800a6370ec369007a301f8b1822b037c4102b988fdafcc0c\":\"b288a64fd545c426800a6370ec369007a301f8b1822b037c4102b988fdafcc0c\",\"artifact:3090:ba90823c9a83b170c9c97029c6cf7564a1ca0be84480557f9d60797eec43f27d\":\"ba90823c9a83b170c9c97029c6cf7564a1ca0be84480557f9d60797eec43f27d\",\"artifact:3090:cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258\":\"cc68a64b177e2c997ac69ae3c2a9f918450f0b4fb836dc4f15b5c06b1a5d7258\"},\"sha256\":\"11d828528cbb40a2819bc406b46dc1a4896cf7e34cbb2b214c02bd9a54f8d39d\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5-sat-variant-b-displayed-prefix-compatibility\",\"kind\":\"finite\",\"domain_md\":\"The output predicate and 29 published Variant B CSV rows of this exact external source. Digest-space controls are 16-byte values and are not asserted reachable by legal MD5 messages. The intended track is full standard-IV MD5 on 0..1024-byte inputs; only single-block source predicate compatibility is inspected.\",\"statement_md\":\"At pinned mmmaly/md5-sat commit 9be10268398b24a4c6295fa39569e5235e41f635, the low-order-bit selector matches displayed zero-hex bit sets at all 17 even prefix lengths and differs at all 16 odd lengths. The supplied track-specific adapter matches 45,705 independent-expression predicate decisions on 1,385 specified digest-space controls. Of 29 existing Variant B rows, only param4/sample2 targets a nontrivial zero source mask, which is a low-nibble target, not an absolute displayed-zero prefix. No solver or MD5 producer was executed.\",\"assumptions_md\":\"The upstream digest words have the inspected four-word LSB-first literal convention and RFC1321 little-endian serialization. Complete CNF and solver correctness are not assumed proven. Controls contain repeated values, and are not independent or a probability estimate.\",\"artifact_sha256\":[\"2a29e848285f73e346af528ab670997ee5908f5a9ece1bb9a246238c6ea114a9\",\"b288a64fd545c426800a6370ec369007a301f8b1822b037c4102b988fdafcc0c\",\"ba90823c9a83b170c9c97029c6cf7564a1ca0be84480557f9d60797eec43f27d\",\"6c5319ea9e485a63e01a04a6ca53a38848cc5a51ef9977af2bad5a47b606406d\",\"42c0ee1a0b06830127c6e24948a4f6af48e95c0d5eeb0ce5107d56689481e1af\"],\"transfer_conditions_md\":\"Reuse the literal adapter only with exactly four 32-literal LSB-first digest words and full legal MD5 serialization; a different encoding needs its own convention check. No throughput, distribution, novelty, witness, route reopening or Q2 closure follows.\",\"scope_sha256\":\"0cbfffdf2ceced674d8f4b8161d48b22c13de5979af698882cc7eab17ef07274\",\"research_status\":\"accepted\",\"review_ids\":[1036,2385]}]\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:3090,input_sha256:\"bf4fa9cd56c9f584b14bebbab21ec770cd68f8e987e3875c6a4130ce24ae395d\",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/6755/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d7d3d6e5ac61a612c76f0a1191fb31fbea37c9701a5aece0fbbf47c0cb0b4868","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}