As we launch the second iteration of the program, we’ve both increased the available bounties and improved the overall process.
Releasing TFHE-rs, a pure Rust implementation of TFHE for booleans and small integer arithmetics over encrypted data.
With these releases, Zama continues to build its suite of products to make fully homomorphic encryption accessible, easy, and fast
Some exciting new features such as fast, high-precision linear models and support for 16-bit accumulators...
A major compiler update improving performance, 16-bits integer table lookups, and many other new features...
We're launching this program to encourage anyone from the community to help us move the FHE space forward.
