Commit History

Автор SHA1 Съобщение Дата
  tristangurtler de2a815609 correction to Makefile преди 4 години
  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 преди 4 години
  tristangurtler 085ba04e4a adding that it uses the helper function it should've been using преди 4 години
  tristangurtler 0ff6d430fa oversight that this helper function wasn't already present преди 4 години
  tristangurtler 386371ec37 minor addition to server to make behave more appropriately for networking portion преди 4 години
  tristangurtler d31afa1ca1 figuring out appropriate underlying library for networking преди 4 години
  tristangurtler da32b7a842 minor changes that lead to ~30% reduction in proof time преди 4 години
  tristangurtler f21ae46373 fixing valid permutation matrix proofs so that only one challenge is used, not one per element преди 4 години
  tristangurtler 55f33cf43e fixing underlying issue with affine points преди 4 години
  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 преди 4 години
  tristangurtler dda01bd883 all proofs work, all issues fixed, no optimizations yet made преди 4 години
  tristangurtler e169566a27 fixing weird merge issue преди 4 години
  tristangurtler d0dc9b9bac fixed bugs identified in previous meeting (it turned out to just be indexing problems, as I had suspected) преди 4 години
  tristangurtler c9f071f006 reconfiguring proof for fresh pseudonym reordering as recommended by Ian преди 4 години
  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. преди 4 години
  tristangurtler 8838b079ce added new constructors to make something easier in epoch calculation code преди 4 години
  tristangurtler 74d13f8f85 removed a stray comment преди 4 години
  tristangurtler 184224a2bf updates to make serialization slightly more efficient (may require a 'make clean && make') преди 4 години
  tristangurtler 95332ee7d7 changed syntax to be more legible преди 4 години
  tristangurtler 77939b65b6 stray comment to be deleted преди 4 години
  tristangurtler 3701ccbffd fixing a bug in serialization, as well as making scalars easier to work with преди 4 години
  tristangurtler 813ea4bc56 Added the server consensus 'proofs' преди 5 години
  tristangurtler ae49c1f1cf Added servers checking each other when they add a new user to not allow funny business преди 5 години
  tristangurtler beb6c7aa14 Added ability for users to verify servers correctly added them преди 5 години
  tristangurtler 82efae05be Change in underlying library to enable new features for PRSONA proofs преди 5 години
  tristangurtler f7faf80c5e Refactoring: put proof code (and global variables) in one shared class the other things inherit from преди 5 години
  tristangurtler 12b3a8dc96 Make valid vote proof a little more efficient преди 5 години
  tristangurtler dd8309f420 no semantic changes, just removed a few extraneous (commented out) includes преди 5 години
  tristangurtler d6215063bb Added proofs of valid votes by users, as well as more timing data to be printed when the program is run преди 5 години
  tristangurtler 211f7a868d new updates to underlying library to enable valid vote proofs in PRSONA преди 5 години