Issue requests implementing binary search for blind boolean SQL injections, claiming "current per letter bruteforce is stupid."

Finding: Binary search is already implemented.

The bisection() function in lib/techniques/blind/inference.py has implemented binary search since the tool's early days:

# Line 345 - classic binary search midpoint
position = (len(charTbl) >> 1)

# Lines 383-397 - search space halving
if result:
    charTbl = charTbl[position:]  # upper half
else:
    charTbl = charTbl[:position]  # lower half

Evidence:

• Default charset: 128 chars → ~7 queries/char (log₂(128) = 7), not 64 for brute force
• All 25+ DBMS in queries.xml use > comparison in <inference> queries (e.g., MySQL: ORD(MID((%s),%d,1))>%d)
• Function is literally named "bisection" and documented as "Bisection algorithm"

Recommendation: Close issue as already implemented, or request clarification on what specific improvement is desired.

✨ Let Copilot coding agent set things up for you — coding agent works faster and does higher quality work when set up for your repo.