Cronologia Commit

Autore SHA1 Messaggio Data
  tristangurtler dfd57cea95 fixing serialization of proofs 3 anni fa
  tristangurtler 6eb1cce546 minor fix, just a whitespace thing 3 anni fa
  tristangurtler ed06aae428 fixed a few things around serialization of uncommon types 3 anni fa
  tristangurtler de2a815609 correction to Makefile 3 anni fa
  tristangurtler 4715de0aad networking code upload; it doesn't compile yet, and there's a small delta left on the client code before that's ready anyways. But the server code has been drafted; needs to be debugged 3 anni fa
  tristangurtler 085ba04e4a adding that it uses the helper function it should've been using 3 anni fa
  tristangurtler 0ff6d430fa oversight that this helper function wasn't already present 3 anni fa
  tristangurtler 386371ec37 minor addition to server to make behave more appropriately for networking portion 3 anni fa
  tristangurtler d31afa1ca1 figuring out appropriate underlying library for networking 3 anni fa
  tristangurtler da32b7a842 minor changes that lead to ~30% reduction in proof time 3 anni fa
  tristangurtler f21ae46373 fixing valid permutation matrix proofs so that only one challenge is used, not one per element 3 anni fa
  tristangurtler 55f33cf43e fixing underlying issue with affine points 3 anni fa
  tristangurtler 373a1adbae I don't know what it is, but approximately 3% of the time, there is a bug that causes proofs to fail. Otherwise, I'm adding networking code now 3 anni fa
  tristangurtler dda01bd883 all proofs work, all issues fixed, no optimizations yet made 3 anni fa
  tristangurtler e169566a27 fixing weird merge issue 3 anni fa
  tristangurtler d0dc9b9bac fixed bugs identified in previous meeting (it turned out to just be indexing problems, as I had suspected) 3 anni fa
  tristangurtler c9f071f006 reconfiguring proof for fresh pseudonym reordering as recommended by Ian 3 anni fa
  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 anni fa
  tristangurtler 8838b079ce added new constructors to make something easier in epoch calculation code 3 anni fa
  tristangurtler 74d13f8f85 removed a stray comment 3 anni fa
  tristangurtler 184224a2bf updates to make serialization slightly more efficient (may require a 'make clean && make') 3 anni fa
  tristangurtler 95332ee7d7 changed syntax to be more legible 3 anni fa
  tristangurtler 77939b65b6 stray comment to be deleted 3 anni fa
  tristangurtler 3701ccbffd fixing a bug in serialization, as well as making scalars easier to work with 3 anni fa
  tristangurtler 813ea4bc56 Added the server consensus 'proofs' 3 anni fa
  tristangurtler ae49c1f1cf Added servers checking each other when they add a new user to not allow funny business 3 anni fa
  tristangurtler beb6c7aa14 Added ability for users to verify servers correctly added them 3 anni fa
  tristangurtler 82efae05be Change in underlying library to enable new features for PRSONA proofs 3 anni fa
  tristangurtler f7faf80c5e Refactoring: put proof code (and global variables) in one shared class the other things inherit from 3 anni fa
  tristangurtler 12b3a8dc96 Make valid vote proof a little more efficient 3 anni fa