Bitcoin Forum
November 20, 2017, 06:33:58 AM *
News: Latest stable version of Bitcoin Core: 0.15.1  [Torrent].
 
   Home   Help Search Donate Login Register  
Pages: « 1 ... 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 [60] 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 ... 596 »
  Print  
Author Topic: IOTA  (Read 1101934 times)
This is a self-moderated topic. If you do not want to be moderated by the person who started this topic, create a new topic.
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1764

Newbie


View Profile
December 21, 2015, 10:45:20 PM
 #1181

The best-known tmto algorithm is 20 million times slower with 1 millionth' the memory.

Of course, even being just 200 times slower means you will rarely find a block
if the block interval is just 100 proof attempts long...

This is where we stopped the last time - I claimed that it's not a problem for a QC to do 20 million computations at once (25X qubits is enough to do a computation on 33 million sets of data). In this situation someone ought to prove that that particular algorithm is quantum-resistant, otherwise we can't accept that PoW blockchain are secure (burden of proof in cryptography lays on one claiming that an algorithm is secure, not the other way around).
1511159638
Hero Member
*
Offline Offline

Posts: 1511159638

View Profile Personal Message (Offline)

Ignore
1511159638
Reply with quote  #2

1511159638
Report to moderator
Join ICO Now Coinlancer is Disrupting the Freelance marketplace!
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1511159638
Hero Member
*
Offline Offline

Posts: 1511159638

View Profile Personal Message (Offline)

Ignore
1511159638
Reply with quote  #2

1511159638
Report to moderator
1511159638
Hero Member
*
Offline Offline

Posts: 1511159638

View Profile Personal Message (Offline)

Ignore
1511159638
Reply with quote  #2

1511159638
Report to moderator
1511159638
Hero Member
*
Offline Offline

Posts: 1511159638

View Profile Personal Message (Offline)

Ignore
1511159638
Reply with quote  #2

1511159638
Report to moderator
rlh
Hero Member
*****
Offline Offline

Activity: 775


View Profile
December 21, 2015, 10:50:05 PM
 #1182

It must be 81 chars long and can contain '9' and lowercase latin letters.
Quote from: Come-from-Beyond link=totpic=1216479.msg13320085#msg13320085 date=1450735293
The seed must contain up to 81 chars. Lower case latin letters and "9" are allowed.

Has something changed (Re: bold parts)?   Undecided

Yes, I made it more user-friendly, those who can't memorize 81 chars are allowed to use "qwerty" and the like.

Please publish the code for genning addresses.  I'll update my functional C# version (not yet published.)

A Personal Quote on BTT from 2011:
"I'd be willing to make a moderate "investment" if the value of the BTC went below $2.00.  Otherwise I'll just have to live with my 5 BTC and be happy. :/"  ...sigh.  If only I knew.
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1764

Newbie


View Profile
December 21, 2015, 10:58:05 PM
 #1183

Please publish the code for genning addresses.  I'll update my functional C# version (not yet published.)

view-source:http://188.138.57.93/addressgenerator.html
tromp
Hero Member
*****
Offline Offline

Activity: 502


View Profile
December 21, 2015, 11:19:41 PM
 #1184

The best-known tmto algorithm is 20 million times slower with 1 millionth' the memory.

Of course, even being just 200 times slower means you will rarely find a block
if the block interval is just 100 proof attempts long...

This is where we stopped the last time - I claimed that it's not a problem for a QC to do 20 million computations at once (25X qubits is enough to do a computation on 33 million sets of data).

It is a big misconception to think that QC are some magical device that can speedup arbitrary computation. Evidence suggests that they have limited speedup applicability
(all variations of Grover's unstructured search and Shor's group structured search).

I think I urged you to read Scott Aaronson's
"The Limits of Quantum Computers"
http://www.scottaaronson.com/writings/limitsqc-draft.pdf
last time, to correct this misconception.


Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1764

Newbie


View Profile
December 21, 2015, 11:24:02 PM
 #1185

