--- layout: post title: Logs for the Monero Research Lab Meeting Held on 2019-08-05 summary: Sarang work, and miscellaneous tags: [dev diaries, crypto, research] author: el00ruobuob / sarang --- # Logs **\** Let's go ahead and get started **\** suraeNoether says he is unavailable at this time due to an appointment **\** Agenda is here, where logs will be posted: https://github.com/monero-project/meta/issues/381 **\** GREETINGS **\** hello **\** Seeing as it's a quiet day, I'll move right along to ROUNDTABLE **\** I finished work on an efficient RCT3 verifier that takes advantage of Bulletproof-style inner product scaling **\** and also added fee support, which the original paper didn't natively support **\** As well as many other assorted code library updates that I'd been meaning to get to over time **\** Finally, I've been preparing for my DEF CON talk and workshop, and also made a simple CTF puzzle **\** What have other folks been working on? **\** nothing of particular note here, though I'm curious what the latest on the different ring signature schemes is **\** Aha, that'll be the topic of my talk! **\** its been on my mind :D **\** Why's that? **\** transaction efficiency (both time and space) is one of the obstacles we need to overcome **\** Agreed **\** randomX seems fairly solid now **\** Of course, these proposals aren't really long-term scaling solutions **\** but they would provide welcome improvements **\** Is this meeting slow because of defcon? I assume so **\** There are still some questions on an RCT3 proof that are being investigated **\** and on the possibility of Omniring efficiency improvements **\** so the status of different tx protocols may change over time **\** On that note, an ACTION ITEM for me is to return to Omniring analysis **\** it's a more complex approach (computationally) than RCT3 **\** and one of those things where the usual efficiency analysis sweeps some types of simple operations under the rug **\** but those operations can add up fast! **\** This weekend's village is of course another big action item :) **\** Slow day today :/ **\** Well, in the interest of respecting everyone's time, are there any questions or other research of interest to share? **\** (crickets) **\** hey I happen to be here **\** hello **\** I was going to ask if there has been any helpful stuff from Lelantus? **\** The authors have been working on a modified prover that offloads some of the proving complexity to the verifier (and pays a bit in size) **\** and the goal is still to remove the tracing that's present (and necessitates self-spend operations) **\** But AFAIK there have been no solutions as of yet **\** Ah okay, cool. **\** I suspect that removing that problem would require big architectural changes to the whole construction :/ **\** but I hope that I am proven wrong :) **\** Well, since it's a quiet day I suppose we can adjourn the meeting quite early **\** Hopefully livestreaming will be happening at the DEF CON village so everyone can see the talks **\** I'll post my slides to github after my talk, since they have (IMO) some nice and simple information comparing tx protocols **\** Thanks to everyone for attending today!