releaseNotes.txt

V1. Version implemented with Activity(). Algorithm implemented based loosely on the SOSP paper, with some changes taken from specs and code. Using the sodium fork for VRFs and Hash functions. Uses boost for big numbers.

V2. Version implemented with HandleMessage(). Only proposal and soft vote stages implemented. Relays and message sending abstracted out; communication between nodes is done by directly by access through a pointer. Profiling with VerySleepy shows bottleneck to now be VRF calculation (which is to be expected).

V2.1 Added conditional VRF simulation. Now VRFs can be calculated like in a real node, or they can be faked with a boost::random generator, with considerable speed gains. This will prove useful for attacks that have nothing to do with VRF validation or seed control (e.g. partition attacks).