Skip to content

Commit 59bfd2a

Browse files
committed
add TODO
1 parent 5969915 commit 59bfd2a

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

TODO.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -25,6 +25,7 @@
2525
- Many times, we evaluate different multilinear polynomials (diferent columns of the same table etc) at a common point. OPTI = compute the eq(.) once, and then dot_product with everything
2626
- To commit to multiple AIR table using 1 single pcs, the most general form our "packed pcs" api should accept is:
2727
a list of n (n not a power of 2) columns, each ending with m repeated values (in this manner we can reduce proof size when they are a lot of columns (poseidons ...))
28+
- in the runner of leanISA program, if we call 2 times the same function with the same arguments, we can reuse the same memory frame
2829

2930
About "the packed pcs" (similar to SP1 Jagged PCS, slightly less efficient, but simpler (no sumchecks)):
3031
- The best strategy is probably to pack as much as possible (the cost increasing the density = additional inner evaluations), if we can fit below a power of 2 - epsilon (epsilon = 20% for instance, tbd), if the sum of the non zero data is just above a power of 2, no packed technique, even the best, can help us, so we should spread aniway (to reduce the pressure of inner evaluations)

0 commit comments

Comments
 (0)