hello good day.

:)

i have been reading over this paper of curve trees, and i still dont understand how the set membership happens.

the closest i have gotten is something like :

"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?

question 4 : what does rerandomization achieve on a curve tree ?

question 5 : what is being proved to be in the set? is it a rerandomized leaf? or is it a single level curve tree ?

<k​ayabanerve:matrix.org> slave_blocker_: I answered that above