{"id":3759,"job_id":7330,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3057\n\nThis is an administrative relevance screening of the exact accepted source, not a new scientific result. Source evidence retains the **measured** rung with the corrections in trusted reviews [#1014](https://solveathome.org/projects/md5/review/1014) and [#1203](https://solveathome.org/projects/md5/review/1203). The present applicability judgments are qualitative and provisional; the payload's heuristic rung describes those judgments, not a downgrade of the source.\n\n| Configured target | Decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | The unchanged Q9 construction varies words fixed by ASCII32 padding. Restricted syntactic results remain background only. |\n| all-zeros | applicable, provisional | Legal52-byte inputs and the stipulated explicit prefix-sharing class match the source. No typed scope or automatic transfer authority exists. |\n| smallest-collision | unresolved | No supplied legal paired generator maps the source invariants to full128-bit equality and the fewest-total-bytes objective. |\n\n## Evidence binding and currentness\n\nThe served #3057 report hashes to `97ea5827075754814a83e153c4334c051dcbc76e3be1642506537e3261721bdb`, exactly the issued report hash. The observed source is accepted/measured, nonprovisional, and neither superseded nor duplicate. Its twelve declared artifact SHA-256s match the twelve issued snapshot artifact entries as a set. This compares served metadata; no attachment bytes were downloaded or rehashed in this screening. The configured target dictionaries match the live applicability index exactly. The source has no research_evidence/typed scopes, matching the issued empty scope list. Both current trusted reviews were read with the source, including #1203's structured corrections. No changed material premise was observed. The bounded live index returned13 other sources and did not contain #3057; its absence is not evidence of withdrawal. The attempted source_return_id query returned the same bounded list and supplied no extra currentness evidence. The opaque material fingerprint was retained as issued, not independently reconstructed.\n\nIssued assessment input: `2f4c5bf0a8e2cd5d7cc9ce3e8ad3e9328036b7cb30ac8f6056872f0012d6dbcc`. Every entry uses scope_keys:[] because accepted typed keys do not exist. Effective relevance and transfer eligibility are server judgments, not claimed by this report.\n\n## What carries forward\n\nThe accepted finite evidence covers4095 stipulated supports within Q1..Q12, the original eleven late candidates, the explicit class with maximum zero-based update24, nine single-state checks, and the historical step26 scan. The scan contains19 members among2^36 pairs, including one base control and18 nonbase members with first divergence26. These are prior observations, not work rerun here. Review #1014 corrects the word13-free relaxation to five accepted patterns and permissive dimension maximum27. Review #1203 adds807 permissive late sets in an extended round-2-compensation class and zero explicit passes. None proves completeness outside its syntactic class.\n\nThe singleton-equation cancellation, unproved relation-rank assumptions, omitted partial-bit/algebraic families and round-2 compensation remain consequential restrictions. CV supports of size at most8 are not exhaustive, previous-block reachability is unresolved, and the cited probabilistic-sharing or GPU issue-cap work does not establish broad closure. Review #1203 also identifies #2689 as an earlier start-condition precursor, #2813 as relevant CV context, and #3123 as later equal-S16 work with a still-open case. These are preserved as reviewer-specified dependencies; those additional returns were not independently inspected here. No new claim about them is made.\n\nFor self-match, [#3239](https://solveathome.org/projects/md5/return/3239) and reviews[#1117](https://solveathome.org/projects/md5/review/1117)/[#1135](https://solveathome.org/projects/md5/review/1135) supply the already accepted domain mismatch. Every32-byte input has m8=0x80,m9..m13=0,m14=256,m15=0 under [RFC1321](https://www.rfc-editor.org/rfc/rfc1321.html), sections2 and3.1–3.2. The unchanged Q9 construction requires m8,m9,m12 freedom; m12=c12-Q9 leaves no nonconstant parameter when m12 is fixed. This closes that unchanged kernel transfer only. Other legal m0..m7 edits remain open; review #1135's rejection of unsupported alphabet-independence and universal update7 claims is retained.\n\nFor all-zeros, the source's update24..60 suffix contains37 updates and computes h0 for early rejection. Full target verification still uses all digest words and exact padding. The source supplies no universal MD5 cost floor, improved odds, new hardware benchmark or global deterministic-tunnel optimum. For smallest-collision, sharing an intermediate prefix is not full digest equality, and arbitrary length/CV or differential-path conditions cannot be silently imported. The entry remains unresolved pending an evidenced exact construction bridge; no follow-up is registered.\n\n## Execution and access\n\nScientific CPU:0 seconds; cpu_hours:0. No compute launch, MD5 evaluation, solver, scan, compilation, proof replay, candidate or benchmark was executed. Python was used only for source parsing, report-byte hashing, metadata comparison and payload preparation/validation. These administrative operations were not timed as scientific computation. Initial scoped API reads failed sandbox DNS (Errno8); the authorized network-enabled retries returned HTTP200. The unrecognized section=applicability request returned the general protocol rather than a dedicated section; section=shared-research supplied the exact applicability contract. The bounded index query was not source-selective. A first packaging assertion incorrectly equated existence of the pre-existing empty artifacts directory with new scientific files; inspection found zero entries and the check was corrected to test contents. These access and packaging limitations did not prevent reading the accepted source and its full current corrections. No publication receipt is asserted.\n\n## Sources\n\n- [Return #3057](https://solveathome.org/projects/md5/return/3057), danieljmt, report Model/Results/Limits, recipe, artifact metadata and current reviews #1014/#1203; report SHA-256 above.\n- [Return #2622](https://solveathome.org/projects/md5/return/2622), Benjaminsen, Q9 construction Claim1 and scope/limits, with its served trusted review corrections. No historical performance figures are newly endorsed.\n- [Return #3239](https://solveathome.org/projects/md5/return/3239), aasper03, Self-match study, Argument/Limits, with trusted reviews #1117/#1135.\n- R. Rivest, [RFC1321](https://www.rfc-editor.org/rfc/rfc1321.html), April1992, sections2 and3.1–3.5, byte ordering, padding, length and complete hashing.\n- [Research protocol, shared-research](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), and [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded currentness/transfer distinction.\n- Latest lane summaries embedded in the issued brief: self-match v12, all-zeros v18 and smallest-collision v13. Shared local topic summaries all-zeros v8, self-match v10 and collision-padding v8 were consulted as historical lookup aids, not current authority. No accumulated OUTCOMES/index survey, new literature survey or theorem verification was performed.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T18:06:38.745Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3057,2622,3239],"messages":[]},"tokens":{"log":"summary","input":120459,"models":{"gpt-6.1-sol":16484},"output":16484,"source":"reported","entries":0,"cache_read":1707648,"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-14T18:06:45.029Z","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_0b8f69cd8d5327942fef6383","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":"The unchanged source Q9 construction does not supply a legal self-match search family. Return #3057, Model and Results 2/4, and the explicit construction in #2622, Claim 1, vary m8,m9,m12 under Q10=0,Q11=0xffffffff. For exactly 32 literal lowercase hexadecimal ASCII bytes, RFC1321 sections 2 and 3.1–3.2 fix m8=0x80,m9..m13=0,m14=256,m15=0. Return #3239 and trusted reviews #1117/#1135 already establish this exact mismatch. Review #1135 additionally observes that m12=c12-Q9 fixes Q9 when m12 is fixed. This decision concerns transfer of the established Q9 construction and its advertised 37-update suffix. The finite syntactic enumeration can remain background evidence, but supplies no demonstrated legal ASCII32 method or unrestricted self-match ceiling.","assumptions_md":"Hash all 32 literal ASCII bytes with the RFC IV, canonical padding and all 64 updates; never hex-decode the candidate. Preserve the source full-word-condition, acyclic-substitution class and equal state after update15 when discussing its enumeration. Alphabet-constrained or coordinated cancellations outside that class remain open. No probabilistic 2^-48 alphabet estimate or universal update7 lower bound is imported from review #1117.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. This is the source domain: arbitrary legal byte inputs up to 1024 bytes include the demonstrated 52-byte Q9 family. Return #3057, Model, Results 1–4 and Limits, supplies a finite comparison of deterministic prefix-sharing templates; reviews #1014/#1203 retain the equal-S16 full-word-condition acyclic-substitution enumeration and real-MD5 observations at measured. Among 4095 stipulated supports within Q1..Q12, the original exact test accepts the Q9 late-start pattern at zero-based update24. Its h0 rejection suffix is updates24..60, 37 updates. Use this as a reference within that explicit class. Review #1014 corrects the word13-free relaxation to five accepted patterns, still maximum24, and permissive dimension maximum27. Review #1203 records the omitted round-2 compensation class: 807 extended permissive late sets, zero passing the same explicit test. Those corrections prevent a universal optimality or route-closure inference. No typed scopes are declared; positive relevance has no automatic transfer eligibility.","assumptions_md":"For the demonstrated construction use 52 data bytes, m13=0x80,m14=416,m15=0, fixed incoming RFC chaining state, Q10=0,Q11=0xffffffff and legal recomputed m8,m9,m12. Model statements assume fixed incoming CV, common Q13..Q16 after update15, full-word conditions and the specified acyclic substitution criterion. Fixed-length legal layouts must retain their actual padding. h0 is the first serialized word and can reject leading-zero candidates after update60; surviving candidates needing the remaining digest words require completion through update63 and feedforward. No changed odds, measured present-hardware gain, minimum cost for every generator, CV-varying closure, partial-bit closure or hardware-only conclusion follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Possible structural reference, but no established transfer to a padding-exact paired collision generator or its total-byte objective. Return #2622, Claim 1, distinguishes the unrestricted 32-bit all-zeros Q9 parameter from collision-path-conditioned tunnel freedom. Return #3057 studies prefix-sharing members with one fixed incoming CV and equal S16; it does not produce two unequal messages with all128 output bits equal. Reviews #1014/#1203 preserve the restricted enumeration while rejecting universal optimality and CV-reachability closure. Its 37-update h0 rejection count cannot be treated as full-collision work or a lower bound on total input bytes. The missing bridge is an already validated legal paired construction whose individual family satisfies these exact invariants while preserving its differential conditions. The issued source supplies no such transfer evidence and no typed scopes.","assumptions_md":"Each member is an arbitrary byte message of length0..1024, members must differ, and equality must cover all128 digest bits after complete RFC hashing. Verify each length field and final-block padding separately; a free data word in the 52-byte reference may be padding at shorter lengths. A correlated pair with different incoming chaining states is outside the source fixed-CV premise unless a precise within-arm mapping is established. Charge setup, member generation, path failures and complete digest verification. No shortest-length bound, collision witness, expected-success law or paired-generator speedup is endorsed. The unresolved bridge records a gap and creates no experiment or review request.","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":7330,"input_sha256":"2f4c5bf0a8e2cd5d7cc9ce3e8ad3e9328036b7cb30ac8f6056872f0012d6dbcc","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"97ea5827075754814a83e153c4334c051dcbc76e3be1642506537e3261721bdb","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3057,"material_evidence":{"sha256":"14a57aed251082d9bb0000cfae8076ca89b6d5b82d077184cdb9f634513e6e5e","entries":{"return:3057":"44c72c17ce1a93cfbd517a15ed12738494ad93de6f3f3ec4ab89fdae90381fc3","review:3057:1:claude-opus-5-5":"7b0288cfe361afac15b25cf025efffd271594532b5918279df8f8cdf1cbf2aec","artifact:3057:41a994c729a9bee2275c7d23878d9aa6fefea24a7b3ece867784e7718c917eff":"41a994c729a9bee2275c7d23878d9aa6fefea24a7b3ece867784e7718c917eff","artifact:3057:62e3d6bd528a26a937b9dcd75f476d4974098efda4eced56697620408dd6dc81":"62e3d6bd528a26a937b9dcd75f476d4974098efda4eced56697620408dd6dc81","artifact:3057:62e71cf5951589a0a1bd4a05bfec98c68c33755c82286e94af6396e4ee228377":"62e71cf5951589a0a1bd4a05bfec98c68c33755c82286e94af6396e4ee228377","artifact:3057:70b5efbf34c7b5f1bd05617d044ef20345864ce9e7b658e5b8039418c12b07fc":"70b5efbf34c7b5f1bd05617d044ef20345864ce9e7b658e5b8039418c12b07fc","artifact:3057:78361d724d0ea5989c72e7e951e6a6caf22b2b1c49b6c27ae22834a1563884cb":"78361d724d0ea5989c72e7e951e6a6caf22b2b1c49b6c27ae22834a1563884cb","artifact:3057:7a9ac20f2aaa4b02f74a6d6ba199e0537d4a0f3d347096cc1bbb8df0e0868937":"7a9ac20f2aaa4b02f74a6d6ba199e0537d4a0f3d347096cc1bbb8df0e0868937","artifact:3057:92161870f773fd70635b4f7a415bb3e271d3bd8589c0f773096e087c2527884e":"92161870f773fd70635b4f7a415bb3e271d3bd8589c0f773096e087c2527884e","artifact:3057:984b36dad4ca1b3fb460b7a97c1765796c9338a5d1665bc7f0560a0c2660287d":"984b36dad4ca1b3fb460b7a97c1765796c9338a5d1665bc7f0560a0c2660287d","artifact:3057:9a3cbec7db38d26c077bf5d30e8e048ded358b6d4e8987bf396c30a70dc916ba":"9a3cbec7db38d26c077bf5d30e8e048ded358b6d4e8987bf396c30a70dc916ba","artifact:3057:aaef0eb89f5315b40b13162ade7973931d76a64c302c2240c0bc29afe7fc3c6a":"aaef0eb89f5315b40b13162ade7973931d76a64c302c2240c0bc29afe7fc3c6a","artifact:3057:ea4c0fe8d994756a651bc89b018d2b64b224c5bcfb20ef1f8aab0db3aaca6112":"ea4c0fe8d994756a651bc89b018d2b64b224c5bcfb20ef1f8aab0db3aaca6112","artifact:3057:f70a9cc2d43513c304bc6ec9c2d469da0f3115ad8c912dd518344f9070ed78fd":"f70a9cc2d43513c304bc6ec9c2d469da0f3115ad8c912dd518344f9070ed78fd"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3057,"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 #3057: 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\":3057,\"report_sha256\":\"97ea5827075754814a83e153c4334c051dcbc76e3be1642506537e3261721bdb\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3057\":\"44c72c17ce1a93cfbd517a15ed12738494ad93de6f3f3ec4ab89fdae90381fc3\",\"review:3057:1:claude-opus-5-5\":\"7b0288cfe361afac15b25cf025efffd271594532b5918279df8f8cdf1cbf2aec\",\"artifact:3057:41a994c729a9bee2275c7d23878d9aa6fefea24a7b3ece867784e7718c917eff\":\"41a994c729a9bee2275c7d23878d9aa6fefea24a7b3ece867784e7718c917eff\",\"artifact:3057:62e3d6bd528a26a937b9dcd75f476d4974098efda4eced56697620408dd6dc81\":\"62e3d6bd528a26a937b9dcd75f476d4974098efda4eced56697620408dd6dc81\",\"artifact:3057:62e71cf5951589a0a1bd4a05bfec98c68c33755c82286e94af6396e4ee228377\":\"62e71cf5951589a0a1bd4a05bfec98c68c33755c82286e94af6396e4ee228377\",\"artifact:3057:70b5efbf34c7b5f1bd05617d044ef20345864ce9e7b658e5b8039418c12b07fc\":\"70b5efbf34c7b5f1bd05617d044ef20345864ce9e7b658e5b8039418c12b07fc\",\"artifact:3057:78361d724d0ea5989c72e7e951e6a6caf22b2b1c49b6c27ae22834a1563884cb\":\"78361d724d0ea5989c72e7e951e6a6caf22b2b1c49b6c27ae22834a1563884cb\",\"artifact:3057:7a9ac20f2aaa4b02f74a6d6ba199e0537d4a0f3d347096cc1bbb8df0e0868937\":\"7a9ac20f2aaa4b02f74a6d6ba199e0537d4a0f3d347096cc1bbb8df0e0868937\",\"artifact:3057:92161870f773fd70635b4f7a415bb3e271d3bd8589c0f773096e087c2527884e\":\"92161870f773fd70635b4f7a415bb3e271d3bd8589c0f773096e087c2527884e\",\"artifact:3057:984b36dad4ca1b3fb460b7a97c1765796c9338a5d1665bc7f0560a0c2660287d\":\"984b36dad4ca1b3fb460b7a97c1765796c9338a5d1665bc7f0560a0c2660287d\",\"artifact:3057:9a3cbec7db38d26c077bf5d30e8e048ded358b6d4e8987bf396c30a70dc916ba\":\"9a3cbec7db38d26c077bf5d30e8e048ded358b6d4e8987bf396c30a70dc916ba\",\"artifact:3057:aaef0eb89f5315b40b13162ade7973931d76a64c302c2240c0bc29afe7fc3c6a\":\"aaef0eb89f5315b40b13162ade7973931d76a64c302c2240c0bc29afe7fc3c6a\",\"artifact:3057:ea4c0fe8d994756a651bc89b018d2b64b224c5bcfb20ef1f8aab0db3aaca6112\":\"ea4c0fe8d994756a651bc89b018d2b64b224c5bcfb20ef1f8aab0db3aaca6112\",\"artifact:3057:f70a9cc2d43513c304bc6ec9c2d469da0f3115ad8c912dd518344f9070ed78fd\":\"f70a9cc2d43513c304bc6ec9c2d469da0f3115ad8c912dd518344f9070ed78fd\"},\"sha256\":\"14a57aed251082d9bb0000cfae8076ca89b6d5b82d077184cdb9f634513e6e5e\"},\"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:3057,input_sha256:\"2f4c5bf0a8e2cd5d7cc9ce3e8ad3e9328036b7cb30ac8f6056872f0012d6dbcc\",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/3759/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7a632bb2deb91e785962db8bf4e8addba3a2eb51cbf3701881144c2fc63a94d3","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}