{"format":"hunch-receipt-v1","algorithm":"Ed25519","key_id":"149adbcaadcde04921fe70bc2e2dcec91c2632606d702595eea6481a11ba9880","payload":{"schema":"hunch-verification-v1","issuer":"https://hunchroom.com","job_id":"job_7c2ff4167b4f316855667ac14bce98260568e3211f4211eb250e27638fcf63f0","checked_at":"2026-10-08T08:28:31.286Z","target":{"kind":"submission","id":27,"problem_id":41,"statement_hash":"45102619ca626c643eb843a3c4e58734b2a5280bf82e54b516d05aa43a1c3719","module_hash":null},"challenge":{"statement":"(fun (priorityAt : List Nat → Nat → Nat) =>\n(fun (nearestLeft : List Nat → Nat → Option Nat) =>\n(fun (nearestRight : List Nat → Nat → Option Nat) =>\n(fun (nextSameLeft : List Nat → Nat → Option Nat) =>\n(fun (groupRight : List Nat → Nat → Option Nat) =>\n∀ (a : List Nat), a.Nodup → ∀ i, i < a.length → nearestRight a i = groupRight a i\n) (fun a i => match nextSameLeft a i with | some j => some j | none => (nearestLeft a i).bind (nearestRight a))\n) (fun a i => (List.range a.length).find? (fun j => decide (i < j ∧ nearestLeft a j = nearestLeft a i)))\n) (fun a i => (List.range a.length).find? (fun j => decide (i < j ∧ priorityAt a j < priorityAt a i)))\n) (fun a i => (List.range i).reverse.find? (fun j => decide (priorityAt a j < priorityAt a i)))\n) (fun a i => (a[i]?).getD 0)","profile":"core","module_pins":[]},"source":{"sha256":"40d60cb76ce9fbbdfa367b72f72ef461c9399dd1e30bcf11e35d834d6c09bae9","bundle_url":"https://hunchroom.com/api/v1/problems/41/bundle?submission=27","url":"https://hunchroom.com/api/v1/submissions/27/source"},"policy":"oa-lean-v1","runtime":null,"dependencies":[],"axioms":[],"primary":{"implementation":"Lean kernel","execution":"isolated WebAssembly","status":"capacity","legacy":true},"secondary":{"implementation":"Nanoda","status":"not_run"},"statement_meaning":"Requires independent review; legacy runtime artifact hashes were not recorded."},"signature":"c9142d4cfac086161fb069e35e45a6cfed57a6c01c8a72209680d1fbc237f57c35b0cb0c1a3fd5338dc047c904321f329a14506f8dc22f4fe093a4d107460f0e"}