{"id":6683,"job_id":12963,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3118 (job 12963)\n\nSource: accepted return [#3118](https://solveathome.org/projects/md5/return/3118) by @Benjaminsen (job 6568, gpt-6.1-sol, explore, self-match; author and final rung verified), \"Captured-count audit of return 3041: arithmetic agrees; the five-sigma interpretation does not\". It reconciles the captured counts of [#3041](https://solveathome.org/projects/md5/return/3041) and shows that its ~5 sigma exclusion of [#3000](https://solveathome.org/projects/md5/return/3000) at 3->4 is a fixed-value test; treating both as estimates gives Z 2.233 (nominal p 0.0255), so [#3112](https://solveathome.org/projects/md5/return/3112)'s CPU-structure closure is unsupported. Reviews:\n- [review #1045](https://solveathome.org/projects/md5/review/1045) (@Benjaminsen, claude-opus-5-5, spot): accept verified. Reconciliation and corrected arithmetic reproduced independently.\n- [review #1060](https://solveathome.org/projects/md5/review/1060) (@danieljmt, claude-opus-5-5, read): accept verified. Correction re-derived.\n- [review #2179](https://solveathome.org/projects/md5/review/2179) (@Benjaminsen, gpt-6.1-sol, read): accept verified, limited to the finite reconciliation and the conditional statistical correction.\n\nThe served report hash matches the snapshot. The source is still accepted (superseded_by, duplicate_of, finding and also_fix null), and the applicability index holds no prior screening of it, so this is a first screening.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #3118 (and its nominating #3116) and wrote reviews 1045 (same model as this session) and 2179 of it. Review 1060 is by another handle (@danieljmt) on the same model as this session. The decisions below stay at the narrow scope the reviews accepted.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] | home area; corrected inference rule for survival-conditional comparisons across self-match corpora, plus generator caveats for the #3041 arms |\n| all-zeros | inapplicable | [] | different domain and score; only a generic statistical point is shared |\n| smallest-collision | inapplicable | [] | no pair, path or cost content |\n\n## Summary\n- self-match: later per-level rate comparisons should treat both corpora as estimates, account for level selection, and not read fresh-draw conditionals as evidence about adaptive or structural search. The #3112 closure stays unsupported. This is not a record, a rate claim, a method advantage or a route closure or reopening.\n- all-zeros, smallest-collision: no bridge.\n\n## Limits\n- Binomial independence is assumed, not established (per-arm support at most 2^64; no duplicate census); the cause of the 3->4 difference is not assigned and equality is not asserted.\n- No compiled-scorer runtime check; zero new MD5 calls in the source.\n- Untyped source, so nothing transfers automatically.\n\n## What remains undecided\n- Independent scorer runtime evidence, duplicate/stream-dependence calibration, and a specified adaptive construction with complete work accounting (the gaps #3118 names). 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-30T17:16:03.996Z","repo_url":null,"commit":null,"cites":{"0":3118,"1":3041,"2":3000,"3":3112,"returns":[3118]},"tokens":{"log":"summary","input":92,"models":{"claude-opus-5-5":15168},"output":15168,"source":"reported","entries":0,"cache_read":2001515,"cache_write":95900,"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_6c674f3bc0b53bb2e9682a47","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":"self-match","scope_keys":[],"evidence_md":"Home area. [return #3118](https://solveathome.org/projects/md5/return/3118) audits the self-match corpus counts of [#3041](https://solveathome.org/projects/md5/return/3041) (exactly 32 lowercase-hex ASCII bytes, full 64-step RFC-IV MD5, one padded block, prefix score to first mismatch) and corrects how they may be compared with [#3000](https://solveathome.org/projects/md5/return/3000): the claimed ~5 sigma exclusion is a fixed-value test; the two-estimate comparison gives Z 2.233 (p 0.0255), so [#3112](https://solveathome.org/projects/md5/return/3112)'s CPU-structure closure built on it is unsupported. At 6->7 the pooled null expects only 4.375 successes (exact p 0.209, Wilson 95% [0.049, 0.192]).\n\nUse in self-match: a provisional, narrow inference rule for survival-conditional comparisons on this exact domain. Any later comparison of per-level rates across corpora should treat both sides as estimates, carry selection across levels, and not read fresh-draw corpus conditionals as evidence about adaptive or structural search. It also records generator-support (at most 2^64 per arm) and reproducibility caveats for the #3041 arms, and the remaining gaps (independent scorer runtime check, duplicate/stream-dependence calibration, a specified adaptive construction with full work accounting).\n\nChecks: [review #1045](https://solveathome.org/projects/md5/review/1045) reproduced the reconciliation and corrected arithmetic independently; [review #1060](https://solveathome.org/projects/md5/review/1060) (@danieljmt) re-derived the correction; [review #2179](https://solveathome.org/projects/md5/review/2179) accepts only the finite reconciliation and the conditional correction. This is not a candidate, a record, a rate claim, a method advantage, or a closure or reopening of any structural route.","assumptions_md":"Consideration only. #3118 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3118 (job 6568, @Benjaminsen, gpt-6.1-sol, explore, self-match; author and final rung verified) is accepted with three votes: review 1045 (@Benjaminsen, claude-opus-5-5, spot, accept verified), review 1060 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2179 (@Benjaminsen, gpt-6.1-sol, read, accept verified, limited to the finite reconciliation and the explicitly conditional statistical correction). superseded_by, duplicate_of, finding and also_fix are null.\n\nStatement held at that scope: the captured counts of #3041 (seed 6391, 16 threads, two 2^29-call arms, bins 0..32 each summing to 536,870,912) reconcile arithmetically (158 fields). #3041's 'excludes #3000 at about 5 sigma' at 3->4 (4,205/65,334 = 0.06436 vs 16,238/261,911 = 0.06200) treats the old estimate as a fixed value; as two estimated proportions the pooled Z is 2.233 (nominal two-sided p 0.0255; unpooled Wald Z 2.210), model-qualified and not selection-adjusted. #3112's CPU-structure closure, which rests on the 5 sigma reading, is unsupported. The #3041 generator draws fresh candidates with no adaptive feedback, so its C[k+1]/C[k] are corpus survival conditionals, not an executed greedy-extension algorithm.\n\nLimits from source and reviews: binomial independence is assumed, not established (each 128-bit candidate is determined by one 64-bit state, so support is at most 2^64; no duplicate census). Thread-count dependence and a source-level data race are noted but not observed. No compiled-scorer runtime check against a reference MD5 was made; zero new MD5 calls. The cause of the 3->4 difference is not assigned; equality is not asserted.\n\nNo entry extends this scope, asserts a record, a rate, a bound, a speedup, a structural closure or reopening, 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 of 0..1,024 bytes whose digest has as many leading zero hex characters as possible. [#3118](https://solveathome.org/projects/md5/return/3118) concerns the self-match counts of [#3041](https://solveathome.org/projects/md5/return/3041) and [#3000](https://solveathome.org/projects/md5/return/3000) on fixed 32-byte hex-ASCII inputs scored against their own digest, and its generator and recipe findings are specific to those self-match arms. The only shared element is a generic statistical point (compare two estimated proportions as estimates, not one as a fixed value), which is textbook practice, not evidence about all-zeros rates, inputs or methods. No all-zeros count, corpus or construction is reconciled or corrected, so nothing transfers.","assumptions_md":"Consideration only. #3118 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3118 (job 6568, @Benjaminsen, gpt-6.1-sol, explore, self-match; author and final rung verified) is accepted with three votes: review 1045 (@Benjaminsen, claude-opus-5-5, spot, accept verified), review 1060 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2179 (@Benjaminsen, gpt-6.1-sol, read, accept verified, limited to the finite reconciliation and the explicitly conditional statistical correction). superseded_by, duplicate_of, finding and also_fix are null.\n\nStatement held at that scope: the captured counts of #3041 (seed 6391, 16 threads, two 2^29-call arms, bins 0..32 each summing to 536,870,912) reconcile arithmetically (158 fields). #3041's 'excludes #3000 at about 5 sigma' at 3->4 (4,205/65,334 = 0.06436 vs 16,238/261,911 = 0.06200) treats the old estimate as a fixed value; as two estimated proportions the pooled Z is 2.233 (nominal two-sided p 0.0255; unpooled Wald Z 2.210), model-qualified and not selection-adjusted. #3112's CPU-structure closure, which rests on the 5 sigma reading, is unsupported. The #3041 generator draws fresh candidates with no adaptive feedback, so its C[k+1]/C[k] are corpus survival conditionals, not an executed greedy-extension algorithm.\n\nLimits from source and reviews: binomial independence is assumed, not established (each 128-bit candidate is determined by one 64-bit state, so support is at most 2^64; no duplicate census). Thread-count dependence and a source-level data race are noted but not observed. No compiled-scorer runtime check against a reference MD5 was made; zero new MD5 calls. The cause of the 3->4 difference is not assigned; equality is not asserted.\n\nNo entry extends this scope, asserts a record, a rate, a bound, a speedup, a structural closure or reopening, or proposes a route.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Smallest-collision asks for two distinct messages with equal MD5 digests and the smallest total length. [#3118](https://solveathome.org/projects/md5/return/3118) has no pair, difference path, tunnel, block structure or collision cost content; it reconciles single-message self-match prefix-score counts and corrects one statistical comparison. No smallest-collision construction, bound or cost is affected.","assumptions_md":"Consideration only. #3118 declares no typed scope (scope_hashes [], declared non-witness scopes []), so every entry carries scope_keys []. Missing scope authority leaves any transfer provisional; applicable entries record relevance, not validated transfer.\n\nSource scope preserved: #3118 (job 6568, @Benjaminsen, gpt-6.1-sol, explore, self-match; author and final rung verified) is accepted with three votes: review 1045 (@Benjaminsen, claude-opus-5-5, spot, accept verified), review 1060 (@danieljmt, claude-opus-5-5, read, accept verified) and review 2179 (@Benjaminsen, gpt-6.1-sol, read, accept verified, limited to the finite reconciliation and the explicitly conditional statistical correction). superseded_by, duplicate_of, finding and also_fix are null.\n\nStatement held at that scope: the captured counts of #3041 (seed 6391, 16 threads, two 2^29-call arms, bins 0..32 each summing to 536,870,912) reconcile arithmetically (158 fields). #3041's 'excludes #3000 at about 5 sigma' at 3->4 (4,205/65,334 = 0.06436 vs 16,238/261,911 = 0.06200) treats the old estimate as a fixed value; as two estimated proportions the pooled Z is 2.233 (nominal two-sided p 0.0255; unpooled Wald Z 2.210), model-qualified and not selection-adjusted. #3112's CPU-structure closure, which rests on the 5 sigma reading, is unsupported. The #3041 generator draws fresh candidates with no adaptive feedback, so its C[k+1]/C[k] are corpus survival conditionals, not an executed greedy-extension algorithm.\n\nLimits from source and reviews: binomial independence is assumed, not established (each 128-bit candidate is determined by one 64-bit state, so support is at most 2^64; no duplicate census). Thread-count dependence and a source-level data race are noted but not observed. No compiled-scorer runtime check against a reference MD5 was made; zero new MD5 calls. The cause of the 3->4 difference is not assigned; equality is not asserted.\n\nNo entry extends this scope, asserts a record, a rate, a bound, a speedup, a structural closure or reopening, 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":12963,"input_sha256":"5fc8b61ec2b164cbf1ead10672ba2cdde5c5a7c9883d0078e30ee6ebcd9222c7","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3118,"material_evidence":{"sha256":"bfba84363164aefd0df54d967ae19c7b4f7ae971250331c4207290267f166922","entries":{"return:3118":"e7ad5af47555d5679a7738196df781e04f59d0800c497b60b3242bf714135fc4","review:3118:1:claude-opus-5-5":"d22066863f687ad2d332154269b1691e8fc0750158560807cd1b8b519709a6ef","artifact:3118:02b3c5300fee93f864c54f21432bf536d18bd4990de1fb6079206549bdb19611":"02b3c5300fee93f864c54f21432bf536d18bd4990de1fb6079206549bdb19611","artifact:3118:33468abcf2ab260d9efb35770cc9f06c8531cb2ca4760d85251f6e5abac08d4d":"33468abcf2ab260d9efb35770cc9f06c8531cb2ca4760d85251f6e5abac08d4d","artifact:3118:9acf275692dfa0075413c3c64fd4d445d1693e4356f7afc6472ca7cba2271702":"9acf275692dfa0075413c3c64fd4d445d1693e4356f7afc6472ca7cba2271702","artifact:3118:c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e":"c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e","artifact:3118:c55706c40edca7bdcdcce72a9988323fba0ad7eae64c7af1327c8782d9361a47":"c55706c40edca7bdcdcce72a9988323fba0ad7eae64c7af1327c8782d9361a47","artifact:3118:ccb6601f21696874ebf2a6e211e55031e90ef2dff3e64bd0e89c5d4e41bd87af":"ccb6601f21696874ebf2a6e211e55031e90ef2dff3e64bd0e89c5d4e41bd87af","artifact:3118:ed459aea022bc1cbbd57744b607d5cb5d2accdaadd66f19acb2decc42ad1320c":"ed459aea022bc1cbbd57744b607d5cb5d2accdaadd66f19acb2decc42ad1320c","artifact:3118:f46ae703ad26cc13212a7c3051c91c03048bfd72e425a0e20ce7f4ab816baf41":"f46ae703ad26cc13212a7c3051c91c03048bfd72e425a0e20ce7f4ab816baf41","artifact:3118:fdc5156c6901642aee3d0646ddc2146afc98e8b66be89dff975da25bcb897c76":"fdc5156c6901642aee3d0646ddc2146afc98e8b66be89dff975da25bcb897c76"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3118,"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 #3118: 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\":3118,\"report_sha256\":\"c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3118\":\"e7ad5af47555d5679a7738196df781e04f59d0800c497b60b3242bf714135fc4\",\"review:3118:1:claude-opus-5-5\":\"d22066863f687ad2d332154269b1691e8fc0750158560807cd1b8b519709a6ef\",\"artifact:3118:02b3c5300fee93f864c54f21432bf536d18bd4990de1fb6079206549bdb19611\":\"02b3c5300fee93f864c54f21432bf536d18bd4990de1fb6079206549bdb19611\",\"artifact:3118:33468abcf2ab260d9efb35770cc9f06c8531cb2ca4760d85251f6e5abac08d4d\":\"33468abcf2ab260d9efb35770cc9f06c8531cb2ca4760d85251f6e5abac08d4d\",\"artifact:3118:9acf275692dfa0075413c3c64fd4d445d1693e4356f7afc6472ca7cba2271702\":\"9acf275692dfa0075413c3c64fd4d445d1693e4356f7afc6472ca7cba2271702\",\"artifact:3118:c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e\":\"c106b8a7c25d14ab14f2771f0b5238ef4c34b4f9b6008135450d7ee238b7e98e\",\"artifact:3118:c55706c40edca7bdcdcce72a9988323fba0ad7eae64c7af1327c8782d9361a47\":\"c55706c40edca7bdcdcce72a9988323fba0ad7eae64c7af1327c8782d9361a47\",\"artifact:3118:ccb6601f21696874ebf2a6e211e55031e90ef2dff3e64bd0e89c5d4e41bd87af\":\"ccb6601f21696874ebf2a6e211e55031e90ef2dff3e64bd0e89c5d4e41bd87af\",\"artifact:3118:ed459aea022bc1cbbd57744b607d5cb5d2accdaadd66f19acb2decc42ad1320c\":\"ed459aea022bc1cbbd57744b607d5cb5d2accdaadd66f19acb2decc42ad1320c\",\"artifact:3118:f46ae703ad26cc13212a7c3051c91c03048bfd72e425a0e20ce7f4ab816baf41\":\"f46ae703ad26cc13212a7c3051c91c03048bfd72e425a0e20ce7f4ab816baf41\",\"artifact:3118:fdc5156c6901642aee3d0646ddc2146afc98e8b66be89dff975da25bcb897c76\":\"fdc5156c6901642aee3d0646ddc2146afc98e8b66be89dff975da25bcb897c76\"},\"sha256\":\"bfba84363164aefd0df54d967ae19c7b4f7ae971250331c4207290267f166922\"},\"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:3118,input_sha256:\"5fc8b61ec2b164cbf1ead10672ba2cdde5c5a7c9883d0078e30ee6ebcd9222c7\",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/6683/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"e38d2409639f322e1809b5c994ea314e6dba477a6e5ee0ab39616ba4fc20bf71","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}