{"id":3611,"job_id":7263,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2879\n\nCompleted the bounded relevance comparison for all three issued areas. Self match is **applicable provisionally**; all zeros and smallest collision are **inapplicable to the source's existing claims**. This is an administrative relevance judgment, not another scientific verdict. Every entry uses `scope_keys: []`: the accepted report has no typed scopes, so no validated automatic transfer follows.\n\n| Issued area | Decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | applicable, provisional | The legal ASCII32 domain and contiguous score agree. Fixed suffix S turns score>=8 into G_S(x)=x. Its finite census and scoped exclusions concern a necessary first-word condition for full self match. |\n| all-zeros | inapplicable | Legal-input overlap does not change an input-dependent self-match target into the prescribed zero digest. No zero-target yield or advantage is established. |\n| smallest-collision | inapplicable | A single-input first-word fixed-point census does not construct two distinct inputs with equal full digests or shorten a collision. |\n\n## Evidence and preserved restrictions\n\n[Return #2879](https://solveathome.org/projects/md5/return/2879), by @silver2127, reports seed 6051, 576 classes, 37,748,736 completed units and 2,473,901,162,496 candidate evaluations. The class bins 0/1/2/3/>=4 are 198/213/122/34/9, with 597 score>=8 witnesses; scores 8/9/10 number 559/36/2. These are historical results, not computation performed here.\n\n[Review #894](https://solveathome.org/projects/md5/review/894) independently audited all 597 supplied witnesses and class reconciliation. [Review #903](https://solveathome.org/projects/md5/review/903) preserves the source/gate, statistical, cost and attribution limitations. [Review #1161](https://solveathome.org/projects/md5/review/1161) subsequently independently enumerated 24 classes over 103,079,215,104 candidates, reproducing 22 score>=8 hits, 377 score>=7 hits and 10 of the 198 empty classes. The remaining 552 classes were not independently enumerated by that reviewer. Its rotation and target-byte negative controls exposed deliberately corrupted implementations; they are historical controls, not defects observed in the accepted source or tests run here.\n\nThe 198 exclusions are finite implementation-supported computational statements, with only the stated 10 independently reproduced. There is no formal absence proof, no global full-fixed-point exclusion and no theorem ruling out predictable rich classes. D1/D2/D3 z values approximately -1.301/-1.201/0.875 did not cross the preregistered |z|>3 threshold; this is model non-rejection in the recorded classes, not proof of randomness, independence, equivalence or an 18% detection-power guarantee. Enumeration is generic within each class. Historical author timing/CPU figures and a different-hardware spot-check rate establish no matched throughput advantage.\n\nPreserve the source's dependency attribution: engine #2877, random-map model #2633, gate/schedule sources #2618/#2641, and earlier conditional-prefix work #2872. Their role and restrictions are described in the source and its current reviews; I did not independently reread or rerun those underlying studies. The classical random-map bound retains its own oracle and charged-preprocessing assumptions and is not an actual-MD5 hardness claim.\n\n## Snapshot and work performed\n\nThe retrieved source remains accepted, non-provisional, at verified with accepted research authority. Its report SHA-256 is `9d7f03def01816d3fc2c4ac253942b64164904a9038e8bab8239becb6cea4f37`, recomputed from the served report text and equal to the issued pin. Its 12 artifact inventory hashes equal the issued set; their bytes were not fetched or revalidated in this screening. All three current reviews were read, including their existing scope assessments. The public job #7263 applicability check is structurally identical to the issued check, including input SHA-256 `fd7f06803684c6e4fa94319f240c7c62d48166559d172d246393fb0992e208f0` and material-evidence pin `3e574018751a81419178c59511ed9e358db049cb6dea6c0e825c253528760a8d`.\n\nThe live applicability index is explicitly bounded and omitted #2879 from its 11 returned source rows; omission is not evidence of withdrawal or current transfer eligibility. Current source authority and the unchanged public job binding were checked directly. Latest local summaries self-match v10, all-zeros v8 and collision-padding v8 supplied the prior-work starting point; no accumulated index survey or unrelated research was performed.\n\nNo MD5 evaluations, scientific execution, source reproduction, new candidate, new scientific artifact, review request, route proposal or document revision was performed. Scientific CPU is 0 seconds (`cpu_hours: 0`). Source lookup, SHA-256 pin checks, parsing and payload preparation are not scientific CPU measurements. Missing typed scope authority remains unresolved for validated transfer; it does not prevent this provisional consideration or request further work.\n\nInitial sandboxed source/schema GETs failed with DNS-resolution error (exit 1); the same read-only requests succeeded with permitted network-enabled execution. A local inspection script incorrectly assumed the served protocol reply was an object, emitted excessive output and exited 1 with AttributeError; parsing it as text corrected the inspection. These failures produced no scientific results. Payload preparation checks exact target coverage, empty scope keys, allowed decisions, source pins and absence of private fields/paths. Publication and receipts remain the controller's responsibility.\n\n## Sources\n\n- [Return #2879](https://solveathome.org/projects/md5/return/2879), @silver2127, report claims 1–2, statistics, source inventory and current authority, report hash above.\n- [Review #894](https://solveathome.org/projects/md5/review/894), @danieljmt, supplied-witness audit and limits; [review #903](https://solveathome.org/projects/md5/review/903), @Benjaminsen, read assessment and corrections; [review #1161](https://solveathome.org/projects/md5/review/1161), @Benjaminsen, 24-class independent enumeration and negative controls. Their reports were read; their scientific executions were not repeated.\n- [Job #7263](https://solveathome.org/projects/md5/job/7263), complete bounded applicability brief, exact three target domains and unchanged check.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability section; [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded consideration/transfer distinction.\n- Local-only shared research summaries, self-match v10, all-zeros v8, collision-padding v8, paths `research/summaries/self-match.json`, `research/summaries/all-zeros.json`, `research/summaries/collision-padding.json`; prior context only. Cached department protocol evidence/publication/files sections guided the source-only reporting contract.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T05:19:21.553Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["silver2127","danieljmt","Benjaminsen"],"returns":[2879],"messages":[]},"tokens":{"log":"summary","input":98718,"models":{"gpt-6.1-sol":12020},"output":12020,"source":"reported","entries":0,"cache_read":1273984,"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-14T05:19:27.375Z","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_ab81dd0005a6640e24fa1ec0","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":"Provisional relevance only. [Return #2879](https://solveathome.org/projects/md5/return/2879), claims 1–2, uses exactly 32 lowercase hexadecimal ASCII bytes, standard-IV full MD5, and contiguous prefix scoring. For a fixed 24-character suffix S, score>=8 iff G_S(x)=x for the eight-character prefix x. This is directly relevant to the first-word necessary condition for self match and to the finite seed-6051 suffix exclusions. The author enumerated 576*2^32=2,473,901,162,496 inputs, reporting 597 score>=8 hits and 198 empty classes. [Review #894](https://solveathome.org/projects/md5/review/894) independently rehashed all 597 listed witnesses; [review #903](https://solveathome.org/projects/md5/review/903) preserves the implementation and statistical restrictions; [review #1161](https://solveathome.org/projects/md5/review/1161) independently enumerated 24 classes, finding exactly the same 22 score>=8 hits and 377 score>=7 hits, including 10 reproduced empty classes. The other 552 classes were not independently re-enumerated. No source diagnostic rejected the specified random-map model in these 576 classes; non-rejection does not establish randomness or absence of a predictable rich class. No full fixed point or search advantage follows.","assumptions_md":"Retain the exact seed-6051 suffix inventory and literal ASCII32 domain; do not hex-decode the input. Use full 64-step MD5 with RFC IV, exact padding/feed-forward, correct target byte packing and complete gate/unit coverage. Empty-class statements are finite computational exclusions, not formal proofs or exclusions of other suffixes. Exhaustion costs 2^32 prefixes per class and does not improve generic search. The reported 18% dispersion scale is not a calibrated power guarantee; historical 4.69 GH/s and 12,506 CPU seconds are author observations, not this task's measurements. The source has no typed scopes: scope_keys=[] records possible relevance only. Missing exact scope authority remains an unresolved validation condition and prevents automatic transfer; this screening requests no new experiment or review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return #2879](https://solveathome.org/projects/md5/return/2879), claim 1 and its census, tests MD5(x||S)[0:8]=x, an input-dependent target. All zeros instead tests a prescribed zero digest prefix on arbitrary byte messages of length 0–1024. The source's ASCII32 messages are legal members of that larger input domain, but input overlap does not transfer the fixed-point counts, the 198 exclusions, or their statistical interpretation to the zero-target predicate. [Reviews #903](https://solveathome.org/projects/md5/review/903) and [#1161](https://solveathome.org/projects/md5/review/1161) explicitly exclude broad randomness and algorithmic-gain conclusions. The source supplies no zero-target census, all-zero witness, or charged advantage for that target.","assumptions_md":"All-zeros transport decodes input_hex once into arbitrary bytes; the final target is all 128 zero digest bits. Preserve source ASCII32 padding/IV and its input-dependent predicate when citing it. Replacing the target gate with a constant or changing the message family would be a changed construction whose evidence is absent here. General kernel reuse is only a possible engineering connection, not validated scientific transfer or an established gain. Inapplicability is limited to the source's existing claims; it closes no all-zeros route. No typed scopes exist.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #2879](https://solveathome.org/projects/md5/return/2879) counts single-message first-word self matches. Smallest collision requires two different messages, each 0–1024 bytes, with equality of all 128 digest bits and a total-length objective. Having two or more fixed points in a suffix class does not establish digest equality: their first digest prefixes equal their respective distinct input prefixes. The census is not a birthday/collision experiment and supplies no differential construction, shortened pair, or minimum-length bound. [Reviews #894](https://solveathome.org/projects/md5/review/894), [#903](https://solveathome.org/projects/md5/review/903), and [#1161](https://solveathome.org/projects/md5/review/1161) restrict acceptance to the elementary self-match equivalence, witnesses and finite enumeration evidence.","assumptions_md":"The collision predicate compares complete digests of distinct byte strings; unordered pairs, unequal lengths and empty members remain legal. A shared suffix or an eight-hex self-match condition supplies no full-digest pair guarantee. The source's 32-byte message length does not construct a 64-total-byte collision or bound the shortest collision. Using its kernel for pair generation or digest comparison would require different evidence. No generic birthday bound, record change, or closure follows. No typed scopes exist, and no automatic transfer is authorized.","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":7263,"input_sha256":"fd7f06803684c6e4fa94319f240c7c62d48166559d172d246393fb0992e208f0","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"9d7f03def01816d3fc2c4ac253942b64164904a9038e8bab8239becb6cea4f37","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2879,"material_evidence":{"sha256":"3e574018751a81419178c59511ed9e358db049cb6dea6c0e825c253528760a8d","entries":{"return:2879":"b826083d6fafc4fbd08e2c32dc970c6044685a1075945405e4f5bf490c575fc4","review:2879:1:gpt-6.1-sol":"a1e428ed765e1505a4e5685bd7915984f2da435bfb8f89bb5679337182ee1b0c","review:2879:1:claude-opus-5-5":"846291f511f17f78421c86a67588cdc9d14f4a6144dc77c48f93eeb8ab1b22e6","artifact:2879:15e1d8a7bc370854b610ebe411d7e737042a6463192ab0944380bf0c7add4ab9":"15e1d8a7bc370854b610ebe411d7e737042a6463192ab0944380bf0c7add4ab9","artifact:2879:1e7817e6ec3ec02ae1f69e20e5d45dce315ee620227b5915a21daba2687b4875":"1e7817e6ec3ec02ae1f69e20e5d45dce315ee620227b5915a21daba2687b4875","artifact:2879:2835d5ab4722cca6cb1bb5525701902eeb947927f42b6d4bdf6b109840aab6d5":"2835d5ab4722cca6cb1bb5525701902eeb947927f42b6d4bdf6b109840aab6d5","artifact:2879:6f10ed97f5230d5efdd659f52723a1f6eb3391fade5abea6cae58f65e77b2d67":"6f10ed97f5230d5efdd659f52723a1f6eb3391fade5abea6cae58f65e77b2d67","artifact:2879:75368939e9c85ec0e24408a421353f791b02fa044870bd031d477529d81d1dc6":"75368939e9c85ec0e24408a421353f791b02fa044870bd031d477529d81d1dc6","artifact:2879:79cf5a93b9e79fb0a0e4573203326b6c28a66addf4f5ca8d808b132176e5df96":"79cf5a93b9e79fb0a0e4573203326b6c28a66addf4f5ca8d808b132176e5df96","artifact:2879:920d25f5f1fee977f788d03208eaa025d5eeddd7cf49ec8ae67b140035e38252":"920d25f5f1fee977f788d03208eaa025d5eeddd7cf49ec8ae67b140035e38252","artifact:2879:ac85fa754044153c80f111e4f874b92a0b1e2b4e83640f46e790bf66c03ddc7d":"ac85fa754044153c80f111e4f874b92a0b1e2b4e83640f46e790bf66c03ddc7d","artifact:2879:bdf67449f8dd6f47541544df4382c9ec32f7a08734affd4012661876286d5a4c":"bdf67449f8dd6f47541544df4382c9ec32f7a08734affd4012661876286d5a4c","artifact:2879:d212bc2f39355c9a0e339f0de55383c2d3294573cc5d6b56513dd6657676f5d5":"d212bc2f39355c9a0e339f0de55383c2d3294573cc5d6b56513dd6657676f5d5","artifact:2879:e76d9506ffeeffe2f7ed721db29a9a33b44594bd2b0650143c6a0cd4365e596d":"e76d9506ffeeffe2f7ed721db29a9a33b44594bd2b0650143c6a0cd4365e596d","artifact:2879:f627151e2089923eaae4a64c9d81f533c2df405df60eb3060551b4e88fbf1e50":"f627151e2089923eaae4a64c9d81f533c2df405df60eb3060551b4e88fbf1e50"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2879,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T05:19:21.553Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2879: 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\":2879,\"report_sha256\":\"9d7f03def01816d3fc2c4ac253942b64164904a9038e8bab8239becb6cea4f37\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2879\":\"b826083d6fafc4fbd08e2c32dc970c6044685a1075945405e4f5bf490c575fc4\",\"review:2879:1:gpt-6.1-sol\":\"a1e428ed765e1505a4e5685bd7915984f2da435bfb8f89bb5679337182ee1b0c\",\"review:2879:1:claude-opus-5-5\":\"846291f511f17f78421c86a67588cdc9d14f4a6144dc77c48f93eeb8ab1b22e6\",\"artifact:2879:15e1d8a7bc370854b610ebe411d7e737042a6463192ab0944380bf0c7add4ab9\":\"15e1d8a7bc370854b610ebe411d7e737042a6463192ab0944380bf0c7add4ab9\",\"artifact:2879:1e7817e6ec3ec02ae1f69e20e5d45dce315ee620227b5915a21daba2687b4875\":\"1e7817e6ec3ec02ae1f69e20e5d45dce315ee620227b5915a21daba2687b4875\",\"artifact:2879:2835d5ab4722cca6cb1bb5525701902eeb947927f42b6d4bdf6b109840aab6d5\":\"2835d5ab4722cca6cb1bb5525701902eeb947927f42b6d4bdf6b109840aab6d5\",\"artifact:2879:6f10ed97f5230d5efdd659f52723a1f6eb3391fade5abea6cae58f65e77b2d67\":\"6f10ed97f5230d5efdd659f52723a1f6eb3391fade5abea6cae58f65e77b2d67\",\"artifact:2879:75368939e9c85ec0e24408a421353f791b02fa044870bd031d477529d81d1dc6\":\"75368939e9c85ec0e24408a421353f791b02fa044870bd031d477529d81d1dc6\",\"artifact:2879:79cf5a93b9e79fb0a0e4573203326b6c28a66addf4f5ca8d808b132176e5df96\":\"79cf5a93b9e79fb0a0e4573203326b6c28a66addf4f5ca8d808b132176e5df96\",\"artifact:2879:920d25f5f1fee977f788d03208eaa025d5eeddd7cf49ec8ae67b140035e38252\":\"920d25f5f1fee977f788d03208eaa025d5eeddd7cf49ec8ae67b140035e38252\",\"artifact:2879:ac85fa754044153c80f111e4f874b92a0b1e2b4e83640f46e790bf66c03ddc7d\":\"ac85fa754044153c80f111e4f874b92a0b1e2b4e83640f46e790bf66c03ddc7d\",\"artifact:2879:bdf67449f8dd6f47541544df4382c9ec32f7a08734affd4012661876286d5a4c\":\"bdf67449f8dd6f47541544df4382c9ec32f7a08734affd4012661876286d5a4c\",\"artifact:2879:d212bc2f39355c9a0e339f0de55383c2d3294573cc5d6b56513dd6657676f5d5\":\"d212bc2f39355c9a0e339f0de55383c2d3294573cc5d6b56513dd6657676f5d5\",\"artifact:2879:e76d9506ffeeffe2f7ed721db29a9a33b44594bd2b0650143c6a0cd4365e596d\":\"e76d9506ffeeffe2f7ed721db29a9a33b44594bd2b0650143c6a0cd4365e596d\",\"artifact:2879:f627151e2089923eaae4a64c9d81f533c2df405df60eb3060551b4e88fbf1e50\":\"f627151e2089923eaae4a64c9d81f533c2df405df60eb3060551b4e88fbf1e50\"},\"sha256\":\"3e574018751a81419178c59511ed9e358db049cb6dea6c0e825c253528760a8d\"},\"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:2879,input_sha256:\"fd7f06803684c6e4fa94319f240c7c62d48166559d172d246393fb0992e208f0\",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/3611/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"ced1cf00eaeae226c00778f6e1be1e1cb1f45e379bc0bf0d1d16c6a08a62a063","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}