> On 12 Aug 2015, at 04:35 , George Kadianakis wrote:
>
> teor writes:
>
>> Another implementation note on directory caching of the SR doc:
>>
>> I just noticed the following code in
>> update_consensus_networkstatus_downloads():
>>
>> for (i=0; i < N_CONSENSUS_FLAVORS; ++i) {
>>/*
teor writes:
> Another implementation note on directory caching of the SR doc:
>
> I just noticed the following code in
> update_consensus_networkstatus_downloads():
>
> for (i=0; i < N_CONSENSUS_FLAVORS; ++i) {
> /* need some way to download unknown flavors if we are caching. */
>
> Th
> On 10 Aug 2015, at 23:07 , George Kadianakis wrote:
>
> teor writes:
>
>>> On 4 Aug 2015, at 22:00 , George Kadianakis wrote:
>>>
>>> Hello,
>>>
>>>
>>>
> 3.7. Shared Randomness Disaster Recovery [SRDISASTER]
>
> If the consensus at 12:00UTC fails to be created, then there
Another implementation note on directory caching of the SR doc:
I just noticed the following code in update_consensus_networkstatus_downloads():
for (i=0; i < N_CONSENSUS_FLAVORS; ++i) {
/* need some way to download unknown flavors if we are caching. */
This means that any new consensus
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hello list,
This is an announcement/reminder that there will be an IRC meeting of
the Measurement Team on
Wednesday, August 12, 2015, 14:00 UTC in #tor-project
https://www.timeanddate.com/worldclock/fixedtime.html?iso=20150812T14
Suggested agenda
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA256
Hi,
Things look good in ed25519_keygen - git-018082ef88b688e2.
I can confirm the last defect was fixed (now it saves to disk
ed25519_master_id_public_key if it only has ed25519_signing_cert -
valid and ed25519_signing_secret_key).
Log messages are
On Tue, 11 Aug 2015 13:44:48 +, Virgil Griffith wrote:
> I mean the median.
>
> >From Wikipedia...
>
> For example, if *a* < *b* < *c*, then the median of the list {*a*, *b*, *c*}
> is *b*, and, if *a* < *b* < *c* < *d*, then the median of the list {*a*, *b*
> , *c*, *d*} is the mean of *b* a
Virgil's absolutely right. Median as the "middle" value in a _sorted_ set
is:
- for odd number of data points, it's the middle one: set[N/2]
- for even number of data points, it's the average of two in the middle:
(set[N/2] + set[(N+1)/2]) / 2
Best regards,
Maciej
On Tue, Aug 11, 2015 at 3:44 PM,
I mean the median.
>From Wikipedia...
For example, if *a* < *b* < *c*, then the median of the list {*a*, *b*, *c*}
is *b*, and, if *a* < *b* < *c* < *d*, then the median of the list {*a*, *b*
, *c*, *d*} is the mean of *b* and *c*; i.e., it is (*b* + *c*) / 2.
-V
On Tue, Aug 11, 2015 at 9:29 PM
I think you are confusing the median with the mean:
https://en.wikipedia.org/wiki/Median
https://en.wikipedia.org/wiki/Mean
Taking the median instead of the mean can be beneficial in situations
where you have larger outliers in your data, which typically affect the
mean very much.
-j
Virgil Gri
On Mon, Aug 10, 2015 at 09:36:22PM +, Alec Muffett wrote:
> On Aug 10, 2015, at 2:00 PM, Philipp Winter wrote:
> > Vanity addresses encourage people to only verify the human-readable part
> > of an address before clicking on it. That creates a false sense of
> > security, which is already exp
Is there some implementation-specific reason not to use the standard
mathematical definition of "median"? If not, I propose changing the
implementation to become it.
-V
On Tue, Aug 11, 2015 at 2:44 AM Nick Mathewson wrote:
> On Mon, Aug 10, 2015 at 1:11 PM, nusenu wrote:
> > -BEGIN PGP SI
Dear Twisted/Tor developers,
I am motivated by language security concerns. I think Twisted Python
can often implement excellent replacements for our old crufty C
implementations. In this case I'd like to stop using C programs
running as root (or not root) to torify http connections... like
privoxy
13 matches
Mail list logo
