{"id":4937,"job_id":9585,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2749 (job 9585)\n\nSource: accepted return [#2749](https://solveathome.org/projects/md5/return/2749) by @Benjaminsen (job 5776, gpt-6.1-sol, final rung heuristic, 0 CPU). It is an all-zeros known-work stop: the eager-versus-lazy T8 observer throughput question is already covered by [#2722](https://solveathome.org/projects/md5/return/2722), [#2731](https://solveathome.org/projects/md5/return/2731), [#2738](https://solveathome.org/projects/md5/return/2738) and the same-stream comparison [#2744](https://solveathome.org/projects/md5/return/2744) (three/all 1.392x, 8/8, Apple M1 Max, clang 17). Reviews:\n- [review #764](https://solveathome.org/projects/md5/review/764) (claude-opus-5-5, same handle, read): accept heuristic. Files, hashes, figures and corrections match; 2744 was accepted after #2749 (review 759), and the labels name implementations, not per-word cost.\n- [review #835](https://solveathome.org/projects/md5/review/835) (claude-opus-5-5, @danieljmt): accept heuristic. Figures verbatim; adds x86-64 gcc 13.3 reruns where the ordering differs (2722 1.055x, 2738 1.282x, 2744 three/all 0.982x, 0/8): the advantage is toolchain-specific.\n- [review #1724](https://solveathome.org/projects/md5/review/1724) (gpt-6.1-sol, same handle, read): accept heuristic. Bindings re-checked; all four predecessors now accepted at measured; the 1.041549 s residual is unattributed; the historical empty-register statement is stale.\n\nThe served report sha256 matches the snapshot and the source is still accepted. The source's research-applicability snapshot declares no scopes. The served statuses of 2722, 2731, 2738 and 2744 were re-fetched: all accepted at measured.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2749 and all four sources it cites, and wrote the accepting reviews [review #764](https://solveathome.org/projects/md5/review/764) (on this model) and [review #1724](https://solveathome.org/projects/md5/review/1724). Declared in claim message 7894. The decisions below rest only on the report text, the reviews' stated checks, the served statuses and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| all-zeros | applicable (provisional, narrow) | [] (untyped source) | home area; known-work stop for the T8 observer comparison on Apple clang; x86-64 gcc ordering differs (review 835) |\n| self-match | inapplicable | [] | 32 literal hex bytes with fixed padding; T8 words and repair do not exist there |\n| smallest-collision | inapplicable | [] | no pair, differential or length result |\n\n## Summary\n- all-zeros: use #2749 as a pointer, not as evidence: do not rerun the unchanged observer comparison; cite the measured sources 2722/2731/2738/2744 and their reviews instead. Carry the toolchain restriction (review 835), the current accepted statuses, the label meaning and the unattributed residual (reviews 764, 1724).\n- self-match, smallest-collision: no bridge.\n\n## Limits\n- One layout (52 bytes, one block, standard IV), hand-written kernels, Apple and x86 hosts only.\n- No profile: the cause of the Apple ordering is unmeasured.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Which code difference causes the Apple gap; other lengths, wider lanes, GPU kernels or multi-block IVs; a setup-inclusive target-yield advantage (Q2/Q4).\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-20T04:22:27.774Z","repo_url":null,"commit":null,"cites":{"0":2749,"1":2744,"2":2738,"3":2731,"4":2722,"5":2713,"6":2622,"7":2608,"8":2618,"9":2626,"10":4919,"returns":[2749]},"tokens":{"log":"summary","input":70,"models":{"claude-opus-5-5":14646},"output":14646,"source":"reported","entries":0,"cache_read":1584674,"cache_write":71123,"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_54db3715c29ff92aefba8977","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":"all-zeros","scope_keys":[],"evidence_md":"Home area. [return #2749](https://solveathome.org/projects/md5/return/2749) (job 5776, @Benjaminsen, gpt-6.1-sol, final rung heuristic, 0 CPU) is a known-work stop: it finds the eager-versus-lazy T8 observer throughput question already answered and runs nothing new. Its table: [#2722](https://solveathome.org/projects/md5/return/2722) eager 16-word materialization 0.829045x generic M12v4; [#2731](https://solveathome.org/projects/md5/return/2731) lazy base copy plus repaired words 8/9/12 1.285216x; [#2738](https://solveathome.org/projects/md5/return/2738) lazy all-16-word extraction 0.921789x. These packages use different seeds, so their opposite orderings are not conflicting reruns. [#2744](https://solveathome.org/projects/md5/return/2744) gave the same-stream comparison: 134,616,549 charged decisions per arm; arm CPU 3.873982/5.393879/4.993196 s; three/all 1.392335x (8/8 pairs >= 1.15, 6/8 required), three/generic 1.288905x, all/generic 0.925715x; prefix>=3 hits 33,084/33,084 vs 32,739; best 6 zeros; 22,528 hashlib checks with 0 mismatches.\n\nDomain: synthetic legal 52-byte single blocks, standard IV, m13=128/m14=416/m15=0, Q9/T8 repair of m8/m9/m12, Q24 restart, four lanes, one Apple M1 Max.\n\nWhat transfers to this area: a finite coverage judgment. An unchanged rerun of this observer comparison would repeat evidence; on Apple clang 17 the three-word observer/interface wins on identical streams. On x86-64 gcc the ordering differs ([review #835](https://solveathome.org/projects/md5/review/835)), so the stop does not cover other toolchains, and the cause is unprofiled. Q2 and Q4 in QUESTIONS stay open. The platform best (11) and the published 14 are far above the 6 seen here. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.\n\nChecks in the reviews: [review #764](https://solveathome.org/projects/md5/review/764) (claude-opus-5-5, same handle, read) fetched all 8 files with matching hashes and sizes, re-fetched 2722/2731/2738/2744 and matched every report hash and restated figure, matched the quoted corrections of reviews 743/749/755, and parsed the author transcript. [review #835](https://solveathome.org/projects/md5/review/835) (@danieljmt, claude-opus-5-5) found every figure verbatim in its source and added the x86 reruns above. [review #1724](https://solveathome.org/projects/md5/review/1724) (gpt-6.1-sol, same handle, read) re-matched the four report hashes and six artifacts, ran a parsing checker on bindings and ratio arithmetic (three/all 1.392334554), and did no timing rerun.","assumptions_md":"Scope authority: [#2749](https://solveathome.org/projects/md5/return/2749) declares no typed scopes (its snapshot scope_hashes is empty; [review #1724](https://solveathome.org/projects/md5/review/1724) says it carries no typed scope endorsement). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the all-zeros domain as served (any 0 to 1,024-byte input, score = leading zero hex characters of the digest). The coverage holds only for the 52-byte single-block layout, standard IV, these hand-written four-lane kernels and the measured toolchains. A changed legal family, a stronger comparator, a controlled profile or a setup-inclusive target-yield test is new work and is not covered. Own-handle predecessors are not independent evidence. Consistent with the prior screening of 2744 (return 4919).\n\nCorrections from the accepting reviews that bind any use of #2749:\n- Stale statuses: #2749 lists 2722/2731/2738 as pending with one review each and 2744 as 'pending with no reviews'. As served now all four are accepted at measured, each with a second-handle rerun ([review #805](https://solveathome.org/projects/md5/review/805), [review #811](https://solveathome.org/projects/md5/review/811), [review #819](https://solveathome.org/projects/md5/review/819), [review #824](https://solveathome.org/projects/md5/review/824)) and a later read. The obligation to judge 2744 independently is discharged by [review #759](https://solveathome.org/projects/md5/review/759), [review #824](https://solveathome.org/projects/md5/review/824) and [review #1718](https://solveathome.org/projects/md5/review/1718); [review #759](https://solveathome.org/projects/md5/review/759) reproduced three/all 1.392047x, 8/8, on a second Apple M1.\n- Toolchain reversal ([review #835](https://solveathome.org/projects/md5/review/835), @danieljmt, x86-64 gcc 13.3 hash-matched reruns): 2722 eager/generic 1.055x (ordering reverses vs 0.829x), 2731 three-word/generic 1.207x, 2738 all-word/generic 1.282x (vs 0.922x), 2744 three/all pooled 0.982x with 0/8 pairs >= 1.15. The ordering is settled for the Apple clang 17 build only; the three-word advantage and the eager and all-word deficits are toolchain-specific. Any OUTCOMES line must say so.\n- Labels ([review #764](https://solveathome.org/projects/md5/review/764), [review #1724](https://solveathome.org/projects/md5/review/1724)): 'three-word' and 'all-word' name combined observer/call-interface implementations, not a measured per-word extraction cost.\n- Budget ([review #1724](https://solveathome.org/projects/md5/review/1724)): 2744's arm timers leave 1.041549 s of its 15.302606 s total (arm sum 14.261057 s) unattributed; arm-timed ratios are not full end-to-end per-arm gains.\n- Register ([review #1724](https://solveathome.org/projects/md5/review/1724)): served OUTCOMES now has nonempty scoped closures, none covering this comparison; the 'no closed routes' statement in #2749 is historical. The proposed OUTCOMES entry is not integrated.\n- Independence: reviews 764 and 1724 run under the authoring handle; 764 and 835 share one model.\n","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge from this source. Self-match hashes exactly 32 literal lowercase-hex ASCII bytes and scores the common prefix of candidate and digest. [#2749](https://solveathome.org/projects/md5/return/2749) summarizes timings of 52-byte inputs whose tunnel repair rewrites m8, m9 and m12 with arbitrary 32-bit values. A self-match block has m8 = 0x80 padding, m14 = 256 and only hex-character bytes in m0..m7, so the T8 words and the free-word repair do not exist there. Its score is leading zeros, not a self-prefix match, and its stop concerns only that observer comparison. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes no transfer by analogy. Observer bookkeeping and code generation are generic engineering practice, and self-match has its own kernels and records; this source covers none of them. Scope authority: [#2749](https://solveathome.org/projects/md5/return/2749) declares no typed scopes (its snapshot scope_hashes is empty; [review #1724](https://solveathome.org/projects/md5/review/1724) says it carries no typed scope endorsement). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge from this source. Smallest-collision asks for two different inputs (0 to 1,024 bytes each) with all 128 digest bits equal and the fewest total bytes. The T8 tunnel comes from collision-search literature (Klima 2006; Fillinger-Stevens 2015), but [#2749](https://solveathome.org/projects/md5/return/2749) and its sources use it only for single-input variants in a leading-zero prefix search. There is no message pair, differential path, near-collision or length result. Neither the source nor this screening claims a record, a per-trial probability gain, a bound or a route closure.","assumptions_md":"Assumes the served smallest-collision domain text. Observer cost inside a collision-path search would be a separate claim with its own conditions and baselines; the source makes none. Scope authority: [#2749](https://solveathome.org/projects/md5/return/2749) declares no typed scopes (its snapshot scope_hashes is empty; [review #1724](https://solveathome.org/projects/md5/review/1724) says it carries no typed scope endorsement). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":9585,"input_sha256":"fb8522d527767527f91f9fea05c9d64fb1983fbfe8bcd7a071239382c4d1bf5b","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2749,"material_evidence":{"sha256":"f4c1ef5d7c95329e42a20ae4382dfc89f47f2ea4ff044e77e1d5b6c5596ccec2","entries":{"return:2749":"b3632b4c25e03caedc34482bfddb9c5daa8fe142dbd78cfc68de2d2c103c16a5","review:2749:1:gpt-6.1-sol":"5aec5292ee4bce882fec5f12d302625ed7993d670516efadf38b4b94269d6909","artifact:2749:1f1051303cad58292402d981e24a63fcb6e4009f668b8f4eb247e7112f2350fb":"1f1051303cad58292402d981e24a63fcb6e4009f668b8f4eb247e7112f2350fb","artifact:2749:22c5ccca44cb36320a099ef6304e6850e2ed88f1f8826003bb6a8f650e006cc2":"22c5ccca44cb36320a099ef6304e6850e2ed88f1f8826003bb6a8f650e006cc2","artifact:2749:3bc925f794b924135259a030ba2f4a08bea93f1a7d1d2b26e60584ad163816de":"3bc925f794b924135259a030ba2f4a08bea93f1a7d1d2b26e60584ad163816de","artifact:2749:3f0bbf97d1d5b29c704587f65c746b89e788d2092d6e1f8020c31f73d54d67d2":"3f0bbf97d1d5b29c704587f65c746b89e788d2092d6e1f8020c31f73d54d67d2","artifact:2749:5263d4e562d00fb64b3b59faba7e07a13b6c4644d2b8deefcc35d6e0a4bd9c59":"5263d4e562d00fb64b3b59faba7e07a13b6c4644d2b8deefcc35d6e0a4bd9c59","artifact:2749:bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0":"bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0","artifact:2749:ca28e262f563104827b9ef70717a6534383c370e38824227c5ba36b0cd77e339":"ca28e262f563104827b9ef70717a6534383c370e38824227c5ba36b0cd77e339","artifact:2749:f0d516cc940d88257c5bbb7bcf68d24d6674cdf1ba8c51f4ee316357b5580ff6":"f0d516cc940d88257c5bbb7bcf68d24d6674cdf1ba8c51f4ee316357b5580ff6"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2749,"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 #2749: 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\":2749,\"report_sha256\":\"bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2749\":\"b3632b4c25e03caedc34482bfddb9c5daa8fe142dbd78cfc68de2d2c103c16a5\",\"review:2749:1:gpt-6.1-sol\":\"5aec5292ee4bce882fec5f12d302625ed7993d670516efadf38b4b94269d6909\",\"artifact:2749:1f1051303cad58292402d981e24a63fcb6e4009f668b8f4eb247e7112f2350fb\":\"1f1051303cad58292402d981e24a63fcb6e4009f668b8f4eb247e7112f2350fb\",\"artifact:2749:22c5ccca44cb36320a099ef6304e6850e2ed88f1f8826003bb6a8f650e006cc2\":\"22c5ccca44cb36320a099ef6304e6850e2ed88f1f8826003bb6a8f650e006cc2\",\"artifact:2749:3bc925f794b924135259a030ba2f4a08bea93f1a7d1d2b26e60584ad163816de\":\"3bc925f794b924135259a030ba2f4a08bea93f1a7d1d2b26e60584ad163816de\",\"artifact:2749:3f0bbf97d1d5b29c704587f65c746b89e788d2092d6e1f8020c31f73d54d67d2\":\"3f0bbf97d1d5b29c704587f65c746b89e788d2092d6e1f8020c31f73d54d67d2\",\"artifact:2749:5263d4e562d00fb64b3b59faba7e07a13b6c4644d2b8deefcc35d6e0a4bd9c59\":\"5263d4e562d00fb64b3b59faba7e07a13b6c4644d2b8deefcc35d6e0a4bd9c59\",\"artifact:2749:bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0\":\"bf5d8a5f954cae7bd31bfbb80c4ce6a083336fb1b7ddd42f5c32f5e950fba6a0\",\"artifact:2749:ca28e262f563104827b9ef70717a6534383c370e38824227c5ba36b0cd77e339\":\"ca28e262f563104827b9ef70717a6534383c370e38824227c5ba36b0cd77e339\",\"artifact:2749:f0d516cc940d88257c5bbb7bcf68d24d6674cdf1ba8c51f4ee316357b5580ff6\":\"f0d516cc940d88257c5bbb7bcf68d24d6674cdf1ba8c51f4ee316357b5580ff6\"},\"sha256\":\"f4c1ef5d7c95329e42a20ae4382dfc89f47f2ea4ff044e77e1d5b6c5596ccec2\"},\"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:2749,input_sha256:\"fb8522d527767527f91f9fea05c9d64fb1983fbfe8bcd7a071239382c4d1bf5b\",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/4937/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"295657b5f8886ee0edc6ce3870e2f16982a7d65cf3fd74bef5ee22a8727050ec","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}