Wilko Henecka

You discovered a bug. Congratulations. In general, arithmetic with floating point numbers is fine. We have tests for that... However, changing the BASE changes everything. There is bug in how...

Overflows are a consequence of the encoding scheme. The Paillier cryptosystem allows arithmetic over the integers modulo _n_. That is the numbers {0, 1, ..., _n_-1}. And thus, _n_-1 +...

This is odd. The test usually runs in a fraction of a millisecond. I cannot reproduce this behavior. I'm not sure why this happened. Maybe we just wait and see...

I also found this: [ANU Online Personal Data Generator and Corruptor (GeCo)](https://dmm.anu.edu.au/geco/)

one curve-ball with the multiparty greedy solver is that if the merge_treshold is smaller than 1, then it might put two entities into the same group, although their pairwise similarity...

Maybe I don't quite understand what `isValid()` is supposed to do, but: - for an unsinged encoding scheme `isValid()` should reject all negative numbers. - otherwise, all possible double, long...

another possible avenue: Java lets you choose which CryptoProvider you want to use inside the JVM. We could implement our own Test Provider which just provides some not so secure...

I drew a diagram of the current way we send the tokens around.  I don't quite get the risk that the proposed solution negates. Which tokens can party 1...

endpoint `/projects/{project_id}: get` returns among other things also the schema. However, there is currently an open issue (#197) around the access permission for this endpoint.

One aspect is that the it would be nice to have the schema definition to be the source for the docs. Similar to openAPI which can be nicely visualized with...