Live data from Hacker News

Viewing profile — psi-squared

psi-squared

HN member
Joined
Sun, Aug 23, 2015, 5:17 PM UTC
HN karma
72
Public activity
25 items

About psi-squared

No profile information was provided.

Recent public activity

  1. comment
    Comment #14476424

    That's a really neat solution, and avoids the cognitive overhead of having to remember yet another password (or the security risk of re-using passwords). I particularly like the wa…

  2. comment
    Comment #14438196

    It's worth noting that, if you need something which runs on really low power, ARM have their R and M series processors. So even if the A series did become really power-hungry, the …

  3. comment
    Comment #14396305

    > I suspect the results in this paper could be improved with more modern gather techniques on newer x86-64 processors. By that, do you mean the AVX2 'gather' type instructions? If …

  4. comment
    Comment #14330118

    If you want exactly zero at the end points, you could do something like the post does, of approximating sin(x) / x(pi+x)(pi-x), or similar. You can still do that with the Remez alg…

  5. comment
    Comment #14280351

    The paper has a section on this, around the end of page 4, which is really interesting. The short version is: They compared their double-precision results to extremely high-precisi…

  6. comment
    Comment #14044418

    I am not a security researcher, but I think you could keep the benefits of both compression and security, as long as you're careful on the server side: Say you have a document stru…

  7. comment
    Comment #13574690

    I had an eye test recently (in the UK, if it's relevant), and they had a device which seemed to do that. You sit down, look into the device and see a blurry image, which sort of "s…

  8. comment
    Comment #13520160

    This is related to my current favourite algorithm: Because the BWT is closely related to the suffix tree of the original string, there's an algorithm to search for a substring of l…

  9. comment
    Comment #13439578

    There's a really nice article about the Postgres query optimizer, which goes into much more detail about the algorithms used (it's likely that at least the basic ideas are shared w…

  10. comment
    Comment #13349402

    Okay, so on reading through that it looks like the answer to my question is "it depends": * On-disk, the layered approach always saves space, as expected * In memory, it depends on…

  11. comment
    Comment #13349021

    (disclaimer: I haven't watched the talk yet, this is just branching off of Animats's comment) One thing I wonder, and which I don't know enough about containers to answer myself, i…

  12. comment
    Comment #13270034

    It looks like the first part of what you want is nearly there - see https://github.com/Yamakaky/rust-bindgen It converts C headers to a Rust module containing the relevant type/fun…

  13. comment
    Comment #13096876

    One of the less-well-known features of Linux is that you can do this! Theres's a thing called the "x32 ABI" (use the option -mx32 with gcc or clang; you'll need all your libraries …

  14. comment
    Comment #12998996

    (edited to add: Note that superoptimization isn't something you do to a whole program, it's more a thing you do to speed-critical sections of a larger program, ideally on the order…

  15. comment
    Comment #12944208

    My current workflow has a lot of "Run make -j to build, followed by parallel -j to run all the tests", but sometimes I want to compare/test multiple different versions of the code …

  16. comment
    Comment #12943432

    If I've read this correctly, the 'sem' mode lets you submit several lots of jobs with an overall limit on the total number of tasks running at a time (rather than one limit per lot…

  17. comment
    Comment #12943339

    This is pretty neat! A couple of thoughts spinning off from this: In the breadth-first traversal example, it looks like the resulting linked list is completely static. By that I me…

  18. comment
    Comment #12621455

    It's been mentioned below that differences in temperature matter a lot. But there's also the fact that erasing a flash block inherently damages it, progressively reducing its abili…

  19. story
  20. comment
    Comment #12187505

    The two types of "ghosts" here are very different. In both cases, though, they're mathematical artefacts rather than anything "physical", but I'll try to explain them as well as I …

  21. comment
    Comment #11840825

    So, let's call the correct value of whatever 'A'. Then "Off by X%" really means that the number you used is (1 + X/100) * A. (note: if you underestimated you need to make X negativ…

  22. comment
    Comment #11371051

    There is an exception-like mechanism in Rust, in the form of the "try!" macro. It's a lot more flexible, but somewhat more verbose (Haskell has the same mechanism in a way that loo…

  23. comment
    Comment #10873289

    As the article points out, every modern OS clears (main) memory before handing it over to a new process. The cost is often mitigated a bit by using spare CPU cycles to zero out fre…

  24. comment
    Comment #10726116

    AIUI, ZFS was explicitly designed to deal with this sort of data corruption - one of the descriptions of the design I've heard is "read() will return either the contents of a previ…

  25. comment
    Comment #10626359

    How much do you cache? Hardware is difficult because you could add/remove/swap it at any time, and software information is already partly cached depending on your OS. IIRC, Windows…