<a​ck-j:matrix.org> Springproofs: Efficient Inner Product Arguments for Vectors of Arbitrary Length

<a​ck-j:matrix.org> computer.org/csdl/proceedings-article/sp/2024/313000a067/1RjEaDExPJS

<a​ck-j:matrix.org> “Experimental results show that Springproofs preserve the succinct proof size of Bulletproofs, and Springproofs can achieve an almost 2 times speedup compared with Bulletproofs, when the length of the witness vectors is only marginally larger than a power of 2. Digital curren- cies such as Monero may also benefit from Springproofs. Compared with Bulletproofs based Monero, Spring<clipped message>

<a​ck-j:matrix.org> proofs based Monero only takes 59.7% and 65.5% of time cost to generate and verify a transaction with 9 outputs respectively. Moreover, Springproofs increase the range of parameters on which the performance of privacy computing supported by Bulletproofs exceeds that of Groth16, for instance privacy computing on the statistics like expected value and variance.”

Does it mention a comparison with BP+ (or BP++) ?

<a​ck-j:matrix.org> It mentions BP+ but I believe the comparisons are only to BP. I reached out to the authors for clarification and to see if they would open source the c++ code