doomrobo

35 ms·

421.
by doomrobo 11y ago
Great work! I'm so glad this has been done. I think seeing OCaml used with Xen made me realize how great Rust could be in this context.
422.
by doomrobo 11y ago
Very interesting. I kinda figured my explanation wasn't that accurate, but I think it conveyed the point pretty well that sometimes we can't get to new optimal states because every path to that state is worse than the current opti
423.
by doomrobo 11y ago
One example I particularly like is why there aren't animals that roll as their primary method of transportation. The steps in between walking and perfect roundness are so disadvantageous that mutations in that direction would probably
424.
by doomrobo 11y ago
I wonder if the CRIME attack would still work under this compression algorithm
425.
by doomrobo 11y ago
The arrow has to be made by starting the head on the left side, drawing back to the center, and ending on the right
426.
by doomrobo 11y ago
Is a castle legal in this case?
427.
by doomrobo 11y ago
My apologies. Yes that's correct. My mistake was reducing the set of choices to n + (|H| mod n). Your worst-case estimate of a total bias of n/|H| seems to be correct. I guess the question now becomes whether that bias is acceptab
428.
by doomrobo 11y ago
I think the bias is much greater than that. The number of "extra chances" that are created from random H and the number of tickets n is 2^256 mod n. So if there are 6 tickets in the lotto, 2^256 % 6 = 4 tickets will have an extra
429.
by doomrobo 11y ago
I totally get that. Even though I spent 50% of my time on a take-home math final writing it in XeTeX from scratch (or "article"), it was still worth it, even if only for the motivation. I love the choice of Minion in your paper, b
430.
by doomrobo 11y ago
Wow, I am very impressed with the typesetting on [1]. Jealous, even...
431.
by doomrobo 11y ago
Ah, gotcha. I'll try to explain and correct my claimed in #2. So the winning ticket index is chosen as H % n (read: H mod n) where H is a uniformly distributed number between 0 and 2^256 obtained from the hash of some block (I'm
432.
by doomrobo 11y ago
This is really cool, but I think there might be issues with this: 1) The "random" selection of a winner seems to come from the modulo of the hash of a determinidtically selected block in the blockchain. How difficult would it be f
433.
by doomrobo 11y ago
The scrolling is better, but it still looks like this on my iPhone: http://i.imgur.com/NOrsV1M.jpg
434.
by doomrobo 11y ago
This is unreadable on mobile
435.
by doomrobo 11y ago
Is small cap conversion done for every word that's written in all capitals? The convention that I'm familiar with (I think from The Elements of Typographical Style) is to only set acronyms - that is, pronounceable initialisms like
436.
by doomrobo 11y ago
This was the first tool I thought of when I saw this. They actually look similar, too.
437.
by doomrobo 11y ago
Unfortunately, almost nothing "in the pipeline" has any kind of schedule attached to it. The best you might get is a partial ordering on the priority of features.
438.
by doomrobo 11y ago
Where do you see that? The article seems to only talk about moving to ECC in the context of better DNSSEC security and message sizes that are an order of magnitutde smaller than RSA's.
439.
by doomrobo 11y ago
This is definitely one of the toughest parts of leisure programming. The goal is to always have something interesting and fulfilling for yourself to hack on in your free time. Personally, I find these things by either coming up with a feasi
440.
by doomrobo 11y ago
>you have a lot of instances of shoving one word into a different slot...you could have something that you think of as a noun, but you can verb it Oh, Larry
441.
by doomrobo 11y ago
If you're only reading/writing from one thread, then locking/unlocking a mutex should have an extremely small overhead. So if you plan on having such a pattern available for use in multithreaded contexts, a mutex or some othe
442.
by doomrobo 11y ago
To maybe phrase the other comment's concern more formally, the argument of whether or not to abort is filled with case-by-case circumstances, and saying that humanity is better for the contributions of a person without taking into acco
443.
by doomrobo 11y ago
The internet is a decentralized network. His argument is focused on a centralized subset, namely the reddit servers, and its owner(s).
444.
by doomrobo 11y ago
The open question that the article didn't touch upon (probably because it's much more complicated) is where to draw the line between what is and isn't the government's business. There are many who don't buy into the
445.
by doomrobo 11y ago
Furthermore, it looks like both of them provide PFS
446.
by doomrobo 11y ago
Update Looking at the source, it seems like the initial key exchange keys are sent as a k_(pub,x) || sig tuple where x is 1 for the sender and 2 for the receiver. Similarly, it looks like the shared keys are derived from subslices of k_(pub
447.
by doomrobo 11y ago
The key exchange high-level overview looks like it has some typos. Firstly, the <sub></sub> is being escaped instead of being interpreted as a tag. Also you say that the client and server make a keypair and create a tuple k
448.
by doomrobo 11y ago
The C comment example seems more simply solved using non-greedy matching. Is that not done because the parser absolutely does not support non-greedy (or minimal-munch) matching?
449.
by doomrobo 11y ago
Are template-related errors also better? I remember being deathly afraid of messing up something that uses std::string because I would just get back pages and pages of errors (or pages and pages of a single error).
450.
by doomrobo 11y ago
the Lisp Koans, Exercism, and 99 Lisp problems look especially good for FP concepts (and the first two are more modern than I had expected). Thanks!

More ›