TLDR
Low-degree testing is perhaps the single most complex part of the protocol. It is impossible to prove that at least the great majority of a given large set of points are on the same low-degree polynomials. The algorithm to check if a given set of values is on same degree < D polynomial with D+1 queries is not too complex. We’ll start off with a relatively simple design called “Fast IOPPP” (FRIEF)via the TL;DR App
no story
