Open someone235 opened 5 years ago
It should be, check out the rle_decode_flat example.
All loops must be statically bound at compile time, so that they can be compiled to an arithmetic circuit.
You can use the buffetfsm
loop transformer to statically bound your loops without re-writing your code. To do this, just make sure you've built the loop transformer using the install_buffet.sh
script, and include the annotation in your computation before your loop: [[buffet::fsm(LOOP_BOUND)]]
(see here for an example use.)
For more information on the static loop bound restriction and the loop transformer, you can check out this paper: https://eprint.iacr.org/2014/674.pdf
When trying to create keys for the below code, I get this error:
java.lang.StackOverflowError
. Is there a way to fix it? Or is it not possible to make a loop with unknown number of iterations?