01:16:46 <UkoeHB> isthmus: could be a flag to identify txs
15:30:01 <isthmus> Hmm, if that’s the case, it’s working… 
15:30:01 <isthmus> I hope they aren’t doing anything where obfuscating the flow of funds is important, because the unique flag makes tracing long chains trivial (probably the change outputs).
15:30:01 <isthmus> I’ve been looking around for open source libraries with this behavior, searching for monero-derived code that sets or verifies an unlock time of 3, but so far I’ve found nothing.
16:25:58 <ofrnxmr[m]> are we still looking at removing that option?
16:50:35 <UkoeHB> ofrnxmr[m]: it is not implemented in the current seraphis protocol
17:57:08 <DGoon[m]> Hi. I was doing some research into Ringct and I was unable to find records of chats around it in the monero/meta github repo. The earliest chat that mentions ringct is here: https://github.com/monero-project/meta/issues/58 and there are no logs. My main question is, was ringct deployed before bulletproofs were agreed upon as a solution to the rangeproof size problem? I imagine there was some great discussions around this issue
17:57:08 <DGoon[m]> and any insights would be greatly appreciated. 
17:58:14 <jeffro256[m]> Yes, there used to be a less efficient range proof used in RingCT transactions before bulletproofs 
17:59:24 <moneromooo> It used Borromean proofs, from gmaxwell originally IIRC.
17:59:56 <DGoon[m]> That makes a lot of sense. Thanks for the lead!
18:00:25 <jeffro256[m]> I believe this is the paper for the original RingCT specification: https://eprint.iacr.org/2015/1098.pdf
18:01:00 <moneromooo> If you have not looked at the git logs, I would do so. Pointers are likely to be found there.
18:06:51 <DGoon[m]> jeffro256:  moneromooo  I will look at the logs, thanks for the quick response. 
20:03:13 <dEBRUYNE> DGoon[m]: You may also find some information in old developer meeting logs, they were posted to getmonero.org in the past
23:02:32 <DGoon[m]> 👍️