It is a big misconception to think that QC are some magical device that can speedup arbitrary computation. Evidence suggests that they have limited speedup applicability
(all variations of Grover's unstructured search and Shor's group structured search).

I think I urged you to read Scott Aaronson's
"The Limits of Quantum Computers"
http://www.scottaaronson.com/writings/limitsqc-draft.pdf
last time, to correct this misconception.

Yes, and I quoted text that was proving my point.
tromp
Hero Member
*****
Offline Offline

Activity: 502


View Profile
December 21, 2015, 11:32:30 PM
 #1186

It is a big misconception to think that QC are some magical device that can speedup arbitrary computation. Evidence suggests that they have limited speedup applicability
(all variations of Grover's unstructured search and Shor's group structured search).

I think I urged you to read Scott Aaronson's
"The Limits of Quantum Computers"
http://www.scottaaronson.com/writings/limitsqc-draft.pdf
last time, to correct this misconception.

Yes, and I quoted text that was proving my point.

You didn't prove any point. You just vaguely alluded that since QC can do many computations in superposition, that it must somehow speedup Cuckoo Cycle finding.
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1764

Newbie


View Profile
December 21, 2015, 11:40:56 PM
 #1187

You didn't prove any point. You just vaguely alluded that since QC can do many computations in superposition, that it must somehow speedup Cuckoo Cycle finding.

Is it what was written in that paper? That by increasing number of qubits 30-fold number of computations done within the same timeframe is increased 1'000'000'000-fold?
iotatoken
Hero Member
*****
Offline Offline

Activity: 714


View Profile
December 22, 2015, 12:00:02 AM
 #1188

THE SALE IS OVER!

tolstoy
Member
**
Offline Offline

Activity: 89


View Profile
December 22, 2015, 12:59:51 AM
 #1189

Google’s Quantum Dream Machine
http://www.technologyreview.com/news/544421/googles-quantum-dream-machine/

Google Says It Has Proved Its Controversial Quantum Computer Really Works
http://www.technologyreview.com/news/544276/google-says-it-has-proved-its-controversial-quantum-computer-really-works/

When can Quantum Annealing win?
http://googleresearch.blogspot.com/2015/12/when-can-quantum-annealing-win.html

New Research Injects Optimism into Question of Quantum Computers
http://electronicdesign.com/microprocessors/new-research-injects-optimism-question-quantum-computers

twistelaar
Legendary
*
Offline Offline

Activity: 1120


View Profile
December 22, 2015, 01:27:52 AM
 #1190

When is the launch?
Tobo
Hero Member
*****
Offline Offline

Activity: 762


View Profile
December 22, 2015, 01:32:06 AM
 #1191

Yes, I made it more user-friendly, those who can't memorize 81 chars are allowed to use "qwerty" and the like.

Do you have a recommended minimum chars?
iotatoken
Hero Member
*****
Offline Offline

Activity: 714


View Profile
December 22, 2015, 01:41:24 AM
 #1192

When is the launch?

Beta: soon. Waiting for reviews and nodes. Christmas now, so development will naturally be slightly lower than previous, then full launch in January as planned.

tromp
Hero Member
*****
Offline Offline

Activity: 502


View Profile
December 22, 2015, 01:58:12 AM
 #1193

You didn't prove any point. You just vaguely alluded that since QC can do many computations in superposition, that it must somehow speedup Cuckoo Cycle finding.

Is it what was written in that paper? That by increasing number of qubits 30-fold number of computations done within the same timeframe is increased 1'000'000'000-fold?

I don't think the paper would be discussing a 30 fold increase in qubits.
More likely they discussed an extra 30 qubits.

