Live data from Hacker News

Viewing profile — LegionMammal978

LegionMammal978

HN member
Joined
Sat, Feb 20, 2021, 1:50 AM UTC
HN karma
3,380
Public activity
1,400 items

About LegionMammal978

No profile information was provided.

Recent public activity

  1. comment
    Comment #49225099

    One curiosity that in the case of infinite graphs, "no odd cycles" doesn't imply "2-colorable" without the axiom of choice for families of 2-element sets [0]. It's somewhat similar…

  2. comment
    Comment #49205842

    "The set is not collinear" here means "there is no straight line passing through all the points simultaneously", not "there is no straight line passing through some three points".

  3. comment
    Comment #49150296

    > Corollary 14 (There is no such thing as a torsor). A torsor is defined as a “group without a distinguished identity element.” No such object exists. The proof is immediate from t…

  4. comment
    Comment #49141320

    As it happens, the Python verifier mmverify.py has an even simpler soundness bug [0], and so far I've reviewed two independent AI-written verifiers that have replicated that bug, s…

  5. comment
    Comment #48785672

    The problem is, some information is interesting only to a tiny audience long after the fact, so there's no chance anyone would've thought to curate it in the moment. E.g., for a fe…

  6. comment
    Comment #48515902

    On the other hand, there's been an endless parade of recent posts from other FOSS maintainers saying "we don't want your drive-by PRs": it's not hard to see people getting dissuade…

  7. comment
    Comment #48237713

    To be fair, in the most literal sense, the vast majority of syntactically-valid statements in a typical FOL encoding will be trivial. One of my side-projects has been trying to fin…

  8. comment
    Comment #48108214

    I always thought of it as analogous to the silent Ls in would / should / could , calf , half , chalk , caulk , and Polk .

  9. comment
    Comment #48096541

    I did actually make an attempt at that once for BGGP5 [0]. (That is, making a minimal, horribly insecure 'client' implementing just enough behavior to get a response from a server.…

  10. comment
    Comment #48062299

    Alas, compilers have historically fudged the behavior on some 32-bit targets, e.g., x86 targets without SSE2 [0], so you'd have to go all the way to soft-float implementations if y…

  11. comment
    Comment #48062039

    At least the Rust compiler (TFA's project is written in Rust) tries to configure LLVM specifically to avoid these discrepancies, and to treat all basic floating-point operations ex…

  12. comment
    Comment #48061903

    Yeah, in general, this is a problem that people have spent a lot of time thinking about; while floating-point numbers can be finicky, they're what you have to work with if you have…

  13. comment
    Comment #48022593

    sRGB has bugged me from the start, since it's not even clear to me which actual matrix to use to convert between linear sRGB colors and XYZ colors. I count at least 3 different mat…

  14. comment
    Comment #48017089

    You can pick a uniform random orientation without trig functions by first generating a random point in the unit disk via rejection sampling, then projecting it onto the boundary [0…

  15. comment
  16. comment
    Comment #47989473

    > But what about the range? While it’s true that you get twice the range, surprisingly often the code in the range above signed-int max is quite bug-ridden. Any code doing somethin…

  17. comment
    Comment #47965338

    > However, an axiom of infinity is independent, it doesn’t contradict anything in standard formalizations, and so it doesn’t make sense to say “infinity is wrong”. Suppose we start…

  18. comment
  19. comment
    Comment #47883964

    > The implicit update surface is somewhat limited by the fact that versions in Cargo.toml implicitly assume the `^` operator on versions that don't specify a different operator, so…

  20. comment
    Comment #47863790

    Traditionally in x86, only the first byte is the opcode used to select the instruction, and any further bytes contain only operands. Thus, since there exist 256 possible values for…

  21. comment
    Comment #47644080

    Try 81 bytes for an x86-64 executable, or 77 bytes for the same if you run it on a VM with 5-level paging: https://tmpout.sh/3/22.html

  22. comment
    Comment #47602501

    Even in a NAT-less world, the common advice is to use a firewall rule that disallows incoming connections by default. (And I'd certainly be worried if typical home routers were con…

  23. comment
    Comment #47577591

    > The LLM can a priori test on all possible software and hardware environments, test all possible edge cases for deployment, get feedback from millions of eyes on the project expli…

  24. comment
    Comment #47568762

    > But the users would have to maintain their own forks then. I suppose the idea would be, they don't have to maintain it: if it ever starts to rot from whatever environmental chang…

  25. comment
    Comment #47412642

    Just looking at the formula in the code (and the book it came from), we see that the approximation is of form arcsin(x) = π/2 - P(x)*sqrt(1-x). It is called a minimax solution in b…