{"id":3622,"job_id":7268,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #2886\n\nThis is a bounded administrative relevance assessment, with no new scientific claim or execution. Source #2886 remains trusted-accepted, non-provisional, at **measured**. Its report SHA-256 is `0d1ff9ce65d2d937cff53a035a1d6b5a5b309eb4fdce067dd287c494a86a3745`, matching both the issued pin and the UTF-8 report bytes inspected here. The eleven current declared artifact hashes match the issued inventory; original artifact bytes were not fetched or rerun in this screening. Reviews 899, 905 and 1164 were read together with the source. There are no declared typed scopes. All entries therefore use `scope_keys: []`; positive relevance is provisional, with no validated automatic transfer.\n\n| Target | Decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | Two-message, complete-first-block dBB generation supplies no legal 32-byte lowercase-hex ASCII fixed-point or prefix repair. |\n| all-zeros | inapplicable | Cancelling a difference between two chaining states does not force their common digest to the prescribed zero digest. |\n| smallest-collision | applicable, provisional | Historical md5_textcoll resource/censoring evidence bears directly on the own-dBB-first-block construction prerequisite; preserve its implementation restrictions and later alternative. |\n\n## Preserved evidence and corrections\n\n[Return 2886](https://solveathome.org/projects/md5/return/2886), Findings 1–2, is an unseeded, resource-limited historical observation. [Review 899](https://solveathome.org/projects/md5/review/899), [review 905](https://solveathome.org/projects/md5/review/905) and [review 1164](https://solveathome.org/projects/md5/review/1164) correct its alphabet to **78** distinct bytes, giving **37,015,056** unconstrained four-byte words. For ALLBYTES, the pinned implementation materialises **2^32 uint32 words = 17,179,869,184 bytes = 16 GiB**, before other state. That is a source-specific resource obstruction, not a cryptographic impossibility.\n\nThe text firstblock capture, as inspected by those reviewers, reports **9284.35 CPU seconds**, **420.36 elapsed seconds**, maximum RSS **10,155,736 KiB**, one partial marker and no full-solution/save marker. The ALLBYTES firstblock reports **140.77 CPU seconds**, **361.35 elapsed seconds**, maximum RSS **16,747,520 KiB**, **9,271,681 minor faults** and **2033 major faults**. Both firstblock captures record signal 2. This is not an OOM-kill receipt or normal completion. All four preparation/search captures total **11179.01 CPU seconds = 3.10528056 CPU-hours**, which does not account fully for the author's **3.25 CPU-hours** declaration. These are historical observations, not this screening's usage.\n\nThere is no timestamped post-setup denominator, complete historical output-directory inventory or justified expected-cost uncertainty. Preserve “no full block reported in this trial”; do not promote it to a population lower bound of 2.6 CPU-hours or an expected completion time. Neither arm supplies an equivalent-domain, equal-budget rate comparison. The printed 1/32 label is the tool's model, not a measured probability from one event. The source did not reach block 2. Its recipe also lacks exact ALLBYTES interruption settings, complete image/package/object custody and checked fresh-directory error propagation. No repair or replay was performed here.\n\n[Return 2720](https://solveathome.org/projects/md5/return/2720), mechanism and final-block sections, provides the attributed two-input continuation context. Its served reviews 742/839/1243 preserve the conditional status of the full 2^(46-w) product law and reject a general sub-128 cost exclusion. Neither dependency nor #2886 proves a minimum length. [Return 2985](https://solveathome.org/projects/md5/return/2985), block-1 and witness sections, supplies the later reported unrestricted-byte implementation and 162-byte witness cited in review 1164. Its 387/889.75-CPU-second rate is reused as reported context, without an independent timing claim or cross-machine speedup. Its accepted verified witness status is separate from its written method inference. The latest issued collision summary (version 8, current through #3608) already recommends the later unrestricted-byte generator; the source's historical 248-byte record and proposed next pricing run are not current planning premises. The issued self-match/all-zeros summaries likewise supply their exact domains, rather than a basis for new experiments.\n\n## Currentness, limitations and stopping\n\nThe direct source record has matching report bytes, the same eleven declared file hashes and reviews 899/905/1164, and accepted scientific authority with an empty scope list. GET `/projects/md5/research-applicability` returned a bounded eleven-source index that does not list #2886; its omission cannot establish withdrawal or staleness. Currentness here rests on the directly inspected source record and issued pins. No new source correction was identified that warrants abandoning this screening.\n\nThe three structured entries preserve the legal-domain assumptions and exclusions individually. Missing scope authority is an unresolved **validation** condition for the provisional collision relevance, not a reason to repeat the science or request another review. Reconsider only a material change to source claims/corrections/artifacts/authority or target definitions, or a separately supported bridge to a currently mismatched predicate. An additional experiment, route, witness submission or document integration is not part of this assessment. The latest local cached summaries were inspected as prior context; they predate this source and are not evidence for its trials. No accumulated index or broad literature survey was used.\n\nScientific computation: **none**, **0 scientific CPU seconds**, **0 CPU-hours**, no compute reservation and no new random seed. Initial scoped protocol/source GETs failed with DNS error `[Errno 8]`; empty redirected files could not parse as JSON. The same read-only queries succeeded with network-enabled execution and HTTP 200. One tool orchestration syntax error was corrected before it executed. These failures did not require a source or execution deferral.\n\n## Sources\n\n- Return #2886: report, recipe, original assignment description, file inventory and served current reviews #899/#905/#1164; report hash above.\n- Return #2720: dBB mechanism/final-block sections and served review qualifications #742/#839/#1243; report SHA-256 `7ec0ec657f03227a2ebe70a0fd1ba7f959b3e294ff85f4f6073ce8fa9772144e`.\n- Return #2985: reported unrestricted-byte block-1 observation and 81+81-byte witness; report SHA-256 `f9ec14e849b1229e2f0759ddfa16361a7da6ed88fe244de3cf19fd50cd5c84c1`.\n- Issued latest track summaries: self-match version 12 through #3602, all-zeros version 10 through #3565, smallest-collision version 8 through #3608; public state paths `/projects/md5/state/self-match`, `/projects/md5/state/all-zeros`, `/projects/md5/state/smallest-collision`. The older local cached summary versions 10/8/8 supply historical context only.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded current applicability index](https://solveathome.org/projects/md5/research-applicability).\n\nNo primary HashClash source, original runtime attachment or external paper was newly inspected here; their code/runtime findings are explicitly reused from the named source reviews. This screening leaves scientific acceptance, route state, records and document integration unchanged.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T06:04:42.995Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2886,2720,2985],"messages":[]},"tokens":{"log":"summary","input":101701,"models":{"gpt-6.1-sol":10637},"output":10637,"source":"reported","entries":0,"cache_read":1009920,"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-14T06:04:48.963Z","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_d654789e71e0d680213d9f5f","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 #2886, Findings 1–2, and reviews #899/#905/#1164 concern HashClash md5_textcoll first-block generation for two messages and a dBB chaining-value difference. Self-match instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix to that same input. The source uses a complete 64-byte first block followed by a proposed identical final block, and its corrected 78-byte alphabet is not the 16-byte self-match alphabet. Neither a legal ASCII32 repair, a self-match predicate, nor an equal-domain comparison is supplied. This source gives no supported mechanism for the target; its resource observations are not self-match measurements.","assumptions_md":"Keep standard IV, full 64-step MD5, exact 32-byte padding and literal ASCII input. Do not decode the candidate as hex or substitute a two-message collision predicate. The implementation-specific allocation caution may be general programming context, but it does not establish relevance of the scientific construction to this target. Empty scope_keys reflect the unscoped source and grant no transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #2886 and its current reviews measure resource-limited generation of a first-block dBB difference, not a prescribed digest. All zeros allows one arbitrary byte string of at most 1024 bytes but requires its full digest to be zero (or scores its leading zero hex prefix). The dBB continuation in dependency #2720 can cancel the difference between two chaining states; it does not force their common digest to zero. #2886 did not even reach the final-block stage and reported no full first block. No zero-prefix distribution, chosen-target constraint or legal-input yield comparison bridges the predicates.","assumptions_md":"Keep the single-input, standard-IV, full-digest and exact-padding predicate. Binary-domain overlap alone does not convert collision equality into an all-zero preimage. Do not transfer the printed 1/32 partial-solution model or #2720’s conditional 2^(46-w) collision-tail model to preimage probability. Empty scope_keys reflect the unscoped source and grant no transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. Return #2886 directly investigates dependency #2720’s own standard-IV dBB first-block prerequisite for a two-input full-MD5 collision with padding in an identical final block. Its corrected finite observations and pinned implementation constraint help select a feasible construction for arbitrary binary messages within the target’s 1024-byte-per-member limit. Reviews #899/#905/#1164 support a censored text-alphabet trial (one partial marker, no reported full block), correct the alphabet to 78 distinct bytes, and identify 2^32 uint32 m4 entries requiring 16 GiB payload before overhead. The source does not produce a collision, price expected success, or bound the shortest possible pair. Review #1164 and later return #2985 identify an implemented unrestricted-byte alternative; #2985 reports 387 qualifying first blocks in 889.75 CPU seconds and a server-verified 81+81-byte witness. These later observations prevent treating textcoll’s historical trial as the cost of the dBB route. The current issued collision summary already points to that alternative; no repeat block-1 pricing task is justified here.","assumptions_md":"Preserve HashClash commit 892f02e6e1faf71c4ae70ad98a98cc707d6ac664, the recorded alphabet, machine, setup and interruption settings, and review corrections. All-byte materialisation is an implementation/budget obstruction, not impossibility of unrestricted-byte dBB search. A partial marker is not a full first block or full 128-bit collision; block 2 and whole-route work remain outside #2886’s observations. Later #2985 timing is a historical reported measurement on a different implementation/machine, not a matched speedup or fresh execution here; numerical witness acceptance alone does not endorse all of its written method claims. Applicability covers construction/resource guidance, not completion of the minimum-length goal or exclusion of unequal lengths. No typed scope exists, so validated transfer remains unresolved and automatic transfer is unavailable.","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":7268,"input_sha256":"c4627338bc48269e7a5fcb683d8c5459d999f9fc76e3ce9a8553d0085e6bd289","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"0d1ff9ce65d2d937cff53a035a1d6b5a5b309eb4fdce067dd287c494a86a3745","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2886,"material_evidence":{"sha256":"a64a3ed3d5a8902fc3d46ad61bb7d2677c0bd220f9aa9aba8306d5934d145ea7","entries":{"return:2886":"61c531d53e341ecfaca1fa6f2afa755b53c2a81b19c3e8e5fb3f85763130957c","artifact:2886:1428251b58ea967bbaed59893f9fe88dc4cdc7c330b7a4dcb0ed248ff9534ca7":"1428251b58ea967bbaed59893f9fe88dc4cdc7c330b7a4dcb0ed248ff9534ca7","artifact:2886:3b80e99995132f59d5a53512408ccf35fb24350fcb9d7730cc62e319a6da47e9":"3b80e99995132f59d5a53512408ccf35fb24350fcb9d7730cc62e319a6da47e9","artifact:2886:7af0a76a6a8b27c6f62338da5f35e549c446424a90758e8ccff19a7c951276ec":"7af0a76a6a8b27c6f62338da5f35e549c446424a90758e8ccff19a7c951276ec","artifact:2886:7f57e337b11e97a09eaf6e81991491ab7a2f3727b64d6cb23ef18ce72ceff4c6":"7f57e337b11e97a09eaf6e81991491ab7a2f3727b64d6cb23ef18ce72ceff4c6","artifact:2886:8332872b8f93fa1c96398eadf63d34491837fd0fe31275b9e2c6df1f64cb0aca":"8332872b8f93fa1c96398eadf63d34491837fd0fe31275b9e2c6df1f64cb0aca","artifact:2886:99ed8d4dd854e6e3a1b4d9f87dd7354eb0ac634ea323bc0a5e85c950600695bc":"99ed8d4dd854e6e3a1b4d9f87dd7354eb0ac634ea323bc0a5e85c950600695bc","artifact:2886:9eb6a7ed8cf6c3a0b45a4e3c55b0b10a50e55caf5c480ccc2b54b6cb7fdc83d6":"9eb6a7ed8cf6c3a0b45a4e3c55b0b10a50e55caf5c480ccc2b54b6cb7fdc83d6","artifact:2886:a2ceeabc73322e94cd2a2ffd212b6eabebf2703d7edc1fff90caeaa05d4c2eb4":"a2ceeabc73322e94cd2a2ffd212b6eabebf2703d7edc1fff90caeaa05d4c2eb4","artifact:2886:b32ca157741299762a3e6e679cdbe7b16b52d703d9a16e5fce56ceff9a643188":"b32ca157741299762a3e6e679cdbe7b16b52d703d9a16e5fce56ceff9a643188","artifact:2886:d1e809ff4e55bb5767585a76221135fa0be21ddb971f99a5bb871cd340f96469":"d1e809ff4e55bb5767585a76221135fa0be21ddb971f99a5bb871cd340f96469","artifact:2886:f057a7f821227d5acc5f06fa00109b729efce301a8a066c03e710270f109f56f":"f057a7f821227d5acc5f06fa00109b729efce301a8a066c03e710270f109f56f"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2886,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T06:04:42.995Z","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 #2886: 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\":2886,\"report_sha256\":\"0d1ff9ce65d2d937cff53a035a1d6b5a5b309eb4fdce067dd287c494a86a3745\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2886\":\"61c531d53e341ecfaca1fa6f2afa755b53c2a81b19c3e8e5fb3f85763130957c\",\"artifact:2886:1428251b58ea967bbaed59893f9fe88dc4cdc7c330b7a4dcb0ed248ff9534ca7\":\"1428251b58ea967bbaed59893f9fe88dc4cdc7c330b7a4dcb0ed248ff9534ca7\",\"artifact:2886:3b80e99995132f59d5a53512408ccf35fb24350fcb9d7730cc62e319a6da47e9\":\"3b80e99995132f59d5a53512408ccf35fb24350fcb9d7730cc62e319a6da47e9\",\"artifact:2886:7af0a76a6a8b27c6f62338da5f35e549c446424a90758e8ccff19a7c951276ec\":\"7af0a76a6a8b27c6f62338da5f35e549c446424a90758e8ccff19a7c951276ec\",\"artifact:2886:7f57e337b11e97a09eaf6e81991491ab7a2f3727b64d6cb23ef18ce72ceff4c6\":\"7f57e337b11e97a09eaf6e81991491ab7a2f3727b64d6cb23ef18ce72ceff4c6\",\"artifact:2886:8332872b8f93fa1c96398eadf63d34491837fd0fe31275b9e2c6df1f64cb0aca\":\"8332872b8f93fa1c96398eadf63d34491837fd0fe31275b9e2c6df1f64cb0aca\",\"artifact:2886:99ed8d4dd854e6e3a1b4d9f87dd7354eb0ac634ea323bc0a5e85c950600695bc\":\"99ed8d4dd854e6e3a1b4d9f87dd7354eb0ac634ea323bc0a5e85c950600695bc\",\"artifact:2886:9eb6a7ed8cf6c3a0b45a4e3c55b0b10a50e55caf5c480ccc2b54b6cb7fdc83d6\":\"9eb6a7ed8cf6c3a0b45a4e3c55b0b10a50e55caf5c480ccc2b54b6cb7fdc83d6\",\"artifact:2886:a2ceeabc73322e94cd2a2ffd212b6eabebf2703d7edc1fff90caeaa05d4c2eb4\":\"a2ceeabc73322e94cd2a2ffd212b6eabebf2703d7edc1fff90caeaa05d4c2eb4\",\"artifact:2886:b32ca157741299762a3e6e679cdbe7b16b52d703d9a16e5fce56ceff9a643188\":\"b32ca157741299762a3e6e679cdbe7b16b52d703d9a16e5fce56ceff9a643188\",\"artifact:2886:d1e809ff4e55bb5767585a76221135fa0be21ddb971f99a5bb871cd340f96469\":\"d1e809ff4e55bb5767585a76221135fa0be21ddb971f99a5bb871cd340f96469\",\"artifact:2886:f057a7f821227d5acc5f06fa00109b729efce301a8a066c03e710270f109f56f\":\"f057a7f821227d5acc5f06fa00109b729efce301a8a066c03e710270f109f56f\"},\"sha256\":\"a64a3ed3d5a8902fc3d46ad61bb7d2677c0bd220f9aa9aba8306d5934d145ea7\"},\"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:2886,input_sha256:\"c4627338bc48269e7a5fcb683d8c5459d999f9fc76e3ce9a8553d0085e6bd289\",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/3622/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"44b83301a03231d2311719d7748c3201961e06de19e4332c8b2d14480e2fb1bc","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}