• Carl [he/him]@hexbear.net
    link
    fedilink
    English
    arrow-up
    21
    ·
    1 day ago

    damn it peaked at 125k last time.

    Every time this happens I hope it’s the final one, and so far every time I’ve been disappointed.

    • whiskers165@lemmy.ml
      link
      fedilink
      arrow-up
      6
      ·
      1 day ago

      I think you might wanna get ready for more disappointment, say maybe two or three years from now

    • CanadaPlus@lemmy.sdf.org
      link
      fedilink
      arrow-up
      4
      ·
      edit-2
      1 day ago

      Quantum computing will eventually make specifically Bitcoin worthless. Eth at least gets upgrades, so it might survive.

        • CanadaPlus@lemmy.sdf.org
          link
          fedilink
          arrow-up
          2
          ·
          edit-2
          2 hours ago

          Depends what you’re ascribing to it.

          Will it break encryption? Yes. That’s been well understood since the 90’s.

          Will it help solve certain specific physics problems, including practical ones? Also yes.

          Will it do literally anything else? Maybe, maybe not. Honestly, even calling it a “computer” is misleading unless you’re an expert. For layman purposes it’s more like an electron microscope or ultracentrifuge. Very useful for a very narrow set of tasks.

          • GiorgioPerlasca@lemmy.ml
            link
            fedilink
            arrow-up
            1
            ·
            40 minutes ago

            I know about Shor and Grover algorithms and database search. My doubts are about the availability of scalable implementations of Quantum compunting.

            • CanadaPlus@lemmy.sdf.org
              link
              fedilink
              arrow-up
              2
              ·
              edit-2
              15 minutes ago

              Ah. Yeah, that’s not a sure thing, but progress has been very, very encouraging lately, and there’s no obvious fundamental limit, either. Advancement in the error correcting codes has even happened, which was unexpected when the big push to build a QC began.

              (FWIW, Grover’s search algorithm is more of a toy than anything. You’re getting a quadratic speedup on exponentially hard problems, which leaves them still exponentially hard)