Hokan
Prony / Ben-Or–Tiwari with a structured node set, then an LLL knapsack
Reconstruct a secret 11-variable degree-11 polynomial over an unknown 256-bit prime field from only 8 evaluations, two fewer than Prony interpolation nominally requires, by choosing query points whose structure makes the integer kernel depend only on the exponents.
Full writeup·4 sections·17 blocks