- From: Eric Prud'hommeaux <eric@w3.org>
- Date: Thu, 27 May 2021 21:59:39 +0200
- To: "Peter F. Patel-Schneider" <pfpschneider@gmail.com>
- Cc: semantic-web@w3.org
On Thu, May 27, 2021 at 10:53:11AM -0400, Peter F. Patel-Schneider wrote: > I'm also confused as to why the difference between what this demo does and > the algorithms in https://w3c-ccg.github.io/ld-proofs/#algorithms. There a > single node is added to the graph but you add two nodes. (Well, not really, > the algorithm adds triples that all come off a new node but your code adds > triples that come off two nodes, one an IRI and the other blank.) How is > this difference reconciled? Because this is a VC, it's doing more than step 3 requires. Specifically, it's hashing the two together. It would make sense to extend this text to identify circumstances when you'd want to hash the proof (i.e. when it includes data that can be mischievously altered without breaking the hash). I don't know who, if anyone, has the writing stick, but this is honestly the sort of wordsmithing that goes well in WGs, if we ever get there. > peter > > > > On 5/27/21 10:08 AM, Eric Prud'hommeaux wrote: > > I created a half-assed (UI-wise) but I think cryptographically sound > > demo where you get to plug in your own document and proof structure. > > > > https://janeirodigital.github.io/rdf-sig-playground/index > > > > Help/suggestions appreciated. Help with bugs like > > https://github.com/janeirodigital/rdf-sig-playground/blob/main/index.js#L214-L215 > > actively solicited. > > >
Received on Thursday, 27 May 2021 19:59:51 UTC