Blockchain, Cryptography, Zero Knowledge Proofs, Zksnark, Mathematics.
just by multiplying t(x) by another bounded polynomial to make it pass the test, the construction is still useful. Verifier knows that the prover has a valid polynomial but not which particular one. We could add additional proofs of other properties of the polynomial such as: divides by multiple