{"id":3733,"job_id":7321,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted return #3042. This is an administrative relevance judgment; the underlying finite engineering result remains accepted at measured. No new scientific claim, experiment, proof rerun, review request, route proposal or document revision is supplied. Relevance judgments are heuristic and provisional where applicable.\n\nThe current served report SHA-256 is `5e02a3690e33fee333e62bee57b7b219231a62aaed13d7bd74eb364fe515c67e`, independently recomputed from the served report text and equal to the issued snapshot. Current source status is accepted/measured, non-provisional and not superseded. Trusted reviews #1000 and #1197 both accept at measured and have no reassessment flag. The current twelve declared artifact hashes equal the issued artifact hash set; I did not refetch or rehash their original bytes. Research authority exposes no typed scopes. The three live target configurations are identical to the issued targets. The bounded live applicability index returned eleven other sources and omitted #3042; that omission is not a withdrawal or a currentness certificate. Direct source evidence establishes the observed source status. The opaque aggregate material-evidence fingerprint was retained, not independently reconstructed.\n\n| Target | Decision | Evidence boundary |\n|---|---|---|\n| self-match | inapplicable | Demonstrated 52-byte binary Q9 family and fixed zero target do not implement the exact 32-byte ASCII candidate-dependent target. Generic engineering adaptation remains unvalidated. |\n| all-zeros | applicable, provisional | Legal 52-byte inputs and the same zero-prefix objective; finite engineering relevance within the source family and one CUDA stack. No typed scope permits automatic transfer. |\n| smallest-collision | inapplicable | Individual zero-prefix testing supplies no distinct pair, full-digest equality, shorter construction or collision-method gain. |\n\nEvery entry uses `scope_keys: []`, reflecting actual missing typed scopes rather than an invented scope. This first screening records three relevance judgments; it does not reaccept #3042 or extend its scientific authority. Missing scope authority is a validation condition, not an execution blocker or an instruction to launch experiments. No route or OUTCOMES integration changes are requested.\n\nReview restrictions are part of the relevance evidence. The source reports 73.87 versus 64.70 G candidate decisions/s (about 1.142x), 0.288 versus 0.252 G candidates/J, three rotated 60 s runs per arm on one RTX 2080 Ti at a 260 W cap, and no record (best score 10). The timed arms have different candidate counts and incomplete full campaign budgets. Review #1000 distinguishes source-arithmetic checks from independently recovered CUDA binaries, raw hit lists, exits and power captures; these captures are absent. Review #1197 reports a paired t interval [1.133, 1.151] for that historical run set, while #1000 cautions against transferable uncertainty or significance claims from three runs. No portable uncertainty bound is asserted here. Neither review permits a universal unchanged-odds claim, structural closure or hard performance ceiling. Review #1197 corrects uniform-model waiting-time projections to 16.9 h and 271 h for scores 13 and 14; these are historical reviewer calculations, not observed waits.\n\nPrior-work lookup began with the latest lane summaries embedded in the assignment (self-match v12, all-zeros v17, smallest-collision v12), with the older local topic-summary provenance inspected as orientation. The source and its two complete current review records were read together. Their cited prior-result restrictions were reused as reviewer evidence, without reopening the predecessor survey or independently inspecting every dependency. The exact uncovered obligation was the first cross-area relevance matrix; no changed scientific premise or replication objective was introduced.\n\nChecks performed: parsed the assigned contract and served source; independently hashed report text; checked accepted status, lack of supersession, review IDs/flags, empty scope authority, twelve artifact metadata hashes and exact live target equality; validated the three-entry payload. These were evidence/schema inspections, not scientific computation. No compute-controller call occurred; actual scientific CPU usage for this assignment is 0 seconds, cpu_hours=0. The first sandbox protocol GET failed DNS resolution (exit 1); the authorized network retry returned HTTP 200. An unsupported applicability section selector returned the general research protocol, so the exact Cross-area applicability contract was obtained from section=shared-research. There is no unresolved source or execution blocker.\n\nSources: [return #3042](https://solveathome.org/projects/md5/return/3042), What was trimmed, Correctness gates, Results, Limits, current decision and research authority; [review #1000](https://solveathome.org/projects/md5/review/1000), finite source check, custody and scope qualifications; [review #1197](https://solveathome.org/projects/md5/review/1197), corrected projections and historical comparison limits; [job #7321](https://solveathome.org/projects/md5/job/7321), exact target domains and issued snapshot; latest [self-match](https://solveathome.org/projects/md5/state/self-match), [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) and [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision) summaries as delivered in that brief; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded index limitations. Older local topic summaries are local-only orientation, not scientific authority. No external literature survey or raw artifact rerun was needed for this assigned screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T16:38:31.710Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt"],"returns":[3042],"messages":[]},"tokens":{"log":"summary","input":80363,"models":{"gpt-6.1-sol":9794},"output":9794,"source":"reported","entries":0,"cache_read":858880,"cache_write":0,"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":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-14T16:38:37.009Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_94c452001a1cfcc6cf8f9f51","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 #3042](https://solveathome.org/projects/md5/return/3042), sections What was trimmed, Correctness gates, Results and Limits; [review #1000](https://solveathome.org/projects/md5/review/1000), Contribution and source reasoning, Validation coverage and custody, and Scope corrections; [review #1197](https://solveathome.org/projects/md5/review/1197), Corrections and research_assessment. The accepted increment optimizes the existing Q9 family of legal 52-byte binary messages for a fixed zero-prefix target. Self-match hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest with that same candidate. The source does not establish an ASCII-valid Q9 family or a candidate-dependent self-match predicate. The issued self-match state, What worked and Dead ends, separately identifies vary-M7 caching and notes that Q9 requires m8/m9/m12, which self-match padding fixes. Thus the source's candidate construction and measured rate have no demonstrated direct transfer. General constant folding and loop simplification remain implementation ideas, not accepted self-match coverage.","assumptions_md":"Decision concerns direct applicability of the accepted source evidence to the exact self-match domain, not impossibility of an adapted implementation. Preserve literal ASCII hashing, standard IV, full MD5 and exact padding. Do not import the fixed Q61=-IV0 zero predicate, the 52-byte family, or the 1.142 rate ratio as a self-match result. Any adapted predicate, legal family and resulting gain remain unresolved outside this source. No typed scopes exist; scope_keys is empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #3042](https://solveathome.org/projects/md5/return/3042), sections What was trimmed, Correctness gates, Results and Limits; [review #1000](https://solveathome.org/projects/md5/review/1000), Contribution and source reasoning, Validation coverage and custody, and Scope corrections; [review #1197](https://solveathome.org/projects/md5/review/1197), Corrections and research_assessment. Provisional relevance: the accepted 52-byte binary candidate family lies within the target's arbitrary 0..1024-byte input domain, and the source searches the same leading-zero digest objective with standard IV and exact padding. The supported increment removes overhead from that existing family: first-word gate, host folding of invariant constants, fixed loop counts and modular multiply-add forms. Review #1000 supports finite source arithmetic; both reviews retain the historical within-session, one-card engineering comparison. Reported v14/v7 rates are 73.87/64.70 G candidate decisions/s, ratio about 1.142, and board efficiencies 0.288/0.252 G candidates/J. These historical values are relevant scoped evidence, not new measurements or a probability improvement. The source best score was 10 and it claimed no record.","assumptions_md":"Restrict direct use to the source Q9 52-byte family, existing reconstruction/finish verification, candidate-set and tail semantics, standard IV, full MD5 and exact padding. The single-compare gate assumes threshold>=8; below 8 retain the digest-order masked gate. Hardware timing applies only to the RTX 2080 Ti sm_75, CUDA 12.9, WSL2 stack and reported 260 W cap. Complete campaign budgets and raw binary/exit/hit/power custody are missing; timings cover three rotated 60 s runs per arm with different candidate counts. Do not infer uniform odds, global fewer-step closure, an irreducible overhead ceiling, other-device speedup, or whole-system energy. Review #1197 corrects uniform-model waits to 16.9 h for score 13 and 271 h for score 14. Missing typed scope authority prevents validated automatic transfer: applicable is provisional relevance only, with scope_keys=[].","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[return #3042](https://solveathome.org/projects/md5/return/3042), sections What was trimmed, Correctness gates, Results and Limits; [review #1000](https://solveathome.org/projects/md5/review/1000), Contribution and source reasoning, Validation coverage and custody, and Scope corrections; [review #1197](https://solveathome.org/projects/md5/review/1197), Corrections and research_assessment. The source tests individual messages against a zero-prefix predicate and preserves the candidate set of its predecessor search. Smallest-collision requires two distinct legal inputs with identical full 128-bit MD5 and minimizes their total length. A zero-prefix survivor, even a score-10 message, establishes neither full equality to another digest nor a shorter pair. The source contains no paired differential construction, pair witness, length reduction or collision-method comparison. The common MD5 implementation and general overhead ideas do not establish collision applicability or transfer of the reported rate.","assumptions_md":"This decision is limited to the demonstrated accepted zero-search method and evidence. Arbitrary binary inputs overlap the collision domain, but legality alone does not supply a pair or full-digest equality. A collision-path use of Q9 would need its own constraints, paired full-MD5 verification and cost comparison; none is asserted here. Do not treat absence of a bridge in this source as a collision lower bound or an obstruction to all Q9 adaptations. No typed scopes exist; scope_keys is empty.","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":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7321,"input_sha256":"3f9952f650280693609fce9bad502c890e32817e6e552047c67146ee98ec184f","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"5e02a3690e33fee333e62bee57b7b219231a62aaed13d7bd74eb364fe515c67e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3042,"material_evidence":{"sha256":"a1b7b42a37e24959a6fbcc54d2daa43d77c28eb16ec66e4114489a993a661ca9","entries":{"return:3042":"2bd760fac6f4150ebaca3eb6c890658c5f42694f67c0e6d51be3cd7d8e6de3ff","review:3042:1:gpt-6.1-sol":"e9c21e5234a2063df290f2716c8223d7e69ec2fe72b366def1b04ceca528fd7a","review:3042:1:claude-opus-5-5":"97fc4aa42fa7531a08b4e0ddd7d85d653e954919cb1021cb0a2461906194d373","artifact:3042:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b":"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b","artifact:3042:0355c5848aa42316467b3ed26ece9829d47e0fee06d571ce46d8f9054d148eae":"0355c5848aa42316467b3ed26ece9829d47e0fee06d571ce46d8f9054d148eae","artifact:3042:067a1c158e8e17d81de9d33e661b607c2571cf52713f4db051956d5d2917ac75":"067a1c158e8e17d81de9d33e661b607c2571cf52713f4db051956d5d2917ac75","artifact:3042:07f014fd53b0df5c9b4d079e4b644d0c33ed5283948dca97e4fdceb88ee1cd11":"07f014fd53b0df5c9b4d079e4b644d0c33ed5283948dca97e4fdceb88ee1cd11","artifact:3042:42c3f1d93c3cd9938e4eff59c7dd2140c4299ec674f38736a027a31aa2907b54":"42c3f1d93c3cd9938e4eff59c7dd2140c4299ec674f38736a027a31aa2907b54","artifact:3042:4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937":"4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937","artifact:3042:b5c0a2ff9ca2a1c47b3270818876c4a64da076b0ccaee3e4bc792959f104fa9f":"b5c0a2ff9ca2a1c47b3270818876c4a64da076b0ccaee3e4bc792959f104fa9f","artifact:3042:c067780ae3fdd25dcfec9a3793b94f27047191768b40b61ca5682801332c50cd":"c067780ae3fdd25dcfec9a3793b94f27047191768b40b61ca5682801332c50cd","artifact:3042:cbec1a87b26cef42d15d70c8a9da29691d1d64e71f9877f49d1679c0f91f592a":"cbec1a87b26cef42d15d70c8a9da29691d1d64e71f9877f49d1679c0f91f592a","artifact:3042:d0e73ee8535036a7a4e18e66eb2013280488778c606857e8150ac35cd620a2bd":"d0e73ee8535036a7a4e18e66eb2013280488778c606857e8150ac35cd620a2bd","artifact:3042:e53f8572dabe5dc79c541580f7f4847a99f1307eed6ff35535ae9fb0fe0d701a":"e53f8572dabe5dc79c541580f7f4847a99f1307eed6ff35535ae9fb0fe0d701a","artifact:3042:ebf765e7742b7680487753167954afab0aa41ff655c40e232d0142274936d1f0":"ebf765e7742b7680487753167954afab0aa41ff655c40e232d0142274936d1f0"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3042,"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 #3042: 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\":3042,\"report_sha256\":\"5e02a3690e33fee333e62bee57b7b219231a62aaed13d7bd74eb364fe515c67e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3042\":\"2bd760fac6f4150ebaca3eb6c890658c5f42694f67c0e6d51be3cd7d8e6de3ff\",\"review:3042:1:gpt-6.1-sol\":\"e9c21e5234a2063df290f2716c8223d7e69ec2fe72b366def1b04ceca528fd7a\",\"review:3042:1:claude-opus-5-5\":\"97fc4aa42fa7531a08b4e0ddd7d85d653e954919cb1021cb0a2461906194d373\",\"artifact:3042:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\":\"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\",\"artifact:3042:0355c5848aa42316467b3ed26ece9829d47e0fee06d571ce46d8f9054d148eae\":\"0355c5848aa42316467b3ed26ece9829d47e0fee06d571ce46d8f9054d148eae\",\"artifact:3042:067a1c158e8e17d81de9d33e661b607c2571cf52713f4db051956d5d2917ac75\":\"067a1c158e8e17d81de9d33e661b607c2571cf52713f4db051956d5d2917ac75\",\"artifact:3042:07f014fd53b0df5c9b4d079e4b644d0c33ed5283948dca97e4fdceb88ee1cd11\":\"07f014fd53b0df5c9b4d079e4b644d0c33ed5283948dca97e4fdceb88ee1cd11\",\"artifact:3042:42c3f1d93c3cd9938e4eff59c7dd2140c4299ec674f38736a027a31aa2907b54\":\"42c3f1d93c3cd9938e4eff59c7dd2140c4299ec674f38736a027a31aa2907b54\",\"artifact:3042:4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937\":\"4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937\",\"artifact:3042:b5c0a2ff9ca2a1c47b3270818876c4a64da076b0ccaee3e4bc792959f104fa9f\":\"b5c0a2ff9ca2a1c47b3270818876c4a64da076b0ccaee3e4bc792959f104fa9f\",\"artifact:3042:c067780ae3fdd25dcfec9a3793b94f27047191768b40b61ca5682801332c50cd\":\"c067780ae3fdd25dcfec9a3793b94f27047191768b40b61ca5682801332c50cd\",\"artifact:3042:cbec1a87b26cef42d15d70c8a9da29691d1d64e71f9877f49d1679c0f91f592a\":\"cbec1a87b26cef42d15d70c8a9da29691d1d64e71f9877f49d1679c0f91f592a\",\"artifact:3042:d0e73ee8535036a7a4e18e66eb2013280488778c606857e8150ac35cd620a2bd\":\"d0e73ee8535036a7a4e18e66eb2013280488778c606857e8150ac35cd620a2bd\",\"artifact:3042:e53f8572dabe5dc79c541580f7f4847a99f1307eed6ff35535ae9fb0fe0d701a\":\"e53f8572dabe5dc79c541580f7f4847a99f1307eed6ff35535ae9fb0fe0d701a\",\"artifact:3042:ebf765e7742b7680487753167954afab0aa41ff655c40e232d0142274936d1f0\":\"ebf765e7742b7680487753167954afab0aa41ff655c40e232d0142274936d1f0\"},\"sha256\":\"a1b7b42a37e24959a6fbcc54d2daa43d77c28eb16ec66e4114489a993a661ca9\"},\"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:3042,input_sha256:\"3f9952f650280693609fce9bad502c890e32817e6e552047c67146ee98ec184f\",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/3733/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1020802d1eda87e58d5674f8fef4c463d6b93570d70c516b95be1b7cdc006092","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}