我在读这篇文章,其中"Encrypted Polynomial"一节的最后,作者写道”if the prover claims to have a satisfactory polynomial using only 2 powers s³ and s¹, that is not possible to verify in the current protocol.",但我不是特别理解。请问谁能给我一个更具体的例子吗?还有这里的g也应该是保密的是吧? 谢谢!