Welcome to the resource topic for 2024/2067
Title:
Bypassing the characteristic bound in logUp
Authors: Liam Eagen, Ulrich Haböck
Abstract:In this informal note, we describe how to bypass the characteristic bound in logUp [eprint 2022/1530] by abstracting the notion of (pole) multiplicity. The method applies as well to the GKR-variant from Papini and Haböck [eprint 2023/1284], and it moreover unlocks fractional decomposition lookups over binary fields.
ePrint: https://eprint.iacr.org/2024/2067
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .