16:01:54 #startmeeting 16:01:54 Meeting started Fri Jan 2 16:01:54 2015 UTC. The chair is asn. Information about MeetBot at http://wiki.debian.org/MeetBot. 16:01:54 Useful Commands: #action #agreed #help #info #idea #link #topic. 16:02:05 so, let's start with some status reports. 16:02:13 i can start 16:02:13 so over the past 1.5 week, 16:02:16 ah 16:02:17 go for it, ohmygodel . 16:02:22 ah ok thx 16:02:40 i added stuff to the tech report 16:02:44 i sent it emails with patches to all of you 16:02:51 yes i saw that email. haven't had time to read it yet :( 16:02:56 received, not applied yet. 16:03:04 could you briefly describe what you changed? 16:03:12 ohmygodel: are you okay with having your name in the git commit? 16:03:14 i did in the emails 16:03:19 ohmygodel: ok then. 16:03:21 yes karsten i am fine with that 16:03:21 * asn reads mail 16:03:25 ohmygodel: ok. 16:03:39 that is all i did for HS stats 16:03:41 end report 16:03:45 thank you 16:03:59 so over the past week, 16:04:04 I mainly did CCC. 16:04:11 which was very interesting. 16:04:20 during CCC i did an impromptu meeting with karsten 16:04:24 where we looked at some data 16:04:37 and kept some notes about how to present the data etc. 16:04:50 we kind of decided which graphs we should shiow during the jan12 meeting 16:05:00 and we kind of decided on how to do extrapolation. 16:05:22 I also spent a bit of time talking with Gareth about his talk 16:05:28 (the final Tor talk of CCC) 16:05:34 and interpretering his results. 16:05:50 interestingly, our SponsorR statistisc were helpful in interprtering his results. 16:06:07 especially the "HS traffic is about 1.5% of total network traffic" statistic 16:06:16 which becamse helpful faster than we expected it to be. 16:06:30 awesome 16:06:32 yay stats win ! 16:06:37 so that's what I did about SponsorR laetly. 16:06:41 next please.\ 16:06:49 can we queue your extrapolation plan for later discussion? 16:06:56 yes, please. 16:06:57 i’d like to hear what you came up with 16:07:00 I'd like to talk about that. 16:07:02 yes 16:07:09 * robgjansen starts 16:07:13 robgjansen: go! 16:07:27 i’ve been working with dgoulet on running benchmarks with shadow 16:07:37 i set up an ec2 node that we are sharing 16:07:53 it runs shadow and tor linked to lttng 16:08:17 we have been debugging issues related to lttng tracepoints not showing up correctly 16:08:24 made some mods to shadow to support that 16:08:32 still working out bugs, so its not funcitonal yet 16:08:36 * robgjansen ends report 16:08:50 thanks! 16:08:59 what kind of bugs are there? 16:09:00 lttng bugs? 16:09:04 tor bugs? or shadow bugs? 16:09:06 or combo bugs? 16:09:32 ahh, well it has to do with the way that shadow hijacks functions like socket, fnctl, etc 16:09:42 issues on making them work together, shadow and lttng userspace are intense inprocess library that hijacks symbols 16:09:54 i see 16:10:01 and they are fighting with each other? 16:10:13 yes shadow is hijacking lttng 16:10:21 :) 16:10:25 ack 16:10:27 ok who next? 16:10:33 * dgoulet can go 16:10:36 dgoulet: please 16:11:23 very fast, mostly working with robgjansen here on the above ^ ... was afk for the holidays a bit so very few for SponsorR except shadow work, next week will be the one I wrap up HS performance results for Jan 12th 16:11:38 and after that hopefully, analyse and improve perforamnce 16:11:41 * dgoulet done 16:11:46 great. 16:12:11 * karsten can go next. 16:12:14 please 16:12:19 - Finished an early analysis of hidserv-stats and posted it to #13192. 16:12:19 - Reviewed teor's patch to #13192. 16:12:19 - Did another analysis and just uploaded it here: https://people.torproject.org/~karsten/volatile/hidserv-stats-analysis.pdf 16:12:22 - Talked more to Donncha about detecting malicous HSDirs. 16:12:26 end of report. 16:12:31 nice and tight 16:12:33 ok 16:12:42 so we are done with status reports. 16:12:52 let's move to discussion phase. 16:12:57 what do we want to talk about? 16:13:02 extrapolation. 16:13:03 we want to talk about extrapolation? 16:13:11 we want to talk abut what we should be doing next week 16:13:17 also, should we ask operators of fast relays to enable our stats? 16:13:25 yes, next week. 16:13:30 karsten: how many stats are we receiving now? 16:13:33 id like to discuss new measurement frameworks 16:13:41 hrm, that was too short. yes, we should talk about what we should do next week. 16:14:08 asn: now, or when we discuss extrapolation of stats? 16:14:15 OK, let's start with extrapolation. that many people find exciting. 16:14:26 karsten: would you like to do an intro? 16:14:26 sure. /me looks. 16:14:34 https://people.torproject.org/~karsten/volatile/hidserv-stats-analysis.pdf 16:14:45 that's from yesterday or so. 16:15:10 we have 418 stats reported by relays since dec 21. 16:15:11 interesting. 16:15:13 where is the data coming from 16:15:16 not including very recent ones. 16:15:20 karsten: that's good. 16:15:28 data comes from extra-info descriptors and consensuses. 16:15:28 so this is people with HiddenServiceStats enabled ? 16:15:31 yes. 16:15:35 karsten: i think we are ok as far as stats volume goes? 16:15:38 ok 16:15:41 asn: depends. 16:15:50 look at pages 3 and 7. 16:15:54 ok 16:16:15 page 7 looks okay. lots of hsdirs, all with similar fractions observed. 16:16:22 what is the cut line? 16:16:25 but page 3 says that we don't have enough fast relays reporting stats. 16:16:40 an arbitrary threshold I picked for drawing the graph on the next page. 16:16:58 which is too low for page 3. 16:17:29 let me paste the description of these pages somewhere. 16:18:00 http://pastebin.com/2Xpv4J6C 16:18:04 yes, I can imagine that RP-related stats would benefit from some faster relays 16:18:11 since only fast relays will give big numbers there. 16:18:15 right. 16:18:35 basically, I tried two different extrapolation methods. 16:18:43 (neither of which being backed by real maths...) 16:18:46 omg such cloudflare 16:19:10 i would suggest using 3.5% on page 7 instead of 2% 16:19:11 ok got it. 16:19:17 pages 1 and 2 and 5 and 6 are extrapolations based on reports by single relays. 16:19:28 robgjansen: plausible. 16:19:49 which i think would bring down the results on page 8 16:19:53 5 is extrapolated? 16:20:12 isn't it the actual measurements of single relays? 16:20:14 5 is reported values. 16:20:55 to continue the sentence above, 3 and 4 and 7 and 8 add up all reports and extrapolate from there. 16:21:37 robgjansen: I'll raise the threshold. the hope is to have > 3.5% on dec 31 and jan 1 anyway. 16:21:45 it just takes some time for reports to come in. 16:21:54 ok, great 16:22:12 would it make sense to separate into 2 pdfs? reported and estimated/extrapolated? 16:22:31 nah, nevermind 16:22:34 so 7 is calculating the fraction of total onion addresses we see? but total oniona dddresses in an extrapolated number, right? 16:22:38 sure. this is just what ggplot produces. a pdf with all results. 16:23:31 7 is the sum of all fractions of relays reporting stats. 16:23:40 8 is extrapolated. 16:23:42 karsten id be interested in the formulas used to do the extrapolations 16:23:53 e.g. how you calculated the per-relay fractions to adjut by 16:24:05 reported number / fraction of observed values = estimated number in the network. 16:24:07 *adjust 16:24:27 ah, fractions come from consensuses. 16:24:38 for traffic it's simply consensus weight fraction. 16:24:55 yes that latter number 16:25:10 for .onions it's fraction of identifier space that the hsdir was responsible for. 16:25:13 im interested in things such as how you are filtering by flag and applying position weights 16:25:35 nothing, just consensus weight fraction. happy to tweak that. 16:26:13 ic, because i think you will essentially never be selected as an RP if you don’t have the Running and Fast flags 16:26:26 ah ok. 16:26:32 I didn't look that up, to be honest. 16:26:33 also guards and exits would obviously have smaller probs as RPs than their consensus weights would otherwise imply 16:26:45 Running is not an issue, but I'm not considering Fast. I can fix that. 16:26:45 need_uptime = 1 16:26:45 need_capacity = 1 16:26:45 need_guard = 0 16:26:45 allow_invalid = 1 16:26:45 weight_for_exit = 0 16:26:47 need_desc = 1 16:26:50 i think these are the flags of RPs 16:26:55 it needs to be stable and fast. 16:27:06 Stable! Interesting. 16:27:21 i think so 16:27:23 let me find the code 16:27:34 ohmygodel: how much will the positional probs change the consensus weights? 16:27:35 That makes a non-trivial difference. 16:28:03 ohmygodel: ie how much percent roughly is non-trivial 16:28:08 A lot for exits 16:28:25 so, which weights do I use here? 16:28:53 probably > 10% reduction in available relays 16:29:17 ohmygodel: k thanks 16:29:27 I believe that the RP is selected using Middle weights 16:29:29 Wmx? 16:30:18 Wmg - Weight for Guard-flagged nodes in the middle Position 16:30:24 looks like it. 16:30:44 okay, I can throw out relays without Stable and without Fast flag, and apply Wmx weights. 16:30:50 fwiw, I think RPs are chosen in connection_ap_handshake_attach_circuit(): 16:31:45 where it dose: 16:31:46 retval = circuit_get_open_circ_or_launch( 16:31:46 conn, CIRCUIT_PURPOSE_C_REND_JOINED, &rendcirc); 16:32:08 okay. 16:32:32 I'll also read code after the meeting and see if I should do more than what I said above. 16:33:07 yes 16:33:07 That should be double-checked, though. I have never paid especially close attention to HS path creation, and it’s not explained well in rend-spec.txt. 16:33:07 No I meant that being selected as a middle should be double-checked 16:33:07 Excellent. Also, can we see the code you are using? 16:33:07 Then I can later ask questions like: “What factor is Karsten using to adjust HS publishes?” 16:33:07 (I assume the answer to that question is 6/num_hsdirs for all HSDirs) 16:33:38 :) 16:33:45 cool. if you wrote anything up about what you found, i would read it 16:33:45 ohmygodel: let me pastebin the code, too. 16:33:52 you are also using the number 6. 16:33:59 I didn't clean it up yet though. but hey. 16:34:07 it would be good to consider adding details to rend-spec.txt also 16:34:11 ohmygodel: yes. 16:34:30 ohmygodel: that's how I had those flags ready. i have some notes that I've been planning to incorporate to rend-spec.txt but time--. 16:34:53 ohmygodel: http://pastebin.com/cyEEyav1 16:35:15 asn: what did you mean by “that's how I had those flags ready” ? 16:35:30 i meant the ones I pasted before. need_uptime = 1, etc. 16:35:42 regarding the number 6, ... 16:35:49 oh i understand. cool! 16:36:15 I did something slightly different: 16:36:21 ohmygodel: HS path selection should be better specified both in rend-spec.txt and in rend-spec-ng.txt 16:36:31 I looked at the whole range that an HSDir is responsible for. 16:36:34 * asn listens to karsten 16:36:45 from 3 HSDirs earlier in the ring until the own fingerprint. 16:36:58 (/me operates from memory there and hopes that is even correct..) 16:37:22 then I introduced the magic number 4: 16:37:37 each service publishes two replicas of its descriptor to the ring. 16:37:55 and it changes ring positions once every 24 hours, which almost never aligns with a relay's stats interval. 16:38:05 that's 2 x 2 changes to see a service over the day. 16:38:10 hence 4. 16:38:45 not sure if this is a useful discussion on irc. asn spent a tea or two talking about this... 16:39:10 ok yeah it makes sense though thanks 16:39:22 as I understand it, karsten uses the slice of 3 HSDirs as his unit 16:39:26 not a single HSDir. 16:39:29 yep 16:39:43 and also, he takes in account that HSes will rotate once during his statistics interval 16:39:57 so he expects the same HS to register itself to two of our HSDirs during a singkle statistics interval 16:40:07 although you need to be careful when you add up all the .onions seen 16:40:12 that's why he doubles up his number. 16:41:02 i mean when you add them up *across* relays 16:41:02 to come up with a more robust total estimate than just based on those observed at a single relay 16:41:02 well, it may be that we're not handling overlapping sets correctly. 16:41:18 ok 16:42:05 I started describing the method in a tech report format. would you want to read/review that? 16:42:23 im still dont totally understand your inference calculation, but yeah, maybe irc isnt the place 16:42:27 yes i would definitely want to read that 16:42:46 it might also be worth trying the alternative extrapolation technqiue that ohmygodel started describing 16:42:52 and then seeing how much the resulst differ. 16:43:09 rather than reading 500+ lines of java plus those R lines I didn't even paste yet. okay, great, will send that to you. (damn lag) 16:43:24 our results give us approx 30k to 35k HSes. 16:43:36 Gareth's results gave him 45k HSes 6 months ago. who knows who is correct. 16:43:47 which alternative extrapolation technique? 16:43:48 we are not too far away though. 16:43:51 yeah i do prefer english to java haha 16:44:20 well also our results include added noise 16:44:20 correct ? 16:44:23 the one where you consider HSDirs as individual units, instead of considering their whole slice. 16:44:27 ohmygodel: yes. 16:44:43 ah hmm. isn't that less precise? 16:44:57 because we know what fraction of descriptors we're responsible for. 16:45:14 yeah i agree your method is better 16:45:16 feels like throwing away that information. 16:45:22 that's true. 16:45:48 ok. then let me write this down in english rather than java. :) 16:46:08 btw are you just taking bin_center+noise as the true value 16:46:13 even for negative values, for example ? 16:46:18 almost 16:46:24 I'm subtracting bin_size / 2. 16:46:26 which bin_center? :) 16:46:29 oh 16:46:32 i guess the closest. 16:46:41 since that's more likely to have been returned by the laplace distr. 16:46:46 yes, bin_center is what I'm using. 16:46:48 (now that we are applying additive noise second) 16:47:09 hang on. confusion. 16:47:30 what we do is: we measure a value, we round up to the next multiple of something, we add laplace noise. 16:47:44 what I did in the analysis: subtract bin_size / 2 from whatever was reported. 16:47:55 why not add? :) 16:47:55 ok yes that muliple was what i was calling bin_center 16:47:58 that's a design decision I guess. 16:48:13 because we added 0..bin_size-1 before. 16:48:14 yeah i dont agree with that correction 16:48:42 why not? 16:48:43 wait you round up ? 16:48:43 why dont you round to the nearest ? 16:48:54 because it should be more accurate to round to the nearest 16:48:56 we can't really reverse the binning. 16:49:05 we should try to reverse the laplace noise. 16:49:06 ah, in the tor code we round up. 16:49:14 well at this point no. 16:49:15 karsten: yeah in the tor code 16:49:29 ok just a suggestion: round to the nearest in the tor code 16:49:35 ugh 16:49:42 we can't really change that at this point. 16:49:45 also, for post-noise correction 16:49:48 ok no big deal 16:50:01 really not at all a big deal 16:50:08 ok 16:50:19 then i do agree with your correction 16:50:24 phew :) 16:50:31 I mean, happy to change that. 16:50:33 that's easy. 16:50:34 actually it would seem to make more sense 16:50:35 as I see it, 16:50:40 just changing the tor part is hard. 16:50:44 the correct thing to do with such a value (to bring it closer to the original value) 16:50:54 to just round to the halfway between two muliples 16:50:54 is to round up or down the value to the nearest bin_center. 16:51:35 asn: you mean after subtracting bin_size/2? 16:51:37 because you take the current bin as the most likely one, and then try to minimize expected error 16:51:38 since laplace is an exponential distr, the nearest bin_center is the most likely original value. 16:51:55 yes, asn are saying the same thing 16:52:00 yes 16:52:23 so, subtract bin_size / 2, then round to nearest bin_center? 16:52:29 karsten: no. i don't see subtracting bin_size/2 in my plan. 16:52:31 but i might be wrong. 16:52:34 no, just round to the center of the current bin 16:52:38 ye 16:52:39 e.g., if your multiple value is 8 16:52:48 and youre reported value is 643 16:53:12 then you are between multiples 640 and 648 16:53:19 so take that as the bin of the true value 16:53:26 that's also how I see it. 16:53:33 and then guess that its at 644 16:53:45 yeah. and then you can't get deeper. because the binning has smoothed out information. 16:53:49 ok. 16:54:21 a tiny part in my brain still wants to subtract something. but the rest makes sense. 16:54:43 ohmygodel: i was also hoping to add a small aura to the graph 16:54:45 rounding to a bin center. will do that. 16:55:03 ohmygodel: so that if our infered value is 600. it would ahve an aura between 540 to 640, which is the error rate. 16:55:11 ohmygodel: but I'm not sure if this will be that useful now. 16:55:39 ohmygodel: since the laplace distr goes from -inf to +inf, the aura would have to be eveyrwhere. 16:56:19 we could add an aura to only the 90% most likely values of the laplace distr, but that's still very big. 16:56:29 asn: not sure where you got those numbers, but the error analysis shuold yield a confidence interval something like that 16:56:52 ohmygodel: the numbers were arbitrary in the example I just gave. and even so they should have been 560 to 640. 16:57:07 ha right 16:57:27 so that was extrapolation for onion addresses. 16:57:32 which as I understand it is the hard aprt. 16:57:43 because it has all this overlapping stuff. 16:58:00 extrapolating RP statistics is probably easier, if we can get the prob of being an RP for each relay. 16:58:15 and if we have fast-enough relays. 16:58:20 yeah the only wrinkle is getting the probs right, using the flags and weights correctly, etc. 16:58:36 to adjust for the probability of a reporting relay seeing HS traffic 16:58:45 but we discussed that 16:58:48 yup 16:59:17 thanks for all the feedback here! I'll fix these things and send new results and a report thing. 16:59:36 btw the program manager of this program (chris white) has a phd in statistics, and so he might appreciate any display of stats competence on our part 16:59:40 karsten: maybe your report could be a diff to the proposal on the "How to use onion statistics" part? 16:59:55 karsten: since now that part is a bit dry. 16:59:55 ohmygodel: hah, very good to know! 17:00:30 a diff? 17:00:37 OK. So there goes the extrapolation discussion topic. We are not really finished yet though, since this week we shoudl think and work moer on it. 17:00:50 karsten: i meant a patch to the proposal 17:01:04 hmm. plain text, no latex, .... 17:01:05 since it has a "how to use the onion statistics" section that isn ot very useful. 17:01:09 karsten: ah. 17:01:09 yeah 17:01:30 yeah latex might be more covenient I guess. 17:01:34 btw, we need to update the spec. 17:01:38 I think so, yes. 17:01:39 oh well, if you prefer latex just do it in latex and then we can link from the proposal. 17:01:43 karsten: how about adding it to the tech report ? 17:01:54 asn: sounds good. 17:02:08 so let's move to next discussion topic for now? 17:02:08 ohmygodel: sure, why not. let me write is as new latex file for now, and we can include it later? 17:02:12 sure. 17:02:22 which one is that? 17:02:24 karsten: sounds good 17:02:35 very quickly: 17:02:49 any objections if I ask relay operators of the top-10 relays or so to run 0.2.6.2-alpha? 17:02:52 with stats enabled? 17:02:54 no 17:02:55 please do. 17:02:58 thanks 17:03:00 ok. 17:03:08 i did want to briefly discuss other stats collection methodologies 17:03:14 please do ohmygodel 17:03:34 (and then we only have "what to do next week" on the agenda.) 17:03:37 yes 17:03:56 ok so this topic ended last time 17:03:56 with asn recommending that i write up a scheme and send it to tor-dev 17:03:56 i still plan to do that 17:03:56 one thing that i have been considering 17:04:10 is how to gauge “implementation difficulty” 17:04:23 which includes both writing software and running services 17:04:39 the former is harder for me 17:04:46 because im not really a software engineer 17:05:00 and its hard for me to gauge which libraries could be used in practice 17:05:11 i mean, many many crypto tools have *some* implementation 17:05:13 any suggestions ? 17:05:23 hm 17:05:37 good question. 17:05:47 usually, if the implementation involves new crypto primitives 17:06:03 that are not well-established or triviailly understood 17:06:10 the implementation cost rumps up quite a bit. 17:06:25 because it either involves auditing those libraries, or implementing them ourselves. 17:06:48 the cost of running services is not as high as writing software, but it's definitely some overhead depending on the number of services. 17:06:49 so is there a short list of “vetted” crypto libraries ? 17:06:57 nooot really :( 17:07:17 djb stuff that are usable are usually trustworthy maybe. 17:07:23 don't underestimate the cost of running services. 17:07:27 things that are in openssl and used by many people are also useable. 17:07:40 take a look at the consensus-health list to see how hard it is to keep current directory authorities happy. 17:07:48 karsten: yes that's true. 17:08:07 not saying that necessity to run new services is a show-stopper. 17:08:13 but there's a cost. 17:08:20 ohmygodel: i would suggest to not worry about implementation difficulty at tghis point. 17:08:25 ohmygodel: write down your scheme 17:08:34 asn: think of your guard script thing. 17:08:37 ohmygodel: and if you can think of ways that improve implementation difficulty, note them down. 17:08:48 karsten: yeah that's true. 17:08:50 yes, that would also be my suggestion. 17:08:54 well its sort of all about implementation difficulty: very secure designs already exist 17:09:21 but i understand, ill make some attempt at evaluation, but leave it to others that know more about it 17:09:28 yes 17:09:48 i am hoping to propose to chris 17:09:48 take the laplace thing as example. 17:09:51 maybe note down a few differfent designs or design decisions, so that we can choose between them. 17:09:52 pretty trivial, in theory. 17:10:00 and we still have a pending patch on the ticket. 17:10:09 ye 17:10:15 that he support tor+nrl implementing a new, more secure, and more efficient stats collection cheme 17:10:46 that's a worthwhile thing to do. 17:10:46 ohmygodel: "interesting" 17:10:47 of course, we should figure out if this is in fact a good priority for us in advance though 17:11:25 that's something worth discussing. 17:11:36 i'm personally not very excited about implementing this. but I could be persuaded maybe. 17:11:41 it wasnt exactly what we had envisioned in the project proposal, but i seems important to move forward on HS stats, among several other things (BW measurement, Tor Metrics in general) 17:12:07 agreed. 17:12:17 and we have that other sponsor who cares about it. 17:12:25 i want to speak with roger about these things. 17:12:27 yes indeed ! it kills two rids 17:12:33 asn: me too 17:12:35 *birds 17:12:40 i'm really hoping we can speak with roger before the meeting on jan12 17:12:43 poor birds. 17:13:04 i have a meeting with him 17:13:10 you should show up 17:13:15 when is it? 17:13:18 1/9/15 17:13:28 that's when we have the next sponsorr meeting here. 17:13:30 oh wait sorry 17:13:30 thats this meeting haha 17:13:34 hah 17:13:37 :) 17:13:41 hopefully roger will show up here. 17:13:43 sounds good :) 17:13:47 robgjansen: do you have that mtg in your calendar ? 17:13:53 * robgjansen checking cal 17:13:55 speaking of, things to do this week? 17:13:59 i will send hima n email to remind him. 17:14:13 * karsten already has a long list from this meeting. is everyone else covered? 17:14:13 ok 17:14:20 ohmygodel: no, just this HS meeting in tor-dev 17:14:24 yes you are probably filled karsten 17:14:34 i would like to help evaluate your stuff 17:14:38 like read the mail youa re going to send to tor-dev 17:14:42 and maybe read the java code 17:14:44 damnit i definitely recall scheduling something for LIGHTS+MADPATHS in january 17:14:47 and I should also really curate the tech report. 17:15:07 asn: do you want to apply ohmygodel's patches, or should I do that? 17:15:09 I will try to feel more inspired about this tech report this week. 17:15:10 i can do it. 17:15:21 okay, great. 17:15:35 btw karsten 17:15:41 and sure, any feedback on report and code are much appreciated. 17:15:43 my goal will be to write up some possible alternative measurement schemes 17:16:02 were there any graphs with extrapolation based on all the reports, not on single reports? 17:16:21 asn: yes, that's pages 4 and 8. 17:16:38 (we didn't discuss those at 31c3, they're new.) 17:16:39 ack 17:16:43 ok thx 17:17:06 ohmygodel: good. 17:17:07 isis: You might want to check the spreadsheet that nickm ( 17:17:29 hey karsten i actually have changed my mind about post-noise correction 17:17:33 ! 17:17:36 isis: You might want to check the spreadsheet that nickm (?) and Yawning started writing, to sum up the possibilities for non-TLS transport 17:17:57 yeah could describe now or send an email 17:17:58 you decide asn 17:18:13 sure describe nao 17:18:22 in the example i gave 17:18:34 643 is between multiple 640 and 648 17:18:48 but it’s actually most likely to be output if you were rounded to 640 than 648 17:19:07 so probably you were a value in (632, 640] 17:19:09 that got rounded *up* to 640 17:19:14 true. 17:19:17 that is the most likely case 17:19:18 thus to correct 17:19:35 it's the "nearest bin_center from where you are" 17:19:38 you should use 636 17:19:59 hm. 17:20:00 * asn thinks 17:20:02 so, - bin_size/2, round to nearest center? 17:20:26 haha i believe so karsten 17:20:29 you had good instincts 17:20:35 hehe 17:20:56 ok sorry back to plans for next week ? 17:20:58 is the additive noise applied to the bin center or the right side of the bin? 17:21:05 right side of the bin 17:21:13 we discussed bin center 17:21:17 but didn't implement that. 17:21:39 in that case, I think ohmygodel is correct. 17:21:47 ok. cool! 17:21:51 since 643 is closer to 640, than 648 (which are both right sides of the bin) 17:22:00 *of bins 17:22:24 right. (we could also round to nearest right side of the bin and then go to the bin center.) 17:22:34 i think now that -bin_size/2 in the beginning might make sense. 17:22:55 yes. that's more intuitive to me. 17:23:02 ok. 17:23:11 ohmygodel: thanks for catching this. 17:23:19 karsten: thanks for thinking of this. 17:23:20 indeed, thanks! 17:23:27 ok good. 17:23:34 so I think we all have things to do this week. 17:23:42 yup 17:23:43 ah, I will be in the same conference as Roger in 5 days! 17:23:50 that makes it easier to meet with him,. 17:23:56 you think that. 17:23:57 ;) 17:23:59 :P 17:24:13 ok are we all happy? 17:24:18 fwiw, i will be around irc for the next days 17:24:28 will be less around irc after the 6th. 17:24:43 but we can still discuss and adaptively change our plans in the next few days. 17:24:58 sounds good. not sure how much I can focus on this on the weekend, 17:25:05 but I'll try to get something done soon. 17:25:09 next meeting in 1 week? 17:25:11 yes 17:25:16 ok sounds good. ill try to figure out when that LIGHTS/MADPATHS meeting is, assuming it was scheduled. 17:25:18 that meeting will be our last meeting 17:25:27 ok talk to you next week at the latest ! 17:25:28 #endmeeting