Mind · Reasoning
Bisect
Logarithmic search via binary splitting
Definition
Mechanism
Binary Partition: Define the possibility space. Find a question that splits space roughly in half. Ask it. Discard eliminated half. Repeat on remaining half. O(log n) questions to isolate answer. Requires ordered or divisible domain. Often underpins the execution of RecursiveRootCause.
Invariants
- Each question eliminates ≥40% of remaining space.
Risks
Failure modes
False Negative
Discarding the half that actually contained the answer because the splitting question was flawed.
Relationships
Builds on
References
Recursive root cause analysis
Used by
References
Infrastructure
Shrink a failing input or action sequence while the same failure keeps occurring
Reference