00:31:50 <UkoeHB_> spitballing.. might there be a userbase/tx volume level where it would be worthwhile to split up the address set and isolate ring member selection to only outputs from your address's output set? The utility is reducing how much churn is necessary to deal with heuristics that become stronger with tx volume (e.g. fixed-size output loops). There is also utility for output scanning (clearly, reducing outputs
00:31:50 <UkoeHB_> necessary to scan by 1/2, reduces scan time by half)
00:33:01 <UkoeHB_> Im assuming that level is lower than the max tx volume the network can support, some optimization point
00:33:18 <UkoeHB_> and if max tx volume rises, then more bifurcation points might be crossed
00:36:08 <UkoeHB_> the biggest problem is it can reveal something about tx recipients, since e.g. in a 2-out tx if the recipients have different
00:36:29 <UkoeHB_> segmentation_flags then they must not be the same recipient
00:37:21 <UkoeHB_> and the more segments there are, the more likely that will happen
00:56:12 <moneromooo> What we should do is obtain the cipherspy algorithm, run it, and select ring members that look suspicious.
00:56:42 <moneromooo> Take what they eat, and stuff it in their face.
01:31:11 <derpy_bridge> <[keybase] unseddd>: +1 moneromooo, stick it to them
02:16:43 <derpy_bridge> <[keybase] unseddd>: of course, need to be cautious whatever algorithm is used isn't too greedy, and marks legitimate stuff as suspicious/malicious
12:23:22 <gingeropolous> back up
12:23:48 <gingeropolous> the power is. and apparently my sentence construction is not
13:27:43 <I3^RELATIVISM> Im curious if for this room you used the matterbridge or the keybase bridge being that the matterbridge also does keybase.
13:27:46 <I3^RELATIVISM> Also if you dont host your own server how did you did this?
16:13:54 <maybefbi> I implemented non-linkable, spontaneous, anonymous, group signatures on the Ristretto curve and SHA512 hash: https://github.com/edwinhere/zero/blob/master/src/main.rs#L374
17:35:54 <maybefbi> But my BLSAG implemetation on Ristretto curve and SHA512 hash is failing: https://github.com/edwinhere/zero/blob/master/src/main.rs
17:36:21 <maybefbi> The reconstructed challenge does not match the original challenge. Any help is appreciated
17:36:47 <maybefbi> https://github.com/edwinhere/zero/blob/master/src/main.rs#L459
17:37:03 <maybefbi> The assert at the end of this function fails when comparing the challenges
17:38:56 <sarang> Are the challenge inputs being hashed in the same order each time?
17:39:32 <sarang> Might be useful for debugging to terminal-print everything that's added, and ensure they match each time the challenge is constructed
17:40:25 <maybefbi> sarang: thanks. let me try
18:59:24 <UkoeHB_> maybefbi: line 503 it should be a*Hp(K) not a*key_image
19:01:16 <maybefbi_> UkoeHB_: checking
19:05:45 <maybefbi> UkoeHB_: thanks! that fixed it. Good spot. I misread the zero-to-monero-2
19:06:40 <UkoeHB_> :p
19:06:45 <maybefbi> There was also one other bug about using cs[1..n] instead of reconstructed_c and i fixed that too
19:07:08 <sarang> the dreaded two-bug problem
19:07:12 <maybefbi> lol
19:10:35 <maybefbi> it is 3 AM here. must sleep. got work tomorrow. thanks for all the help. sarang thanks for writing the zero-to-monero. i will make it up to guys somehow
19:10:58 <sarang> Zero to Monero was UkoeHB_
19:11:06 <sarang> I only contributed
19:11:21 <maybefbi> UkoeHB_: ! thanks i didnt know
22:18:19 <sarang> Updated PR for handling key encryption in memory and key files: https://github.com/monero-project/monero/pull/6493
22:47:46 <derpy_bridge> <[keybase] unseddd>: you guys are so funny
22:52:43 <derpy_bridge> <[keybase] unseddd>: who are you accusing of being a 3letter agent this week maybefbi? pls, let's not devolve into accusing one another of being agents, it's a technique used to cause infighting in communities. if you have proof, show it
22:58:08 <UkoeHB_> ?