๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

Quang Dao
@QuangVDao
PhD student @SCSatCMU. Working toward zk too cheap to meter & formally verified by default
๊ฐ€์ž… September 2016
2.2K ํŒ”๋กœ์ž‰ ์ค‘    1.2K ํŒฌ
Our newest sum-check optimizations are out! We propose a *better* domain for sum-check: the infinity hypercube. Evaluations over this domain give *precisely* the monomial coefficients, and lead to a ~10% prover speedup over 128+ bits prime fields ๐Ÿงต/ n
๋” ๋ณด๊ธฐ