Documentation - Prehashed #87
Conversation
There was a problem hiding this comment.
As you wrote quite formally, it is not very easy to read. I would cut sentences and try to write more naturally for readability.
I am not sure it is clear that instead of making "checks live" we precompute the hashes in advance and link sequences to bins. As such, in "live" we only have to check memory to see which elements are the next in a sequence. This is cheaper than the naive scheme because we perform many more checks than the cardinality of Sp (in average). Also the bin have in average only one element (of course this is when the prover only has np elements).
Co-authored-by: Raphael <[email protected]>
docs/prehashing.md
Outdated
|
|
||
| **Construction with Prehashing** optimizes the basic Telescope ALBA protocol by reducing the computational cost of checking sequences. | ||
| Here, a sequence means an ordered set of elements or tuples that meet certain hash conditions in the protocol. | ||
| In the basic approach, we would attempt to extend a given sequence "blindly" with all elements of $S_p$. |
There was a problem hiding this comment.
what do you mean by blindly?
There was a problem hiding this comment.
I think @rrtoledo means without implementing the prehash oracle, by blindly.
There was a problem hiding this comment.
By "blindy" I meant searching having no information and using all elements.
Co-authored-by: Raphael <[email protected]>
Content
This PR includes documentation of Telescope construction with prehashing.
Pre-submit checklist
Comments
Issue(s)
Closes #85