For some very particular computation, like integer factoring,
an extra 30 qubits allow you to factorize a number that has 15 more bits.
(http://arxiv.org/abs/quant-ph/0205095 showed a Circuit for Shor's algorithm using 2n+3 qubits).

So in that case you have 2^15 more states in superposition.

CryptoSporidium
Sr. Member
****
Offline Offline

Activity: 382


View Profile WWW
December 22, 2015, 03:15:27 AM
 #1194

Is IOTA connected with nxthaus in any way? I believe David was involved with that project but can't find any current info on nxthaus. Will iota be traded on that exchange?
iotatoken
Hero Member
*****
Offline Offline

Activity: 714


View Profile
December 22, 2015, 03:17:45 AM
 #1195

Is IOTA connected with nxthaus in any way? I believe David was involved with that project but can't find any current info on nxthaus. Will iota be traded on that exchange?

Not connected at all and I was only peripherally involved in getting a fiat gateway setup. I have spoken with the team and they consider adding it

Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1764

Newbie


View Profile
December 22, 2015, 03:41:43 AM
 #1196

I don't think the paper would be discussing a 30 fold increase in qubits.
More likely they discussed an extra 30 qubits.

I took the worst-case scenario, e.g. from 10 to 300 qubits. In your case the same effect is achieved with 10 -> 40 transition.
BlackWidow
Sr. Member
****
Offline Offline

Activity: 364



View Profile
December 22, 2015, 09:33:41 AM
 #1197

Really great job guys!!

Well done.

This is the start of a new era.

Can someone explain in "tangle for dummies" terms how Iota is quantum resistant and how Bitcoin is not?

       ▄▄▀▀▀▀▀▀▀▀▀▄▄
    ▄█▀ ▄▄███████▄▄ ▀
  ▄█▀ ▄████████▀▀ ▄▄█▀ ▄▄
 ▄▀ ▄██████▀▀ ▄▄███▀ ▄▄ ▀▄
▄█ ████▀▀ ▄▄█████▀ ▄████ █▄
█ ▄█████▄  ▀██████▄ ▀███▄ █
█ ███▀▀▀ ▄███████▀ ▄▄▄███ █
█ ▀███▄ ▀██████▄  ▀█████▀ █
▀█ ████▀ ▄█████▀▀ ▄▄████ █▀
 ▀▄ ▀▀ ▄███▀▀ ▄▄██████▀ ▄▀
  ▀▀ ▄█▀▀ ▄▄████████▀ ▄█▀
    ▄ ▀▀███████▀▀ ▄█▀
       ▀▀▄▄▄▄▄▄▄▄▄▀▀
electroneum▄████████████▄
██████▄▄▄▄██████
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█              █
          ▄   █
     ▄▄██▀    █
    ▄▄██▀▀    █
    ▄█▀▀▀     █
   ▀          █
█              █
█              █
███████▀▀███████
 ▀█████▄▄█████▀
▄██████████████▄
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█              █
█              █
          ▄   █
     ▄▄▄█▀    █
    ▄▄██▀▀    █
    ▄█▀▀▀     █
   ▀          █
█              █
█              █
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
▀█████▄▄▄▄█████▀
||
iotatoken
Hero Member
*****
Offline Offline

Activity: 714


View Profile
December 22, 2015, 10:06:32 AM
 #1198

Really great job guys!!

Well done.

This is the start of a new era.

Can someone explain in "tangle for dummies" terms how Iota is quantum resistant and how Bitcoin is not?

Thanks!
This should help: https://bitscan.com/articles/all-about-iota-ii-the-tangle-and-quantum-resistant-cryptography

I-Love-Iota
Newbie
*
Offline Offline

Activity: 5


View Profile
December 22, 2015, 12:06:18 PM
 #1199

My best congratulations.  There is so much work to do, the community support is significant and it is necessary.
iotatoken
Hero Member
*****
Offline Offline

Activity: 714


View Profile
December 22, 2015, 12:24:35 PM
 #1200

My best congratulations.  There is so much work to do, the community support is significant and it is necessary.


Indeed.


Everyone that wants to participate in making IOTA grow, send me a PM with your email and skills and I'll invite you into our Ryver!

Pages: « 1 ... 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 [60] 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 ... 596 »
  Print  
 
Jump to:  

Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!