issue_comments: 779416619

Tried this experiment (not proper binary search, it only searches downwards): ```python import sqlite3

db = sqlite3.connect(":memory:")

def tryit(n): sql = "select 1 where 1 in ({})".format(", ".join("?" for i in range(n))) db.execute(sql, [0 for i in range(n)])

def find_limit(min=0, max=5_000_000): value = max while True: print('Trying', value) try: tryit(value) return value except: value = value // 2 Running `find_limit()` with those default parameters takes about 1.47s on my laptop: In [9]: %timeit find_limit() Trying 5000000 Trying 2500000... 1.47 s ± 28 ms per loop (mean ± std. dev. of 7 runs, 1 loop each) `` Interestingly the value it suggested was 156250 - suggesting that the macOSsqlite3` binary with a 500,000 limit isn't the same as whatever my Python is using here.