[EPIC] Gas Optimizations — Future Iterations

**Objective**

Explore and evaluate ways to minimize gas cost in subscription claim and removal flows. This epic groups future-iteration optimizations aimed at reducing nonce iteration complexity, avoiding stacked claims, and lowering the time complexity of claim loops from O(n) toward O(1) where feasible.

These are design trade-offs to consider for future protocol versions — not immediate implementation targets.

**Estimation**

TBD — sum of child work items once scoped and estimated individually.

No files, tests, or entry points are named. Start by scoping the subscription claim and removal flows, then evaluate nonce iteration, stacked claims, and claim-loop complexity as separate child work items; done means each item has a defined trade-off, scope, and estimate rather than an immediate implementation.

Written by the indexing model from the issue text.