Jer Miller
Jer Miller
When supporting unlinkability, a JPA can also support a form of "binding" that ensures any honest Prover is the only entity that can generate a valid proof when given a...
As with JWS's signature value, the format of the proof value is opaque to the application. The proof algorithm defines the format and any encoding is unique to that algorithm....
Consider a commitment to salted hash (lyt)... etc... it might be that there are really large potential space savings for large "payload types"... when you don't need to keep repeating...
Also add recommendation that algorithms support a single octet string serialization for higher level protocols.
For example, all of the ones defined in [JWS](https://datatracker.ietf.org/doc/html/rfc7515) apply the same, except `cty` should be documented as not recommended.
Create cross-linkable sections for terminology, such as "JWP Protected Header", etc. Refer to existing JOSE definitions such as "collision resistant names" also.
Using this issue to track discussions around the common interface to the proof algorithm for the signing, deriving, and verifying steps.
https://github.com/erictj/node-clucene/blob/master/src/clucene_bindings.cpp#L586 It looks like it's opening the indexreader twice, and it never closes them... also probably shouldn't re-open one every query?
The PB transaction is very similar to https://people.xiph.org/~greg/escrowexample.txt and having an example like that would help explain it.