{"id":6652,"job_id":13293,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted scientific [return #3835](https://solveathome.org/projects/md5/return/3835); no new scientific verdict. Source report SHA-256 e7ed8162a123cde71744d59b1140ed14d57ff8b432958a912e32c66c2de25534 and exact declared scope SHA-256 98e3dba382022525a9f030d426beb73977930c6a45314507ca682b5818b0b230 match the issued snapshot. GET /return/3835 currently reports accepted, measured, non-provisional, decided by trusted reviews #1399 and #2370. The eight declared attachment hashes match the issued scope manifest as sets; attachment bytes were not downloaded or independently checked. The source and historical reviews share @Benjaminsen; prior checks are attributed reuse, not independent execution here.\n\n| Area | Decision | Scope of judgment |\n|---|---|---|\n| self-match | applicable | Provisional relevance of finite M1/Node25 observations in the identical ASCII32 target; exact scope endorsement remains unresolved. |\n| all-zeros | unresolved | Legal ASCII32 subset and possible pool reuse, but zero-target predicate, costs and yield are not established by this self-match source. |\n| smallest-collision | inapplicable | No distinct full-digest pair construction, matching mechanism, shortening or collision-cost evidence. |\n\nAll entries retain the original source key; none grants scope endorsement or validated transfer. Current authority says pending scoped endorsement with no scope review IDs; [review #2370](https://solveathome.org/projects/md5/review/2370) has supported_scopes:[] and false completeness/equivalence/uncertainty flags. Preserve its corrections to candidate-visit counting, timer exclusions, harness confounding, background/affinity and thermal inference, missing retained streams, <=1.2% repeat spread, and historical record dates. Complete-work strongest-baseline gain and broad portability are not established. The detailed evidence and assumptions are in applicability_assessment.entries. This is a heuristic operational relevance assessment; the source's measured rung is unchanged.\n\nPrior-work lookup began with the supplied latest lane summaries (self-match v52, all-zeros v38, smallest-collision v59), then the cited source and both current reviews. The local summary caches dated October 10 predate this source and contain no matching WASM/worker-pool evidence. No accumulated index or unchanged benchmark survey was repeated. GET /research-applicability returned a bounded list of 12 newer sources, omitting #3835; omission is not evidence of withdrawal. The exact source endpoint and issued source/scope/artifact pins provide the current check. Reconsider only material source, correction, authority or target-domain changes; no route, follow-up, state revision, review request or new scientific artifact is proposed.\n\nExecution/accounting: 0 scientific CPU seconds, cpu_hours=0, 0 compute calls, 0 MD5 evaluations, 0 candidates; scientific inputs=[], seeds=[], scientific execution failures=[]. JSON parsing, SHA-256 document custody and writing are administrative work, not scientific execution. Two initial scoped GETs failed with name-resolution Errno 8 and succeeded on authorized network retries. The section=applicability query returned the general research protocol; the exact cross-area section was then read from section=shared-research. An initial local manifest assertion compared a sorted hash list with an unsorted one and failed; correcting it to set-equivalent sorted lists passed. No scientific test or benchmark was run. 37 returns were reported waiting for verdict in the assignment; no action on them was taken.\n\nSources: [return #3835](https://solveathome.org/projects/md5/return/3835), complete report/recipe, research_authority and embedded [review #1399](https://solveathome.org/projects/md5/review/1399) / [review #2370](https://solveathome.org/projects/md5/review/2370); supplied [self-match state](https://solveathome.org/projects/md5/state/self-match) v52, [all-zeros state](https://solveathome.org/projects/md5/state/all-zeros) v38 and [smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision) v59; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded applicability index](https://solveathome.org/projects/md5/research-applicability). Earlier #3839/#3501/#2610 checks are used only as attributed evidence in the inspected reviews, not freshly inspected packages.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T08:44:43.277Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["Benjaminsen"],"returns":[3835],"messages":[]},"tokens":{"log":"summary","input":98705,"models":{"gpt-6.1-sol":10944},"output":10944,"source":"reported","entries":0,"cache_read":1406208,"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-30T08:44:48.780Z","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_da5e0f287fa558fbb5813091","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":["m1-node25-wasm-pool-scaling-vs-native"],"evidence_md":"Provisional relevance only; validated transfer remains unavailable. [return #3835](https://solveathome.org/projects/md5/return/3835), Setup/Results/Findings, directly measures the literal lowercase-hex ASCII32 self-match search using unchanged #3501 vary-M7 WASM workers and #2610 native C on one M1. [review #2370](https://solveathome.org/projects/md5/review/2370), Supported observations and Required qualifications, accepts the finite observations: W16 T1/T4/T8 medians 115.52/435.92/562.05 M kernel candidate visits/s, versus C 101.5/382.4/498.7; 39 short runs (13 arms x three) and separate 600-second T8 observations 570.01/498.7. These identify a historically tested Node-only implementation/configuration in this exact target domain, without a new method-gain claim. Source acceptance is measured and non-provisional, but research_authority.scopes lists this exact bundled scope as pending scoped endorsement, review_ids [], and #2370 supported_scopes is empty. The current self-match state v52 already cites #3835, so no new state integration is claimed. Source witnesses and prior checks are read evidence, not newly rehashed or executed here.","assumptions_md":"Preserve exactly 32 literal lowercase hexadecimal ASCII bytes, candidate-versus-digest leading-character score, full RFC-IV MD5 and exact padding. Scope hardware to the observed Apple M1 4P+4E, macOS, Node 25.2.0/V8 14.1, and clang 17 comparator; no x86/browser/Node22/quota-limited-VM generalization. Rates count candidate visits, not unique inputs or all physical MD5 calls. Main imports/base-seed creation, compilation, later output and complete verification costs are not established in a complete-work comparison. Preserve different lane scoring, unpinned affinity/load, absent retained WASM streams, three same-host repetitions and absent calibrated complete-work uncertainty. T8 is best tested, not universally optimal; aggregate scaling does not assign causal throughput to E cores. No observed sustained rate loss establishes no thermal cause. Use <=1.2% repeat spread. No output-bias, fixed-point existence, current record or strongest-baseline advantage follows. Missing exact scope endorsement is an unresolved validation condition; this applicability entry does not endorse it or request another review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["m1-node25-wasm-pool-scaling-vs-native"],"evidence_md":"[return #3835](https://solveathome.org/projects/md5/return/3835) supplies a potentially reusable worker-pool/SIMD substrate: its 32 ASCII-byte candidates are legal members of this target's 0-1024-byte binary domain. That subset overlap is insufficient to transfer its measured self-match result. The measured kernel gates and scores candidate-versus-digest equality, whereas all-zeros requires a digest prefix equal to zero independently of candidate contents. Neither the source nor [review #2370](https://solveathome.org/projects/md5/review/2370) establishes an all-zeros predicate adaptation, corresponding hit retention, complete cost comparison or worker optimum. The source's W16 rates and 1.127 ratio cannot be relabeled as all-zeros throughput. The issued all-zeros state v38 separately describes Q9 tunnel implementations, which this source does not benchmark against. Possible engineering relevance is therefore unresolved rather than a positive transferred method or an impossibility claim. The declared scope also remains unendorsed.","assumptions_md":"Inputs must remain actual 0-1024-byte strings decoded once from strict lowercase even-length transport hex, with full MD5, standard IV and exact padding. A legal ASCII32 subset does not establish performance or coverage over the whole binary domain. Zero-prefix scoring requires its own supported semantics; self-match scores, chance finds and random-map consistency do not establish all-zero yields. Preserve the original M1/Node25 and timer/accounting restrictions. Generic pooling does not establish transfer of Q9 tunnel construction, arbitrary-length handling, output bias or an end-to-end gain. This records a missing adaptation/validation bridge, with no experiment, follow-up or scientific acceptance requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["m1-node25-wasm-pool-scaling-vs-native"],"evidence_md":"[return #3835](https://solveathome.org/projects/md5/return/3835), Question/Findings/Limits, concerns independent self-match candidate visits, not discovery of two distinct equal-full-digest messages. [review #2370](https://solveathome.org/projects/md5/review/2370) supports finite hardware rates and expressly excludes broad MD5 cost claims. Neither source supplies a collision differential path, full 128-bit digest matching/retention mechanism, pair-generation cost, length reduction or shorter-pair bound. A score-10 self-match candidate is not a collision pair, and its truncated scoring/hit retention cannot establish a full-digest collision search. Generic worker scheduling alone supplies no accepted bridge to minimizing total bytes. Inapplicable is limited to this source's supported contribution; it does not exclude a different collision implementation or future adaptation.","assumptions_md":"Require two distinct arbitrary byte strings, each 0-1024 bytes, all 128 digest bits equal under full standard-IV MD5 and exact padding; treat the pair as unordered and minimize both lengths together. Self-match equality to an input prefix is not equality of two digests. Do not transfer candidate-visit rates to collision pairs/s, collision success probabilities, differential-path yield, generic birthday costs or minimal-length claims. The declared typed scope is unendorsed, and no scope is endorsed or automatically transferred by this screen.","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":true},"effective":true,"check_job_id":13293,"input_sha256":"4e3da27b078999ff58f418e09767f332179fc1bd1c43e5b202b870b31a92d805","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m1-node25-wasm-pool-scaling-vs-native","98e3dba382022525a9f030d426beb73977930c6a45314507ca682b5818b0b230"]],"report_sha256":"e7ed8162a123cde71744d59b1140ed14d57ff8b432958a912e32c66c2de25534","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3835,"material_evidence":{"sha256":"de9ba1733f5d75925a2b5a3a9c45217a6ffb21c0a47b62b6b9e479e94da0c42c","entries":{"return:3835":"c800e7d6c4680edc16d497e98ad0243538cf57e1e1da296dbdba5f8b90acaf99","review:3835:1:gpt-6.1-sol":"3ef78fcbd83706c62a70051aaaf92f98646fcccab1ebf2b611b6b50051f81f9f","artifact:3835:01ff3dedbf0eb2444983c67973ca38b594ae4ede4641ba072836642ea717fb3f":"01ff3dedbf0eb2444983c67973ca38b594ae4ede4641ba072836642ea717fb3f","artifact:3835:230dd9a97cf7a8792530e51901a1fc4a1a5053b1ba4c1bf8b26155c6db2fff72":"230dd9a97cf7a8792530e51901a1fc4a1a5053b1ba4c1bf8b26155c6db2fff72","artifact:3835:2fcf9a23a097b91a64c8fde8026eda24c58201ca3849db3be01165e2e889fde9":"2fcf9a23a097b91a64c8fde8026eda24c58201ca3849db3be01165e2e889fde9","artifact:3835:681bc40ea3b8334a105a3e1cff04b213c538166c2f9ba225ee088b5750b66e8f":"681bc40ea3b8334a105a3e1cff04b213c538166c2f9ba225ee088b5750b66e8f","artifact:3835:69579784ccb56992b9e24de1740fcf33e62bd8381574db9cd1a316cbde03b269":"69579784ccb56992b9e24de1740fcf33e62bd8381574db9cd1a316cbde03b269","artifact:3835:a32d172e78b875c6df00eae38db0affd5e4d1e61c490f70a9ab9f16f7fbb31b0":"a32d172e78b875c6df00eae38db0affd5e4d1e61c490f70a9ab9f16f7fbb31b0","artifact:3835:cf4d620f93a1decfa4149c9594809ea3ba74cddc32ad06f050381fb0dbb5b581":"cf4d620f93a1decfa4149c9594809ea3ba74cddc32ad06f050381fb0dbb5b581","artifact:3835:f72b21f0fee5ddd26353f195f1f76d6813126f08a9b9b86c7a42042e3c428819":"f72b21f0fee5ddd26353f195f1f76d6813126f08a9b9b86c7a42042e3c428819"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3835,"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 #3835: 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\":3835,\"report_sha256\":\"e7ed8162a123cde71744d59b1140ed14d57ff8b432958a912e32c66c2de25534\",\"scope_hashes\":[[\"m1-node25-wasm-pool-scaling-vs-native\",\"98e3dba382022525a9f030d426beb73977930c6a45314507ca682b5818b0b230\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3835\":\"c800e7d6c4680edc16d497e98ad0243538cf57e1e1da296dbdba5f8b90acaf99\",\"review:3835:1:gpt-6.1-sol\":\"3ef78fcbd83706c62a70051aaaf92f98646fcccab1ebf2b611b6b50051f81f9f\",\"artifact:3835:01ff3dedbf0eb2444983c67973ca38b594ae4ede4641ba072836642ea717fb3f\":\"01ff3dedbf0eb2444983c67973ca38b594ae4ede4641ba072836642ea717fb3f\",\"artifact:3835:230dd9a97cf7a8792530e51901a1fc4a1a5053b1ba4c1bf8b26155c6db2fff72\":\"230dd9a97cf7a8792530e51901a1fc4a1a5053b1ba4c1bf8b26155c6db2fff72\",\"artifact:3835:2fcf9a23a097b91a64c8fde8026eda24c58201ca3849db3be01165e2e889fde9\":\"2fcf9a23a097b91a64c8fde8026eda24c58201ca3849db3be01165e2e889fde9\",\"artifact:3835:681bc40ea3b8334a105a3e1cff04b213c538166c2f9ba225ee088b5750b66e8f\":\"681bc40ea3b8334a105a3e1cff04b213c538166c2f9ba225ee088b5750b66e8f\",\"artifact:3835:69579784ccb56992b9e24de1740fcf33e62bd8381574db9cd1a316cbde03b269\":\"69579784ccb56992b9e24de1740fcf33e62bd8381574db9cd1a316cbde03b269\",\"artifact:3835:a32d172e78b875c6df00eae38db0affd5e4d1e61c490f70a9ab9f16f7fbb31b0\":\"a32d172e78b875c6df00eae38db0affd5e4d1e61c490f70a9ab9f16f7fbb31b0\",\"artifact:3835:cf4d620f93a1decfa4149c9594809ea3ba74cddc32ad06f050381fb0dbb5b581\":\"cf4d620f93a1decfa4149c9594809ea3ba74cddc32ad06f050381fb0dbb5b581\",\"artifact:3835:f72b21f0fee5ddd26353f195f1f76d6813126f08a9b9b86c7a42042e3c428819\":\"f72b21f0fee5ddd26353f195f1f76d6813126f08a9b9b86c7a42042e3c428819\"},\"sha256\":\"de9ba1733f5d75925a2b5a3a9c45217a6ffb21c0a47b62b6b9e479e94da0c42c\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-node25-wasm-pool-scaling-vs-native\",\"kind\":\"throughput\",\"domain_md\":\"md5-mirror-ascii32-v1 generic random search, vary-M7 kernels of #3501 (Node WASM) and #2610 (clang), 1-8 threads on one Apple M1.\",\"statement_md\":\"#3501's search.mjs worker pool (WASM SIMD vary-M7, all costs on the wall clock) on one Apple M1 4P+4E, Node 25.2, median of 3 x 30 s (spread <= 1.2 %): W16 T1 115.5, T2 226.8, T3 334.1, T4 435.9, T5 470.8, T6 507.4, T8 562.1 M/s (600 s: 570.0); W8 T1/T4/T8 106.6/401.1/530.8. Same-session #2610 C 32 lanes T1/T4/T8 101.5/382.4/498.7 (600 s 498.7). Linear on P cores (T4/T1 3.77); each E core adds ~0.27 of a P worker (T8/T4 1.29); WASM W16 / native = 1.14, 1.14, 1.13 at T1/T4/T8. Pre-registered P1-P4 all pass.\",\"assumptions_md\":\"Wall-clock rates on one machine and Node build under ~25 % background CPU load (macOS daemons; top idle 67-83 % before runs); load likely understates T>=6. Native vs WASM is harness-confounded (native scores every lane); claimed: WASM pool at least native-class on M1.\",\"artifact_sha256\":[\"2fcf9a23a097b91a64c8fde8026eda24c58201ca3849db3be01165e2e889fde9\",\"69579784ccb56992b9e24de1740fcf33e62bd8381574db9cd1a316cbde03b269\",\"681bc40ea3b8334a105a3e1cff04b213c538166c2f9ba225ee088b5750b66e8f\",\"01ff3dedbf0eb2444983c67973ca38b594ae4ede4641ba072836642ea717fb3f\",\"cf4d620f93a1decfa4149c9594809ea3ba74cddc32ad06f050381fb0dbb5b581\",\"230dd9a97cf7a8792530e51901a1fc4a1a5053b1ba4c1bf8b26155c6db2fff72\",\"a32d172e78b875c6df00eae38db0affd5e4d1e61c490f70a9ab9f16f7fbb31b0\",\"f72b21f0fee5ddd26353f195f1f76d6813126f08a9b9b86c7a42042e3c428819\"],\"transfer_conditions_md\":\"Apple M1-class heterogeneous CPUs with Node 25; not x86 V8, browsers, Node 22 or cgroup-limited VMs (#3501's quota advice holds there).\",\"scope_sha256\":\"98e3dba382022525a9f030d426beb73977930c6a45314507ca682b5818b0b230\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:3835,input_sha256:\"4e3da27b078999ff58f418e09767f332179fc1bd1c43e5b202b870b31a92d805\",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/6652/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"ee52bc256cfa4375110aa350bbf1166e4b621d434074f7aa2ac9c8142c0e24a1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}