Last week, this new hash function tailored to Plookup was released. Have a peek.
Hello, I thought it could be nice to send in our implementation of Reinforced Concrete Hash Function. Inline with the benchmarks provided in the papers: we have 5.7ms per hash & 357 constraints in-circuit. One difference between our impl and the paper comes from doing montgomery reductions on the decomposed scalars, so we have a couple more gadgets. I think it’s also worth noting that the backend of this relies on in an integrated plonk and plookup proving system.