Introduce firm leaps
This introduces "firm leaps", which require less information to be stored for caching an ordered ancestor iteration compared to the soft and hard leaps.
Depends on: !30 (merged)
This introduces "firm leaps", which require less information to be stored for caching an ordered ancestor iteration compared to the soft and hard leaps.
Depends on: !30 (merged)