 tristangurtler
|
da32b7a842
minor changes that lead to ~30% reduction in proof time
|
3 lat temu |
|
tristangurtler
|
dda01bd883
all proofs work, all issues fixed, no optimizations yet made
|
3 lat temu |
|
tristangurtler
|
d0dc9b9bac
fixed bugs identified in previous meeting (it turned out to just be indexing problems, as I had suspected)
|
3 lat temu |
|
tristangurtler
|
0c958cdddb
This compiles, but has bugs right now. The current issue I'm looking at is that, the other ways I've tested it, the fresh pseudonyms are generated correctly, but the proofs of their generation are not verifying. Specifically, when proving that a piece of the result is valid, the proof succeeds if it was generated as the product of a 0 from the permutation matrix and the original pseudonym, but fails if it was generated as the product of a 1 from the permutation matrix and the original pseudonym. I am debugging this now.
|
3 lat temu |
|
tristangurtler
|
813ea4bc56
Added the server consensus 'proofs'
|
3 lat temu |
|
tristangurtler
|
beb6c7aa14
Added ability for users to verify servers correctly added them
|
3 lat temu |
|
tristangurtler
|
f7faf80c5e
Refactoring: put proof code (and global variables) in one shared class the other things inherit from
|
3 lat temu |
