02:32:16 <xmrack[m]> https://www.proquest.com/openview/076466ff18b8292a1af214bce7231f08/1
02:33:38 <xmrack[m]> New Ph.d. dissertation that describes sub-linear complete membership proofs for monero.
03:26:41 <UkoeHB> Rucknium[m]: that one seems to have a lot of statistical analysis
08:01:27 <narodnik> tevador: ok which rust code? you mean dalek lib or which?
12:47:25 <Rucknium[m]> 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." https://moneroresearch.info/index.php?action=resource_RESOURCEVIEW_CORE&id=92
12:47:36 <Rucknium[m]> I didn't get very far. I could try again.
12:48:24 <Rucknium[m]> Doesn't it require interaction between users?
12:50:38 <Rucknium[m]> "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)"
13:12:21 <UkoeHB> Ah that part didn’t register