The decider for bouncers has been officially released!
The method is presented formally in Section 7 of the official bbchallenge write-up.
Find attached to this release (1) bouncers certificates in text tab-separated format and (2) decided bouncers ID in sorted binary index file (concatenation of all the decided bouncers' bbchallenge ID written on 4 bytes, big endian).
Implementations for the bouncer decider are:
- Tony Guilfoyle's C++ initial implementation (does not use the theory presented in the write-up)
- Iijil's Go implementation (does not use the theory presented in this section)
- savask's Haskell implementation (basis of the theory presented in the write-up)
- mei's optimised Rust implementation, reproducing savask's. This implementation outputs certificates that are verified using Coq, more details about this approach will be given in future versions of the write-up.
- Tristan Stérin's (cosmo's) Rust implementation, reproducing savask's and mei's. This implementation follows the write-up to the letter, reproducing each concept and algorithm as presented here. It is less efficient than mei's.