nemo1618

37 ms·

361.
by nemo1618 7y ago
Same. My TI-BASIC magnum opus was 527 lines of spaghetti code, implementing dozens of nested menus for solving any trigonometry problem I was assigned. I honestly think that this is one of the best ways to introduce programming to a kid: &q
362.
by nemo1618 7y ago
I wish the world could move on from AES. We have ciphers that are nearly as fast without requiring specialized hardware, just generic SIMD. Imagine how fast a ChaCha ASIC could run! There are other options for non-AES FDE too: most infamous
363.
by nemo1618 7y ago
> Which cryptographic algorithms can't be used? You can't use any algorithm that requires O(n) IVs (e.g. a separate IV per disk sector), because there's nowhere to store the IVs. (Another consequence of this is that you ca
364.
by nemo1618 7y ago
>Friends, it's not entirely clear to me why this is, but I instrumented a copy of fib, and I found that the number of calls in fib(n) was a more or less constant factor of the result of calling fib. That ratio converges to twice the
365.
by nemo1618 7y ago
Same, but for me the cure was John Sarno. Unfortunately RSI seems to be one of those disorders that everyone cures differently (if at all!) and you just have to stumble around until you find a method that works for you.
366.
by nemo1618 7y ago
Ha, thanks. Our algorithms differ slightly in that mine deals with ranges (rather than individual leaves) and processes the tree "left to right" rather than "bottom to top". As such, your algorithm is probably better sui
367.
by nemo1618 7y ago
Can you elaborate? Like yours, my proofs verify the presence of k arbitrary leaves within a tree, and require only the indices of those k leaves. Here's a test case illustrating such a proof: https://gitlab.com/Nebulous
368.
by nemo1618 7y ago
Huh. I think I created this independently about a year ago. My implementation also works in streaming fashion, so you can compute proofs without holding all of the data in memory. I didn't think it was novel enough to write a paper abo
369.
by nemo1618 7y ago
runtime.ForceGCPeriod is only exported in testing, so you wouldn't be able to use it in production. But as you said, the distribution could easily be modified to fit their needs.
370.
by nemo1618 7y ago
I wonder if it would be feasible to rewrite the LRU cache (either fully or in part) in a way that does not require the GC to scan the entire cache.
371.
by nemo1618 7y ago
One interesting recent development in punctuation is the effect of emoticons/emoji. The classic example is the :) at the end of a parenthetical, but more generally, any punctuation mark abutting an emoticon is unfortunate. Consider a
372.
by nemo1618 7y ago
Is RSA mandatory for your use case? Both PGP and TLS support ECC, right?
373.
by nemo1618 7y ago
Brad's influence on Go has been huge, especially wrt HTTP and HTTP2 in the standard library. Slightly sad to see him leaving the team, but I'm excited to see what he's working on next!
374.
by nemo1618 7y ago
Reminds me of a family that got lost while crossing the Sahara: https://www.theatlantic.com/past/docs/unbound/bookauth/sahar...
375.
by nemo1618 7y ago
The chromatic scale is when you play all 12 semitones. You're thinking of a C major scale. The wiki article gives the following etymology: > The word chromatic comes from the Greek chroma, color; and the traditional function of the
376.
by nemo1618 7y ago
Ah, reminds of the Optimus Maximus: https://vimeo.com/4294567 I also remember owning a Samsung Alias 2, which had e-ink keys so you could use it in either vertical or horizontal orientation.
377.
by nemo1618 7y ago
I don't know if it's Baader-Meinhof or what, but I'm seeing concatenative languages all over the place now. Which is great, because now I'm planning to write my own! My gut says that a concatenative language could be ide
378.
by nemo1618 7y ago
I don't fully buy his exact theory either, but it doesn't matter -- it cured my wrist pain anyway. The specific mechanism of action is less important than the core premises, which are: 1. My brain is capable of generating the sens
379.
by nemo1618 7y ago
Interesting! Do you happen to know which encryption algorithm is used? I would think that, if the only goal is whitening (as opposed to robust security), a fairly weak algorithm would be used, or perhaps a strong algorithm with a reduced nu
380.
by nemo1618 7y ago
Hey! Just wanted to say thanks for the great PopCap games over the years. I sunk a lot of hours into Insaniquarium, Peggle, etc. I'm really enjoying this renaissance of "C replacement" languages like Beef, Jai, Zig, Rust, etc
381.
by nemo1618 7y ago
Reading this made me realize how little Roman history I know. What's the best source for learning about the major people and events of that era? EDIT: I guess what I'm really looking for is a hierarchy of topics, starting extremel
382.
by nemo1618 7y ago
I believe GP is referring to Darcs/Pijul-style patches, rather than Git "patches," which are really just diffs. See https://en.wikibooks.org/wiki/Understanding_Darcs/Patch_theo...
383.
by nemo1618 7y ago
You can generate a secure random bitstream by flipping a coin. To eliminate bias, use the von Neumann procedure: flip the coin twice; if the results differ, use the first; otherwise, try again. If you're paranoid about snooping, go out
384.
by nemo1618 7y ago
A one-time pad certainly does. Confidence is subjective; personally I would gladly hedge my entire net worth against ChaCha20 ever being broken.
385.
by nemo1618 7y ago
Regarding your SoA example, Jai has explicit support for switching between SoA and AoS without having to rewrite everything: https://github.com/BSVino/JaiPrimer/blob/master/JaiPrimer.md...
386.
by nemo1618 7y ago
Most of the "means vs. end" dichotomy occurs at a level above choice of language. Every language permits both beautiful code and ugly code. Every language allows you to optimize. I write Go every day and I strive to write beautifu
387.
by nemo1618 7y ago
Headline is somewhat misleading: "Bitcoin fans" generally could not care less about Bitcoin.com, which is actually the home of the Bitcoin Cash altcoin. Bitcoin.com has been widely discredited for a long time now, largely due to
388.
by nemo1618 7y ago
I'm not one to reread books, but I have read that one three times. My father recommended it to me when I was young and I have treasured it ever since. Be sure to read the author's Afterward, which is available online.
389.
by nemo1618 7y ago
Once you've finished Walden, don't miss the thrilling sequel, Walden II!
390.
by nemo1618 7y ago
Here's a weird idea: is music a supernormal stimulus? I mean, I listen to music constantly, every day, and I become irritable if I must go without music for long periods. It would not be a stretch to label this an addiction. Furthermor

More ›