09:59:11 <slave_blocker_> hello good day.
09:59:13 <slave_blocker_> :)
10:06:37 <slave_blocker_> i have been reading over this paper of curve trees, and i still dont understand how the set membership happens.
10:06:50 <slave_blocker_> the closest i have gotten is something like :
10:08:53 <slave_blocker_> "there is a single level relation , and after there is a rerandomization of a path (from a leaf until the root), the prover uses a conjunction of a single level relation?
10:13:44 <slave_blocker_> question 4 : what does rerandomization achieve on a curve tree ?
10:15:27 <slave_blocker_> question 5 : what is being proved to be in the set? is it a rerandomized leaf? or is it a single level curve tree ?
12:06:57 <m-relay> <k​ayabanerve:matrix.org> slave_blocker_: I answered that above