A question about sumcheck

[Wangjun24]

I am not sure if the code for sumcheck is implemented as described in algorithms 1 and 2 of Section 3.1. Can you give me an answer?

[chancharles92]

I am not sure if the code for sumcheck is implemented as described in algorithms 1 and 2 of Section 3.1. Can you give me an answer?

I remember we followed the classical implementation as in [XZZPS19] (https://eprint.iacr.org/2019/317.pdf#subsection.3.2) without further optimizations in Section 3.1 of Hyperplonk.

cc @zhenfeizhang to confirm.

[zhenfeizhang]

right. As far as I can recall we didn't do any optimizations.

[Wangjun24]

Thanks for your previous reply, I have a new question：In the zero check in Section 3.2, a random number r is needed to build eq(x,r). My understanding is that r is a number represented by an μ-bit binary number. But I found in the code(subroutines/src/poly_iop/zero_check/mod.rs prove) that r is made up of random numbers on μ fields. Did I understand something wrong?