Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
rowbin
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
61.
▲
by
rowbin
2y ago
>> The stronger versions, things from List 1 and List 2, are mostly only seen in defense and intelligence And I don't think that is enough. I agree that it easier and sufficient for most systems to just be connected over the inte
62.
▲
by
rowbin
2y ago
Why would the police keep the money? It doesn't get to keep other confiscated money, does it? Wouldn't the state be the "default" recipient?
63.
▲
by
rowbin
2y ago
IIRC Google used to do that and have a search option to specifically look for discussion type results only
64.
▲
by
rowbin
3y ago
But your are going backwards though. You have a sha-256 value and want to find an input with the same result. But this input again has to be a sha-256 result and you need to find an input for that as well, right? This would only work if you
65.
▲
by
rowbin
3y ago
TL;DR: risk is probably pretty low I used to struggle with this too, but now I look at it this way: you're always at risk of being breached when connecting to the Internet (zero days in Browser, Router, maybe IoT devices on the local n
66.
▲
by
rowbin
3y ago
Your house was $10,000-$99,999 and now having $1-$9 is a treat??
67.
▲
by
rowbin
3y ago
I'm counting wine
68.
▲
by
rowbin
3y ago
Win32 is probably as close as it gets
69.
▲
by
rowbin
3y ago
> needs active cooling This sounds like a pretty big negative to me
70.
▲
by
rowbin
3y ago
Thanks, that helped
71.
▲
by
rowbin
3y ago
So like partially applied functions in Haskell?
72.
▲
by
rowbin
3y ago
Interesting, never heard tarballs being classified as odd before. They are still widely used.
73.
▲
by
rowbin
3y ago
Yes, every program will either halt or not halt. Some programs are guaranteed to halt (`int main() {return 0;}`) some are guaranteed to not halt (root comment). Some are undecidable (at least with infinite memory, with finite memory they ar
74.
▲
by
rowbin
3y ago
`while fetchRandomInt() != 0 {}`
75.
▲
by
rowbin
3y ago
I'm sure they ment that. It's also enough to have a program fetch truely random data from random.org.
76.
▲
by
rowbin
3y ago
> [...] because computers aren't Turing machines and have finite memory, so all programs are guaranteed to halt That's just wrong. `while true {}` never halts even with finite memory.
77.
▲
by
rowbin
3y ago
breath-first doesn't mean it's not looking into subdirectories. It is, but it looks into each subdirectory before decending into the different subdirectories subdirectories. So it enger first subdir, looks at files there, then goe
78.
▲
by
rowbin
3y ago
Do you generate a random key for each id? If so, you loose the time component of your I'd, because two hashes made at a different time can produce the same hash when using a different key (I think). If you use a single key you need to