Re: Hello

  • From: lindsey kiviets <lindseyak@xxxxxxxxxxx>
  • To: "cpt-fgc@xxxxxxxxxxxxx" <cpt-fgc@xxxxxxxxxxxxx>
  • Date: Tue, 27 Jun 2017 08:50:43 +0000

Genesis mining,


get it now, buy some litecoin and wait 4 months and then gg, instant 1080ti


________________________________
From: cpt-fgc-bounce@xxxxxxxxxxxxx <cpt-fgc-bounce@xxxxxxxxxxxxx> on behalf of 
Wynand-Ben <paashaasggx@xxxxxxxxxxx>
Sent: 27 June 2017 08:49 AM
To: cpt-fgc@xxxxxxxxxxxxx
Subject: Re: Hello


I want a 1080ti


________________________________
From: cpt-fgc-bounce@xxxxxxxxxxxxx <cpt-fgc-bounce@xxxxxxxxxxxxx> on behalf of 
lindsey kiviets <lindseyak@xxxxxxxxxxx>
Sent: Tuesday, June 27, 2017 10:47 AM
To: cpt-fgc@xxxxxxxxxxxxx
Subject: Re: Hello


tsek man


tell me, whats this ddram thing


________________________________
From: cpt-fgc-bounce@xxxxxxxxxxxxx <cpt-fgc-bounce@xxxxxxxxxxxxx> on behalf of 
Ilitirit Sama <ilitirit@xxxxxxxxx>
Sent: 27 June 2017 08:44 AM
To: cpt-fgc@xxxxxxxxxxxxx
Subject: Re: Hello

1.  gg
2.  gg

On Tue, Jun 27, 2017 at 10:43 AM, lindsey kiviets 
<lindseyak@xxxxxxxxxxx<mailto:lindseyak@xxxxxxxxxxx>> wrote:

  1.  ddram issue?
  2.  gg


________________________________
From: cpt-fgc-bounce@xxxxxxxxxxxxx<mailto:cpt-fgc-bounce@xxxxxxxxxxxxx
<cpt-fgc-bounce@xxxxxxxxxxxxx<mailto:cpt-fgc-bounce@xxxxxxxxxxxxx>> on behalf 
of Ilitirit Sama <ilitirit@xxxxxxxxx<mailto:ilitirit@xxxxxxxxx>>
Sent: 27 June 2017 08:39 AM
To: cpt-fgc@xxxxxxxxxxxxx<mailto:cpt-fgc@xxxxxxxxxxxxx>
Subject: Re: Hello

1.  So you now about the DDRAM issue?
2.  Quantum PC's are most not certainly not a thing.  Quantum Computing is.  
And that machine that you showed uses a process called Quantum Annealing, and 
in fact it cannot even run Shor's Algorithm.

Lemme lern you:

Post-quantum cryptography refers to 
cryptographic<https://en.wikipedia.org/wiki/Cryptographic_primitive> algorithms 
(usually public-key<https://en.wikipedia.org/wiki/Public-key_cryptosystem
algorithms) that are thought to be secure against an attack by a quantum 
computer<https://en.wikipedia.org/wiki/Quantum_computing>. This is not true for 
the most popular public-key algorithms, which can be efficiently broken by a 
sufficiently large quantum computer. The problem with the currently popular 
algorithms is that their security relies on one of three 
hard<https://en.wikipedia.org/wiki/NP-hardness> mathematical problems: the 
integer factorization 
problem<https://en.wikipedia.org/wiki/Integer_factorization_problem>, the 
discrete logarithm 
problem<https://en.wikipedia.org/wiki/Discrete_logarithm_problem> or the 
elliptic-curve discrete logarithm 
problem<https://en.wikipedia.org/wiki/Elliptic-curve_discrete_logarithm_problem>.
 All of these problems can be easily solved on a sufficiently powerful quantum 
computer running Shor's 
algorithm<https://en.wikipedia.org/wiki/Shor%27s_algorithm>.[1]<https://en.wikipedia.org/wiki/Post-quantum_cryptography#cite_note-shor-algorithm-1>[2]<https://en.wikipedia.org/wiki/Post-quantum_cryptography#cite_note-djb-intro-2>
https://en.wikipedia.org/wiki/Post-quantum_cryptography

So now you know where the "crypto" in "cryptocurrency" comes from.

(Quantum Annealing is used to solve very specific types of problems.  Certainly 
not BTC mining...)


On Tue, Jun 27, 2017 at 10:32 AM, lindsey kiviets 
<lindseyak@xxxxxxxxxxx<mailto:lindseyak@xxxxxxxxxxx>> wrote:

  1.  tsek, I did my research
  2.  Quantum PC's are a thing, if someone had to mine BTC from that thing it 
would be gg. Moors law is gna take a jump, instead of 2 years, we gna see tech 
double in the next 15 months.


________________________________
From: cpt-fgc-bounce@xxxxxxxxxxxxx<mailto:cpt-fgc-bounce@xxxxxxxxxxxxx
<cpt-fgc-bounce@xxxxxxxxxxxxx<mailto:cpt-fgc-bounce@xxxxxxxxxxxxx>> on behalf 
of Ilitirit Sama <ilitirit@xxxxxxxxx<mailto:ilitirit@xxxxxxxxx>>
Sent: 27 June 2017 08:21 AM
To: cpt-fgc@xxxxxxxxxxxxx<mailto:cpt-fgc@xxxxxxxxxxxxx>
Subject: Re: Hello

1. What investment?  The 1080TI?  Did you really buy that card without doing 
any research?  Do you want me to make you cry now or later?
2. The difficulty in cryptography is analogous to trying to determine the 
constituents of a cup of coffee (ie. coffee granules + water + milk etc) .  The 
only way way that we know how is to try to make millions and millions of cups 
of coffee using random amounts of coffee/tea/sugar/milk and check if we get 
something that resembles the original cup.  This is a **very** hard problem.  
There is no computer powerful enough on Earth to do it with the efficiency that 
will be even remotely scary.  Let me put it like this:  If they can build a 
computer powerful enough to do what you're afraid of then we have *much* bigger 
problems than just people getting rich...


Other related posts: