Viewing profile — smitherfield

> because you don't have a reason to reinvent the wheel [in Rust] This is a somewhat comical statement in a thread about "Rewrite it in Rust."

No evidence? We know for a fact that US, Russian, Chinese, British, Israeli etc. intelligence agencies are looking for crypto vulnerabilities, and we know for a fact that they do n…

That's if you look at major PUBLICIZED attacks on TLS endpoints. It's quite plausible that the people who've found (i.e. are looking for) attacks based on incorrect crypto aren't p…

But it wasn't an adverse inference in that case, at least not from Saddam's perspective. He wanted the world to believe he had WMDs, because he believed, not unreasonably (c.f. Nor…

Mondale proposed some interesting ideas during his Presidential campaign, in particular a national industrial policy, that I think we would have done well to take heed of.

I would (and do) consider it very suspicious.

This is more like if the police come to search your house, and find that you've burned it down, or you've barricaded yourself inside with guns and hostages. But, let's assume for t…

I think a useful concept with this is the legal doctrine of adverse inference. [1] If one of the parties to a lawsuit conceals or destroys important evidence, it is assumed that th…

"Or have everything you do on the web be phoned to Google, to improve your advertising experience." Chrome already does this.

Speaking of, why both -ansi and -std=99 [ sic [1]]? [1] should be -std=c99

All the discussion ITT so far has been about the concept or hardware implementation of full-memory encryption. I'm wondering if anyone has thoughts about the proposed API.

Yeah, that's one of my biggest pet peeves when looking at other people's code (along with unnecessary dynamic allocations in general). One of the reasons I perhaps irrationally sti…

Why wouldn't an implementation along these lines be performant? template class SoA : public tuple ...> { // ... template tuple subscript(size_t i, index_sequence ) { return {get (*…

Here's my second reply to him, where I myself point out that idealized Von Neumann machines don't exist in real life, and certain idealized O(n) operations (such as memcpy) may in …

> "Technically" O(n) is the only O(n). In idealized algorithmic analysis, but not necessarily real life. "Amortized O(1)," which I assume you concede is a commonly-used, meaningful…

See my reply to boomlinde: https://news.ycombinator.com/item?id=18988075#19000005

>No, you still need to copy the old array to the new array. That's just a lock (nontrivial but O(1)) and a memcpy (technically O(n) but trivial, and O(1) for the common case if it'…

Prepending would be O(1) because it's creating a new array instead of prepending in place. Still bugs me (seems inelegant, even if not necessarily inefficient) so I wrote my own ve…

Yeah, a little OCD but I couldn't stand the first example (and some of the others). Here's a more reasonable implementation that doesn't special case (or more precisely wraps the s…

Yes, but only if you first call ios::sync_with_stdio(false); https://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdi...

Well of course. I originally linked to this code: https://news.ycombinator.com/item?id=18873581#18878500 But the edit window had passed by the time I changed it.

Not really; I was basing it off of https://news.ycombinator.com/item?id=18873581#18875961 as a semi-joke. I changed it to a relatively KISS and IMO genuinely beautiful version in t…

#!/usr/bin/env ruby puts((1..100).map do |n| "#{:Fizz if (n % 3).zero?}"\ "#{:Buzz if (n % 5).zero?}" .then .find { |s| !s.empty? } || n end)