Smallest Kakeya sets in F_p^5

# Smallest Kakeya sets in F_p^5 ## Goal A Kakeya set in F_p^5 is a set K that contains a full line `{x + t v : t in F_p}` for every non-zero direction v ((p^5 - 1)/(p - 1) directions up to scaling). Find one that is as small as possible. `kakeya.py` exposes kakeya_set(p: int, d: int, time_budget: float, seed: int) -> list[tuple[int, int, int, int, int]] `d` is always 5 in this pack (the argument lets one solver serve the F_p^3 and F_p^4 packs too). Return the points of K as integer 5-tuples; coordinates are reduced mod p and duplicates are counted once. The eval checks exactly, direction by direction, that K contains a line in every …