zeeboo

13 ms·

61.
by zeeboo 8y ago
Why would I not be able to make inferences about the software the servers are running if the chances on lying on the letter is low? I haven't read Signal's source code, and yet I believe with just as much confidence that they aren
62.
by zeeboo 8y ago
I don't understand your points about the NSA letters, which makes me think that my point was missed. I am saying that the NSA letter claiming that only some information was logged is fully independent of the open source code of the ser
63.
by zeeboo 8y ago
Did you notice how your proof rests entirely on the NSA letter, and not the source code of the server at all? Isn't a world conceivable where they open sourced the server, with no logging, and then sent an NSA letter that contained inf
64.
by zeeboo 8y ago
You can know exactly what the attacker can learn because you can see ALL of the information that your client passes to the server by auditing ONLY the client. Your argument applies equally well to every single router or middle box on the in
65.
by zeeboo 8y ago
And yet, all of the routers are not audited, and I presume you believe in the security of some applications that use them. In other words, the trusted base of the system does not depend on all of the components in the system (you start with
66.
by zeeboo 8y ago
You can construct a client such that the server IS outside of the scope. You can determine if a client has such a property from the client alone. I would only want to use a client such that the server is outside of the scope. It's stri
67.
by zeeboo 8y ago
So audit the client assuming that all of the traffic it sends is in the clear (i.e. not over https to keybase's servers). If that's not sufficient, then don't use keybase. Regardless, until you have a way to ensure the server
68.
by zeeboo 8y ago
That's just false. You can get all of the trust information necessary from the client. It's exactly the same amount of trust. edit: To be clear, even if they open sourced the server right now, I would not even look at the code to
69.
by zeeboo 8y ago
How does open sourcing the server help you audit what their servers are running? There's no way to know if what's open source matches their running code, and if the security of the system depends on the server being open, it'
70.
by zeeboo 8y ago
Do you agree both sets are countable? If so, any two countable sets can be put into bijection by composing their bijections to the naturals.
71.
by zeeboo 8y ago
I’m confused. First, there’s no notion of sub-typing in Go. Second, the closest thing I can think of what you mean does work: https://play.golang.org/p/IE9sg4CwCd_C
72.
by zeeboo 8y ago
Usually those proofs start off by saying "pick an N as large as you wish", and then showing that the statement is true. Thus, you're certain that it doesn't break at big scales because you allowed any big scale you wishe
73.
by zeeboo 8y ago
The easy way: compress it with whatever you want (xz? gzip?) and compare the sizes. If it doesn't get significantly smaller, it's probably encrypted or already compressed.
74.
by zeeboo 8y ago
It's clear that a SAT solver is strictly stronger than the MVS approach. In other words, any MVS selection can be encoded in a SAT solver. The argument is for a reduction in power. Thus, in order to convince someone that a SAT solver i
75.
by zeeboo 8y ago
I think there's empirical evidence that the SAT-solver approach is not necessary. I have done an analysis on as many Gopkg.{lock,toml} files as I could find, and in no instances did it ever do any non-trivial version selection: the max
76.
by zeeboo 8y ago
For what it's worth, I analyzed as many Gopkg.{lock,toml} files I could find in the wild, and found that vgo's algorithms would service all of them. I've done similar analysis for a smaller number of Rust projects using Cargo
77.
by zeeboo 8y ago
Additionally, dep is, and always was, meant as an experiment to learn from. Russ gave multiple concrete examples of things he learned from dep. That the dep authors don't take this as a win is telling. Pitching dep as the eventual Go d
78.
by zeeboo 8y ago
His "attack" is literally a brute force of 32 bits of state. It would not scale to PCG with 128 bits of internal state.
79.
Show HN: Rothko: Time-series metric histograms for large deployments(github.com)
4 points by zeeboo 9y ago|0 comments
80.
Show HN: Goof: Go object finder (runtime binary introspection)(github.com)
2 points by zeeboo 9y ago|1 comments
81.
by zeeboo 10y ago
If I start at 0 and successively add 1, do you agree that I eventually hit any positive integer you could pick after a finite number of steps? Does that not prove to you that I hit every positive integers? Which one do I not hit?
82.
by zeeboo 10y ago
You don't have to use a finitely definable function. In fact, Cantor's argument defines the function as an infinite list of real numbers.
83.
by zeeboo 10y ago
You can leave the inner type out... https://play.golang.org/p/m3bLmneArB
84.
by zeeboo 10y ago
In some sense, yes. A proper scoring rule would give that forecaster less points than one that forecasts a 90% chance of winning when they win all of them.
85.
by zeeboo 10y ago
Funny because Theo didn't say either of the quotes your parent was talking about.
86.
by zeeboo 10y ago
An interface being equal to nil just because the value it contains is nil would be even more confusing. For example, imagine if you had two interface values, one holding a nil * T and one holding a nil * S. They would both be equal to nil,
87.
by zeeboo 10y ago
The article paraphrased. The court document showed that the person attempted for months to get the plates and never did. Also the money was to pay for court fees which the government required the person spend in the first place to get the p
88.
by zeeboo 10y ago
It can also switch on memory allocations and function calls as well. I'd expect a large fraction of the context switches come from those events and don't go through the kernel.
89.
by zeeboo 10y ago
I hope your optimism that a single kind of thread pool will service all applications is well founded. It seems like people would want to specialize them much like they want to specialize their memory allocators. The Rust team has a really g
90.
by zeeboo 10y ago
Easy and error prone. Sometimes libraries pretend to be async and accidentally are sync. Consider some library that in the normal case just does some pure computation, but logs to syslog or something on some error condition. If you use that

More ›