11-15, 15:30–15:50 (Asia/Bangkok), Stage 3
Presenting Clookup, a novel lookup protocol that enhances efficiency in verifiable computations. By using a composite function approach and multivariate polynomials within the sumcheck protocol, Clookup achieves optimal time complexity (O(m(m+n))) when processing (2^m) witness elements against a (2^n) table. This method eliminates the need to compute coefficient forms of composite functions.
Wanseob Lim is an applied cryptography researcher and cypherpunk dedicated to sharing knowledge and promoting opensource initiatives to enhance resistance and resilience.