HNHacker News
TopNewBestAskShowJobs

dauphin

-61 karma · joined January 10, 2011

submissionscomments
dauphin··on Everything you need to know about cryptography in 1 hour, by Colin Percival
You're so right.
dauphin··on DuckDuckGo Challenges Google on Privacy (With a Billboard in San Francisco)
Open an English dictionary (the Oxford one if you're serious), and come back. Note my fault if tbl didn't know how to speak English corectly backed then.
dauphin··on TrueCrypt Identification String
> Well it's not a backdoor.

You have no idea. Your pants.

dauphin··on The polynomial algorithm for 3-SAT problem (or P=NP)
Thanks for the summary with your level of competence (already a good one ;)).
dauphin··on DuckDuckGo Challenges Google on Privacy (With a Billboard in San Francisco)
Pedophilia is illegal in most countries, I'd be happy if ad networks gather data about your interest on young boys and pass it to the feds! Beasts!

Edit: judging by the downvotes, I guess a good bunch of hackers like to live in atrocity!

dauphin··on DuckDuckGo Challenges Google on Privacy (With a Billboard in San Francisco)
*referrer
dauphin··on The polynomial algorithm for 3-SAT problem (or P=NP)
Yeah, and, seriously, a Russian?! Please...
dauphin··on Why HN was slow and how Rtm fixed it
That's 0.05 second for a single request: actually pretty good.
dauphin··on The Companies Worth Less Than Facebook
They did, in 2001.
dauphin··on Tired of missing calls? With Polo, you're always available.
Thanks for this. Is a tweet considered a "referrer"?
dauphin··on Why HN was slow and how Rtm fixed it
Errors/exceptions, for one, are implemented using continuations.
dauphin··on Why HN was slow and how Rtm fixed it
You clearly don't understand the problem. Even mod_pagespeed or memcached would be more appropriate here: They are rate-limited by the LISP kernel anyway (we are talking about dynamic content here).
dauphin··on Why HN was slow and how Rtm fixed it
Ooops, yes, you are right, sorry. Then I guess it's a pretty decent rate for a Core2 duo.
dauphin··on Why HN was slow and how Rtm fixed it
Well, HN is written in Arc, which is a layer on top of MzScheme. MzScheme handling of sockets is actually already done with the select() syscall, and its "threads" are lightweight non-blocking threads (think Erlang). So it's already async but with "sugar".
dauphin··on Why HN was slow and how Rtm fixed it
1: https://secure.wikimedia.org/wikipedia/en/wiki/Robert_Tappan...

2: same acronym as RTFM, but polite.

dauphin··on Why HN was slow and how Rtm fixed it
This could be resolved using consistent hashing or a critbit tree.
dauphin··on Why HN was slow and how Rtm fixed it
Book worm, nerd. Think Comic Book Guy, but healthier and smarter. Totally a bad-ass.
dauphin··on Why HN was slow and how Rtm fixed it
Lisp is definitely not a slow language: you can handle the crazy rate of 20 requests/second on a multi-core server!
dauphin··on Why HN was slow and how Rtm fixed it
> It turns out there is a hack in FreeBSD, invented by Filo, that causes the O/S not to give a new connection to the server until an entire HTTP request has arrived. This might reduce the number of threads a lot, and thus improve performance; I'll give it a try today or tomorrow.

Anyone know if they're referring to "accept filters" here? FreeBSD folks can "man accf_http" if they're curious, which does prevent a request from being handed off to the application until the complete (and valid?) request has been made. Certainly not a "hack" but a feature of the OS itself.

Or they could use a proxy. All this "fuck me I'm famous" attitude is stupid.

dauphin··on Tarsnap critical security bug
My new online code analyser program, sponsored by AMD, could have prevented this bug.
dauphin··on Ask HN/PG: Why are comments being paginated?
Naab it's because of shitty posts like yours than HN is slow! New users should not be able to post. Abusing the system is a problem.
dauphin··on TrueCrypt Identification String
Hello, NSA "backdoor".