18:16:04 <monerobull[m]> what is considered "well connected" for a node?
18:45:14 <fluffypony> monerobull[m]: 307 connections
18:53:48 <UkoeHB> Ok I combined BP+ and Grootle multiexponentiations into one operation, which gave a couple % speedup. Updated graphs: https://github.com/monero-project/research-lab/issues/91#issuecomment-1047191259
19:22:12 <slave_blocker2> hello, how many keys can be encoded in a QR code?
19:23:17 <slave_blocker2> just wondering, if i have a set of key images, how can i represent them in the most compact way?
19:23:27 <moneromooo> There are several QR code sizes, which can encode varying amounts of data.
19:40:19 <selsta> monerobull[m]: my nodes usually have 80 or so incoming connections
19:43:35 <wernervasquez[m]> <slave_blocker2> "hello, how many keys can be..." <- Have you put varying amounts of dummy key images into qr code generators? Did you not like what you got? 
19:46:24 <slave_blocker2> I'm just wondering if i have a set of equal size binary vectors, how can i represent them in the most compact way? QR codes seem to be the top of the line in such a compression?
19:47:51 <moneromooo> QR codes do not compress. They actually usually expand.
19:48:17 <moneromooo> If you want to compress, try applying a compression algorithm first.
19:48:36 <moneromooo> Key images and the like won't compress though, but maybe the framing data will a bit.
19:49:58 <slave_blocker2> well i guess if these are n points, the creme de la creme would be to have a irreducible polynomial such that these points are exectly the roots of such a polynomial.
19:51:01 <slave_blocker2> moneromooo, are you saying that a list of key images, is the most compressed it can be?
19:51:19 <slave_blocker2> There must be a better way!
19:53:59 <slave_blocker2> hum, i am currently thinkering here with mininero. Can someone tell me if the range proofs included there are for real? The last commit was from May 8, 2016
19:54:00 <moneromooo> The most compress I can make them anyway.
19:54:43 <moneromooo> They're based on hashes, so the bits are gonna be pretty much random.
19:55:18 <moneromooo> You've got maybe 4 bits of slack per 32 bytes, but good luck finding a way to get them.
20:00:16 <slave_blocker2> moneromooo, is there a better/more up to date version of mininero? I am trying to understand ringct as was done in 0.15.x.x . For the translation of ztm... 
20:06:30 <moneromooo> Not that I know of.
20:06:59 <moneromooo> There's misc python code in sarang's github repos though, PoCs for various things.
20:07:28 <moneromooo> Sometimes more than PoCs. BP, BP+, probably also range proofs.
20:10:54 <slave_blocker2> please give me the link to his repo :)
20:13:50 <slave_blocker2> ups found it
20:17:53 <slave_blocker2> i found his repo but nothing in python about ringct.
20:18:00 <slave_blocker2> ...
20:22:56 <merope> Check the "skunkworks" repository
20:26:21 <slave_blocker2> yep, thx !
22:17:52 <UkoeHB> CCS update: https://repo.getmonero.org/monero-project/ccs-proposals/-/merge_requests/256#note_15087