<k​ayabanerve:monero.social> I'm not completely grokking the final section yet, sorry, but thanks for writing the idea out.

It's the same idea as a Seraphis composition proof, just make some transformations that show what you want while remaining blinded. There might be a better way.

<k​ayabanerve:monero.social> Sorry, I responded in NWLB. I don't see how it's secure at this time.

<k​ayabanerve:monero.social> I'll also note as-is, the lack of multisig is a deal breaker (though if Grootle outputs a tuple per my gist's current proposal, it inherits its sa+l proof).

<k​ayabanerve:monero.social> I'll also quote your estimate of 1-1.5y for this and then 3y for Seraphis + FCMPs after, which I would still stand against due to the extra 2y of rings (even if Grootle).

<k​ayabanerve:matrix.org> I posted this in NWLB, where more discussion on this topic has been happening as of the past day or so, yet in case anyone isn't there yet should still see this, here's another copy of the link: github.com/kayabaNerve/fcmp-ringct/blob/develop/fcmp%2B%2B.pdf

<k​ayabanerve:matrix.org> It's the gist for my FCMP proposal, properly structured with much more background/explanation/detail (a formalization/specification draft/WIP).