## miden::core::sys::vm::claim
| Procedure | Description |
| ----------- | ------------- |
| claim_commitment | Computes the canonical claim commitment (CLAIM_HASH) over a claim region.<br /><br />The region must hold the fully populated 40-felt claim encoding P ‖ K ‖ I ‖ O. The commitment<br />names the claim: it forms proof-request keys and binds verified claims into a consumer's own<br />statement. The procedure verifies nothing.<br /><br />Inputs: [claim_ptr, ...]<br />Outputs: [CLAIM_HASH, ...]<br /><br />Where:<br />- claim_ptr is the word-aligned address of the claim region.<br />- CLAIM_HASH is the domain-tagged Poseidon2 hash of the 40-element encoding.<br /> |
| kernel_commitment | Computes the canonical kernel commitment over a raw kernel-procedure digest list.<br /><br />Mirrors miden_core::program::KernelDescriptor::commitment: the domain-tagged sequential hash<br />of the flattened digests, length-bound by the sponge's padding rule, in the descriptor's<br />canonical order.<br /><br />Inputs: [kernel_ptr, num_kernel_digests, ...]<br />Outputs: [K, ...]<br /><br />Where:<br />- kernel_ptr is the word-aligned address of the digest list.<br />- num_kernel_digests is the number of digests (words) in the list.<br />- K is the kernel commitment.<br /> |
| request_key | Computes the advice-map key addressing a proof package for a claim under a verifier.<br /><br />The key is the domain-tagged hash of `claim_commitment ‖ verifier_root` (exactly one rate<br />block, so a single permutation with no memory). It is a lookup address, not a trust anchor:<br />the verifier re-checks the retrieved package, so a wrong package fails verification. Both<br />inputs are program-owned (the verifier's MAST root via `procref`; the claim commitment via<br />`claim_commitment` or the program's own inputs) — neither comes from advice. Mirrors<br />miden_core::program::request_key.<br /><br />Inputs: [VERIFIER_ROOT, CLAIM_COMMITMENT, ...]<br />Outputs: [REQUEST_KEY, ...]<br /> |