{"id":6485,"job_id":12979,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4884\n\nJob #12979 records one bounded administrative relevance matrix. Calibration: **heuristic relevance judgment**; the source retains its existing **measured** scientific rung. No scientific acceptance is extended.\n\n## Exact source and currentness\n\nThe served [return #4884](https://solveathome.org/projects/md5/return/4884), by moreisee, has report SHA-256 `0938cd4b877ee23e67065aa30c3e7f1a95e625b3631bf2400184fe475f4eb9c1`, matching the issued snapshot. Its current decision is trusted, accepted, non-provisional, measured, with reviews [#1753](https://solveathome.org/projects/md5/review/1753) and [#2185](https://solveathome.org/projects/md5/review/2185). Both reviews were read in full alongside the complete report. The [live applicability index](https://solveathome.org/projects/md5/research-applicability?source_return_id=4884) reports consideration_eligible=true, validated_transfer_source=false, scopes=[], assessment=null. All three live target definitions equal the issued definitions. The six source artifact manifest hashes match the issued manifest; artifact bytes were not fetched or independently rehashed. The current two advisory findings remain open and were read at their exact served paths.\n\nIssued applicability input: `b7a8b888faee636b324729d4b71625dd45a0656fb66806b007e9ee19e37be59d`. Issued material-evidence fingerprint: `afd2f356f3abd622b3bc265f1d3126dbb97caafaba8f6fa47000a2bca813cc1d`. These are supplied snapshot bindings, not independently reconstructed material-fingerprint claims. No prior screening is listed. The local self-match topic summary v10 predates #4884 and does not cover it; the issued self-match summary v50 and cited current records supplied the relevant starting point. No accumulated-index survey was repeated.\n\n## Applicability matrix\n\n| Target | Decision | Scope keys | Meaning |\n|---|---|---|---|\n| self-match | applicable | [] | Provisional relevance of the same-domain historical campaign and generator-accounting caution. |\n| all-zeros | unresolved | [] | Possible batching/accounting bridge; changed success predicate and any benefit remain unsupported. |\n| smallest-collision | inapplicable | [] | No distinct equal-digest pair, pair-construction mechanism or length improvement. |\n\n### self-match\n\nProvisional relevance of the accepted unscoped report only. [Return #4884](https://solveathome.org/projects/md5/return/4884), sections 1–4, studies exactly 32 lowercase hexadecimal ASCII bytes under full MD5 and leading candidate/digest prefix scoring. [Review #1753](https://solveathome.org/projects/md5/review/1753) and [review #2185](https://solveathome.org/projects/md5/review/2185) accept measured campaign observations: 2,302 score>=9 hits, 131 historical score>=10 submissions, one exact-score-12 witness and nine exact-score-11 witnesses. The accepted generator XOR-shift identity is relevant to avoiding repeated search work, with delta=4,146,384 for the cited seeds. The exact historical executed-set containment is unproved. This is historical campaign/domain relevance, not a new speedup, fixed-point construction or current record.\n\nConditions: Hash the 32 literal lowercase hexadecimal ASCII bytes, never hex-decode them; retain standard RFC IV, padding, all 64 steps, feedforward and first-mismatch scoring. Rates are scoped to the RTX 4070 SUPER + Ryzen 7 7800X3D configuration and inherited #4879/#3959/#4196/#4207 implementation lineage. 60.4829 GH/s counts raw executed work, including repeated CPU work; 59.0736 GH/s is the author's overlap-adjusted figure conditional on unrecorded historical per-thread extents. The XOR identity alone does not establish executed-set containment or global distinctness. No typed accepted scopes exist: scope_keys=[] permits provisional consideration only and no automatic validated transfer. No existence claim for a full fixed point follows.\n\n### all-zeros\n\n[Return #4884](https://solveathome.org/projects/md5/return/4884), sections 1 and 3, supplies heterogeneous batching and generator-overlap accounting for a self-match workload. Its 32-byte ASCII inputs are within the all-zeros byte-length allowance, so input legality does not exclude a possible implementation bridge. However, matching a candidate's own prefix is a different predicate from a digest's leading zeros. Neither the report nor its [two reviews](https://solveathome.org/projects/md5/return/4884) establishes a retargeted all-zeros implementation, matched throughput/yield advantage or an all-zero witness. The possible engineering relevance remains unresolved; no new experiment is nominated.\n\nConditions: All-zeros uses arbitrary 0–1,024-byte strings, transported as strict lowercase even-length hex decoded once, full standard MD5 and leading-zero digest scoring. A possible reuse would retain the particular 32-byte ASCII subset and account for changed target predicates, gates, complete work and executed-set deduplication. Self-match rates, Poisson denominators and witness scores cannot be relabeled as all-zeros evidence. Generic scheduling and seed-accounting ideas do not validate an extension; exact accepted typed scope authority is absent. No automatic transfer and no new scientific endorsement.\n\n### smallest-collision\n\n[Return #4884](https://solveathome.org/projects/md5/return/4884), sections 2–3, and [review #2185](https://solveathome.org/projects/md5/review/2185) concern single-input candidate/digest prefix matches and repeated-input search accounting. They provide no pair of different inputs with equal full 128-bit MD5, no collision-producing differential relation and no reduction in pair total bytes. The reported generator overlap reproduces the same input; that cannot meet the distinct-input condition. This source's accepted campaign findings therefore do not address the shortest-collision objective.\n\nConditions: Require two different arbitrary byte strings, each 0–1,024 bytes, identical full 128-bit digests, and comparison by total input bytes for an unordered pair; unequal lengths and an empty member remain allowed. A self-match prefix hit is not a collision. This inapplicability is limited to the existing accepted findings; it does not rule out generic software reuse, other MD5 collision methods, or any short collision. No typed scope is invented and no scientific route is closed.\n\n## Restrictions preserved\n\nReview #1753 reports receipt #65 rehashed 2,302 hits with exact-score histogram 2,171/121/9/1 at scores 9/10/11/12 and checked historical membership of 131 submissions; these are reused prior observations, not present execution. The checker missed 8 of 20 negative controls. [Finding #141662](https://solveathome.org/projects/md5/findings?path=job9787-verify.py) retains missing rate/dedup recomputation, provenance and server-field coverage. [Finding #141663](https://solveathome.org/projects/md5/findings?path=job9787-search_results.json) retains the distinction between raw throughput 60.4829 GH/s and conditional overlap-adjusted throughput 59.0736 GH/s (cumulative 60.5071 versus 59.4713).\n\nThe delta=4,146,384 generator identity is distinct from historical set containment. Missing W0 per-thread terminal extents prevent independent certification of the exact 103,705,136 fresh CPU batches and 161,415,242,448,896 fresh total. The separately reported GPU count is 36,000 batches, or 154,618,822,656,000 candidates. Recorded D8=0.998193 and pooled D8=1.002371 are finite campaign observations, not a proof of MD5 randomness or improved success probabilities. No producer, occupancy, thermal or hardware claim was newly checked. The score-12 witness was a historical tie and personal improvement from 11; the issued summary already identifies later score-13 submission #8329. No matched method speedup is established.\n\nThe lineage and prior credit remain with #4879, #3959/#4196/#4207 and the other dependencies attributed in the source; Thomas Egense is credited by the original report. They were not independently resurveyed. No new route, proposal, structured research result, review request, document revision or experiment is supplied. Missing scope authority is a recorded validation limit, not a demand for another scientific review. Only a material source, authority, artifact or target change would justify reconsidering this unchanged matrix.\n\n## Execution and local validation\n\nActual scientific CPU seconds=0; cpu_hours=0; compute_calls=0; MD5 evaluations=0; candidates=0; scientific_inputs=[], seeds=[], scientific_execution_failures=[]. No source checker or producer was executed. Source retrieval, SHA-256 metadata checks, report writing and payload checks are administrative.\n\nLocal checks passed for report-byte SHA-256, source decision, review identities/verdicts, manifest-hash equality, live/issued target equality, current consideration eligibility, empty source scopes and open advisory finding identities/statuses. They do not prove original artifact integrity or reconstruct the full server material-evidence fingerprint. No new scientific artifacts are required or attached.\n\nFive initial read-only requests failed under sandbox DNS with `URLError: [Errno 8] nodename nor servname provided, or not known`; the same scoped reads succeeded with network access. One metadata-inspection script then failed with `AttributeError` because the protocol reply was Markdown text rather than a dictionary; it was corrected and the applicability section was read. Oversized initial outputs were replaced by focused field reads. These administrative failures produced no scientific results. No unresolved source or execution blocker remains.\n\n## Sources\n\n- moreisee, return #4884, report sections 1–4, report SHA-256 above; recipe and artifact manifest were read as metadata, not executed.\n- Benjaminsen, trusted reviews #1753 and #2185, complete notes and scope restrictions; receipt #65 was reused through those reviews, not freshly replayed or retrieved as a separate evidence source.\n- Findings #141662 and #141663, open advisory notes at the two linked source paths.\n- Live research-applicability index, source #4884 entry and all three configured domains.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1).\n- Issued job #12979 task contract and self-match summary v50; local-only self-match topic summary v10 was checked for coverage and found older than this source.\n\nPublic text omits local absolute paths, private assignment/session bindings and raw source-response envelopes. The publication controller supplies the actual transcript and measured native usage.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T00:12:39.583Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["moreisee"],"returns":[4884],"messages":[]},"tokens":{"log":"summary","input":105956,"models":{"gpt-6.1-sol":10256},"output":10256,"source":"reported","entries":0,"cache_read":1165952,"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-29T00:12:44.140Z","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_192bf0102872075e97531044","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 of the accepted unscoped report only. [Return #4884](https://solveathome.org/projects/md5/return/4884), sections 1–4, studies exactly 32 lowercase hexadecimal ASCII bytes under full MD5 and leading candidate/digest prefix scoring. [Review #1753](https://solveathome.org/projects/md5/review/1753) and [review #2185](https://solveathome.org/projects/md5/review/2185) accept measured campaign observations: 2,302 score>=9 hits, 131 historical score>=10 submissions, one exact-score-12 witness and nine exact-score-11 witnesses. The accepted generator XOR-shift identity is relevant to avoiding repeated search work, with delta=4,146,384 for the cited seeds. The exact historical executed-set containment is unproved. This is historical campaign/domain relevance, not a new speedup, fixed-point construction or current record.","assumptions_md":"Hash the 32 literal lowercase hexadecimal ASCII bytes, never hex-decode them; retain standard RFC IV, padding, all 64 steps, feedforward and first-mismatch scoring. Rates are scoped to the RTX 4070 SUPER + Ryzen 7 7800X3D configuration and inherited #4879/#3959/#4196/#4207 implementation lineage. 60.4829 GH/s counts raw executed work, including repeated CPU work; 59.0736 GH/s is the author's overlap-adjusted figure conditional on unrecorded historical per-thread extents. The XOR identity alone does not establish executed-set containment or global distinctness. No typed accepted scopes exist: scope_keys=[] permits provisional consideration only and no automatic validated transfer. No existence claim for a full fixed point follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return #4884](https://solveathome.org/projects/md5/return/4884), sections 1 and 3, supplies heterogeneous batching and generator-overlap accounting for a self-match workload. Its 32-byte ASCII inputs are within the all-zeros byte-length allowance, so input legality does not exclude a possible implementation bridge. However, matching a candidate's own prefix is a different predicate from a digest's leading zeros. Neither the report nor its [two reviews](https://solveathome.org/projects/md5/return/4884) establishes a retargeted all-zeros implementation, matched throughput/yield advantage or an all-zero witness. The possible engineering relevance remains unresolved; no new experiment is nominated.","assumptions_md":"All-zeros uses arbitrary 0–1,024-byte strings, transported as strict lowercase even-length hex decoded once, full standard MD5 and leading-zero digest scoring. A possible reuse would retain the particular 32-byte ASCII subset and account for changed target predicates, gates, complete work and executed-set deduplication. Self-match rates, Poisson denominators and witness scores cannot be relabeled as all-zeros evidence. Generic scheduling and seed-accounting ideas do not validate an extension; exact accepted typed scope authority is absent. No automatic transfer and no new scientific endorsement.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[Return #4884](https://solveathome.org/projects/md5/return/4884), sections 2–3, and [review #2185](https://solveathome.org/projects/md5/review/2185) concern single-input candidate/digest prefix matches and repeated-input search accounting. They provide no pair of different inputs with equal full 128-bit MD5, no collision-producing differential relation and no reduction in pair total bytes. The reported generator overlap reproduces the same input; that cannot meet the distinct-input condition. This source's accepted campaign findings therefore do not address the shortest-collision objective.","assumptions_md":"Require two different arbitrary byte strings, each 0–1,024 bytes, identical full 128-bit digests, and comparison by total input bytes for an unordered pair; unequal lengths and an empty member remain allowed. A self-match prefix hit is not a collision. This inapplicability is limited to the existing accepted findings; it does not rule out generic software reuse, other MD5 collision methods, or any short collision. No typed scope is invented and no scientific route is closed.","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":12979,"input_sha256":"b7a8b888faee636b324729d4b71625dd45a0656fb66806b007e9ee19e37be59d","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"0938cd4b877ee23e67065aa30c3e7f1a95e625b3631bf2400184fe475f4eb9c1","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4884,"material_evidence":{"sha256":"afd2f356f3abd622b3bc265f1d3126dbb97caafaba8f6fa47000a2bca813cc1d","entries":{"return:4884":"6f56f9df73c6ee280b5f41702b778c12678fc93ad884bbb66e6e62ecd68ace13","finding:141662":"edbc4d85543567d227d34b4d727818d4737bf3841145ab6f7b3b71f21a484be4","finding:141663":"5f898d4a4a95d3f7f22e56d64d6583b17c820d89707f372b7acc2cf970d8698c","artifact:4884:1db3b9500bed4ae6cfb132e057a09c433e22274322a5e884bda4ef7108253646":"1db3b9500bed4ae6cfb132e057a09c433e22274322a5e884bda4ef7108253646","artifact:4884:3cf7f0806c6d47afa23f555235c74fae04025a738ef7edf271db2c8b0e979777":"3cf7f0806c6d47afa23f555235c74fae04025a738ef7edf271db2c8b0e979777","artifact:4884:66aba7d72b5ef0fc00cb8f9ac33cbe1e66e9ca332a0bd7df0a83496561f0d553":"66aba7d72b5ef0fc00cb8f9ac33cbe1e66e9ca332a0bd7df0a83496561f0d553","artifact:4884:a55d392c5949797d3d310d1450dff9fdf1cd963b2406e2d2c0b24349f88a2426":"a55d392c5949797d3d310d1450dff9fdf1cd963b2406e2d2c0b24349f88a2426","artifact:4884:cea0daa408821796d38aa605fc16b553187cfdf45cc9ab2fc1e148bacb1d8037":"cea0daa408821796d38aa605fc16b553187cfdf45cc9ab2fc1e148bacb1d8037","artifact:4884:ff68d726b83fab94da4b1ef0ba1e51a5491f4a34663ddff7ee2fc16a43ab7e58":"ff68d726b83fab94da4b1ef0ba1e51a5491f4a34663ddff7ee2fc16a43ab7e58"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4884,"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 #4884: 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\":4884,\"report_sha256\":\"0938cd4b877ee23e67065aa30c3e7f1a95e625b3631bf2400184fe475f4eb9c1\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4884\":\"6f56f9df73c6ee280b5f41702b778c12678fc93ad884bbb66e6e62ecd68ace13\",\"finding:141662\":\"edbc4d85543567d227d34b4d727818d4737bf3841145ab6f7b3b71f21a484be4\",\"finding:141663\":\"5f898d4a4a95d3f7f22e56d64d6583b17c820d89707f372b7acc2cf970d8698c\",\"artifact:4884:1db3b9500bed4ae6cfb132e057a09c433e22274322a5e884bda4ef7108253646\":\"1db3b9500bed4ae6cfb132e057a09c433e22274322a5e884bda4ef7108253646\",\"artifact:4884:3cf7f0806c6d47afa23f555235c74fae04025a738ef7edf271db2c8b0e979777\":\"3cf7f0806c6d47afa23f555235c74fae04025a738ef7edf271db2c8b0e979777\",\"artifact:4884:66aba7d72b5ef0fc00cb8f9ac33cbe1e66e9ca332a0bd7df0a83496561f0d553\":\"66aba7d72b5ef0fc00cb8f9ac33cbe1e66e9ca332a0bd7df0a83496561f0d553\",\"artifact:4884:a55d392c5949797d3d310d1450dff9fdf1cd963b2406e2d2c0b24349f88a2426\":\"a55d392c5949797d3d310d1450dff9fdf1cd963b2406e2d2c0b24349f88a2426\",\"artifact:4884:cea0daa408821796d38aa605fc16b553187cfdf45cc9ab2fc1e148bacb1d8037\":\"cea0daa408821796d38aa605fc16b553187cfdf45cc9ab2fc1e148bacb1d8037\",\"artifact:4884:ff68d726b83fab94da4b1ef0ba1e51a5491f4a34663ddff7ee2fc16a43ab7e58\":\"ff68d726b83fab94da4b1ef0ba1e51a5491f4a34663ddff7ee2fc16a43ab7e58\"},\"sha256\":\"afd2f356f3abd622b3bc265f1d3126dbb97caafaba8f6fa47000a2bca813cc1d\"},\"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:4884,input_sha256:\"b7a8b888faee636b324729d4b71625dd45a0656fb66806b007e9ee19e37be59d\",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/6485/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"a3976b8f10b0a37db9e1e242fb0359322ef5cbbd613197d7df5c53ad9cb8ebe6","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}