<a​tomfried:matrix.org> was there any follow up on the "Range Proofs with Constant Size and Trustless Setup" paper?

<a​tomfried:matrix.org> link.springer.com/chapter/10.1007/978-3-031-28694-0_28

<a​tomfried:matrix.org> i guess bp++ is much hotter to research because they maybe can be used for curve trees, but anyways

<a​tomfried:matrix.org> well they are also doing stuff with bp so maybe it is worth a look.

<a​tomfried:matrix.org> "With this paper, we improve Bulletproofs, a zero-knowledge argument of knowledge for range proofs, by modifying its Inner Product Argument (IPA) subroutine"

<a​tomfried:matrix.org> proof size is 400bytes

<k​ayabanerve:matrix.org> BP++ cannot be used explicitly and I'm far more interested in those.

<k​ayabanerve:matrix.org> I haven't done the necessary review myself though.