Live data from Hacker News

Viewing profile — ivancho

ivancho

HN member
Joined
Tue, Jun 02, 2009, 7:40 PM UTC
HN karma
121
Public activity
73 items

About ivancho

[ my public key: https://keybase.io/ivancho; my proof: https://keybase.io/ivancho/sigs/3C6HaZKd1uSVQiqL0ly24b0RG753TlHr3E7393X3V3I ]

Recent public activity

  1. comment
    Comment #41620138

    Yeah, you can look in the contributors' dashboard, they stopped around 2019. As any documentation, its fate is to wither and fall into decay. But hey, he got a book out of it.

  2. comment
    Comment #41614222

    So we'll have expensive artisanal software for rich people? Self-assembly takes a whole new meaning for the rest of us.

  3. comment
    Comment #41614203

    That's a pretty narrow view of software too. The nature of building software systems is not always towards being able to mass-produce them. What would be the point of copying and d…

  4. comment
    Comment #41201497

    It's complete nonsense. "The total number of moves in the game is equal to the number of stones initially in the pile, which is 5000." Similarly on the Martian question "If we tran…

  5. comment
    Comment #41201309

    So, "it is really mostly a matter of luck", and just do so much work that they decide to fire someone else... sigh . If only there was some way for the workers to negotiate collect…

  6. comment
    Comment #40813144

    I think the anecdote highlights that there's no incremental way to approach gRPC, it's not a low risk small footprint prototype project that can be introduced slowly and integrated…

  7. comment
    Comment #40717376

    My model was not to demonstrate that utility doesn't go down ever, it was to show that it can do that extremely slowly, which makes the utility argument about why we discourage it …

  8. comment
    Comment #40627607

    This is a bit of a stretch from what I said - 1% drop after the entire population has gambled through 10x their net worth is not meaningful. I also pointed out other speculative ac…

  9. comment
    Comment #40625993

    Ok, take 100 people, with $100 each, and have one round of $1 coin flips between each 2. A significant number of bets overall, 4950. Each person has wagered 1% of their net worth 9…

  10. comment
    Comment #40625233

    You haven't demonstrated most of these assertions. For example, if everyone gambled against everyone else every second, then that system has a pretty good chance of staying close t…

  11. comment
    Comment #40112152

    Ah, a brilliant idea, design all languages so people who only know C can make small changes to existing Ruby code without getting confused. Definitely don't want to enable differen…

  12. comment
    Comment #39409574

    Even more so then. Simplify, simplify, simplify!

  13. comment
    Comment #39255201

    What is your certainty that that statement is true? What if it was a calculation which takes decades on a supercomputer?

  14. comment
    Comment #39255032

    I'm not gatekeeping proofs here, and I'm glad you got math pizza :) If proofwiki had exhaustively printed all possible arrangements, or the decision tree of constructing them, or i…

  15. comment
    Comment #39253749

    Their "proof" that there are only 12 solutions to 8 Mutually Non-Attacking Queens on Chessboard is just "That there are only these 12 can be proved by brute force." :/

  16. comment
    Comment #39252187

    There is extensive research on key finding attacks. Often they only need 30% of the bits. Things can be sped up by exploiting entropy - keys are really random, unlike most of the r…

  17. comment
    Comment #39251229

    I think the dunk is funny, and at the same time recognize that glibc is invaluable. At least here the attackers had to do some memory tricks - in other (apparently safer) languages…

  18. comment
    Comment #39249097

    You can't simultaneously have that key strength is maintained as long as they don't know how many bits are flipped, or where in memory the key was, but also that leaking any number…

  19. comment
    Comment #39249020

    The original comment said "One bit flip and it's game over". Which is clear nonsense, I don't have to specify that there's exactly one bit flip, I just need to know that the key is…

  20. comment
    Comment #39248969

    I think this needs its own cognitive term, it's not a survivorship or selection bias, it's just skipping the selection entirely and just focusing on the sample. So here people go "…

  21. comment
    Comment #39248871

    What the hell are we doing as an industry? We have 20 cores per CPU and enough RAM to fit the entire human civilization's knowledge in text form in everyone's pocket, but we can't …

  22. comment
    Comment #38969945

    I have not conceded anything. Many crimes would be perfectly unsolvable if everyone did everything perfectly, and yet.. You are again using "logically impossible" while insisting o…

  23. comment
    Comment #38953657

    But we don't have to search for those keys in all of the deposits that CM ever made - only in the ones that stopped churning and mixing. Maybe they try to control the dynamics of t…

  24. comment
    Comment #38951733

    I disagree with pretty much every point here, wow. ChipMixer provided a little bit of disconnect, but there was a research paper a while back that ran something like 5 transfers th…

  25. comment
    Comment #38947795

    Except with packet switching networks I can immediately point to the problem they are solving and can also make a guess how things will change when we create 000s of bigger and bet…