1.0

1.0 of Chiavdf

Changed

• Removed inefficient ConvertIntegerToBytes() and ConvertBytesToInt() functions, use GMP library's mpz_export/mpz_import for big integers and simple helper functions for built-in integer types. The latter are taken from chiavdf.
• Require compressed forms to be encoded canonically when deserializing. This should prevent potential grinding attacks where some non-canonical encodings of a compressed form could be used to change its hash and thus the next challenges derived from it. Canonically encoded compressed forms must be reduced and must produce the same string when deserialized and serialized again.

0.9

Added

• Bluebox Timelords now support Chia new consensus.

Changed

• Change n-Wesolowski proofs to include B instead of y in segments. Proof segments now have the form (iters, B, proof) instead of (iters, y, proof). This reduces proof segment size from 208 to 141 bytes.
• The new proof format is not compatible with the old one, however zero-Wesolowski proofs are not affected as they have zero proof segments and consist only of (y, proof).
• We made two HashPrime optimizations. This forces numbers being tested for primality to be odd and avoids an unnecessary update of the sprout vector by stopping after the first non-zero value. This is a breaking change as it changes the prime numbers generated from a given seed.

Fixed

• A crash could happen when deserializing an invalid compressed form.
• Stop producing incorrect MacOS Universal builds.

Bluebox.

Bluebox fix. (#64)

* Initial commit.

* Fix compile error.

Bluebox.

0.15.1bluebox

Merge branch 'master' into fc.bluebox

Bluebox prerelease.

0.15.1b

Merge branch 'master' into fc.bluebox

Bluebox prerelease.

0.14.1b0

Fix compile error.

0.14.0

Added

• Add form compression, use it in Python bindings and VDF client. Using compressed representation of quadratic forms reduces their serialized size from 130 to 100 bytes (for forms with 1024-bit discriminant). This shrinks the size of VDF outputs and VDF proofs. The form compression algorithm is based on "Trustless Groups of Unknown Order with Hyperelliptic Curves" by Samuel Dobson, Steven D. Galbraith and Benjamin Smith.
• We now verify form size when deserializing.
• MacOS universal wheels to support MacOS ARM64 are built for Python 3.9.

Changed

• This is a breaking change from the 0.13.x series.

0.13.4

Added

• We now build both MacOS x86_64 and MacOS universal wheels.

First draft bluebox.

0.13.4b0

Initial commit.

0.13.3

Added

• Replace GMP's primality test function with our own based on Baillie-PSW. The new primality test is based on the 2020 paper "Strengthening the Baillie-PSW primality test" by Robert Baillie, Andrew Fiori, Samuel S. Wagstaff Jr. The new test works approximately 20% faster than GMP library's mpz_probab_prime_p() function when generating random 1024-bit primes.

Changed

• Refactor form exponentiation, start from top bits of exponent. This slightly improves performance of VDF proof verification.

Fixed

• We've moved to pybind 2.6.2 to avoid a possible shutdown bug in Python 3.9.0.