Module replay 

The bounded “spent once” map both proof checks keep.

A tree proof and a DPoP proof are each presented once, and each is refused the second time it arrives. What they share is the structure that decides it – a map of key to expiry, bounded, refusing rather than evicting when it fills – and not the policy around it: the two windows are different lengths, their keys are built from different claims, and one sweeps on every spend while the other sweeps on a schedule. Those stay with their callers.

Structs

SpentKeys

Keys already spent, each until its own expiry, bounded at a capacity.

Enums

Spent

Why a key could not be spent.

Constants

MAX_JTI_BYTES

The longest jti either window takes, in bytes.

REPLAY_CAPACITY

How many spent keys one window holds at once.