New Ph.d. dissertation that describes sub-linear complete membership proofs for monero.

Rucknium[m]: that one seems to have a lot of statistical analysis

tevador: ok which rust code? you mean dalek lib or which?

About a year ago I tried to read the main paper from that dissertation: Liang, M., Karantaidou, I., Baldimtsi, F., Gordon, D. S., & Varia, M. (2022). "(∈, δ)-indistinguishable mixing for cryptocurrencies." moneroresearch.info/index.php?action=resource_RESOURCEVIEW_CORE&id=92

I didn't get very far. I could try again.

Doesn't it require interaction between users?

"Our protocol requires O(n log n) total communication when n users are mixing coins, has sub-quadratic total computation cost, and requires only constant or polylog(n) communication rounds (depending on which protocol variant is chosen)"

Ah that part didn’t register