Details
-
Bug
-
Resolution: Fixed
-
Critical
-
4.0.0
-
Security Level: Public
-
Triaged
-
Unknown
Description
Because Hash is O(1) and Tree is O(log n), it is to be expected that during heavy traffic, indexer will fall behing KV.
In this situation, it is important the behavior is predictable and does not lead to unbounded queue growth.
This bug is because apparently, it is possible for mutation queues to grow unbounded in current code. This must be fixed before we ship.