{"id":"fixed-point-uses-leftmost-binary-search","text":"The fixed-point algorithm always continues searching left after finding a match (`hi = mid - 1` with `result` update), guaranteeing the smallest fixed point is returned rather than an arbitrary one.","truth_value":"IN","source":"entries/2026/06/06/fixed-point-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["binary-search-variants-share-convergence-structure"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"fixed-point-uses-leftmost-binary-search","truth_value":"IN","reason":"premise"}]}}