Bitcoin Forum
September 20, 2017, 11:29:54 AM *
News: Latest stable version of Bitcoin Core: 0.15.0.1  [Torrent]. (New!)
 
   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 ... 560 »
  Print  
Author Topic: IOTA  (Read 970406 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.
child_harold
Hero Member
*****
Offline Offline

Activity: 812



View Profile
December 21, 2015, 10:18:07 PM
 #1181

Forgive my brevity but I'm short on time
Short answers preferred, thanks.

1. Will there be an explorer for IOTA?
2. Is IOTA susceptible to double-spends?
3. Is there any kind of scripting language in IOTA? (Ethereum style)
4. Does IOTA afford better anonymity than Bitcoin?
5. Does IOTA require/benefit from decentralized nodes? (Bitcoin-style)
6. Where do JINN and ternary procs fit in?
7. When are we "Quantum Secure"? After XMAS?

1. Yes
2. Depends on merchant policy
3. No
4. No
5. Didn't get the question
6. Iota works with trits instead of bits
7. From the very beginning

Thanks

Follow-up:
2. Depends on merchant policy

Is this a concern? You seem pretty relaxed on the issue, am I missing something?


1505906994
Hero Member
*
Offline Offline

Posts: 1505906994

View Profile Personal Message (Offline)

Ignore
1505906994
Reply with quote  #2

1505906994
Report to moderator
          ▄█████▄
        ▄█████████▄
      ▄████▀   ▀████▄
    ▄████▀   ▄ ▄█▀████▄
  ▄████▀   ▄███▀   ▀████▄
▄████▀   ▄███▀   ▄   ▀████▄
█████   ███▀   ▄███   █████
▀████▄   ▀██▄▄███▀   ▄████▀
  ▀████▄   ▀███▀   ▄████▀
    ▀████▄       ▄████▀
      ▀████▄   ▄████▀
        ▀███  ████▀
          ▀█▄███▀
.
|
.
|
          ▄█████▄
        ▄█████████▄
      ▄████▀   ▀████▄
    ▄████▀   ▄ ▄█▀████▄
  ▄████▀   ▄███▀   ▀████▄
▄████▀   ▄███▀   ▄   ▀████▄
█████   ███▀   ▄███   █████
▀████▄   ▀██▄▄███▀   ▄████▀
  ▀████▄   ▀███▀   ▄████▀
    ▀████▄       ▄████▀
      ▀████▄   ▄████▀
        ▀███  ████▀
          ▀█▄███▀
unthy
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1505906994
Hero Member
*
Offline Offline

Posts: 1505906994

View Profile Personal Message (Offline)

Ignore
1505906994
Reply with quote  #2

1505906994
Report to moderator
smaragda
Legendary
*
Offline Offline

Activity: 1414



View Profile
December 21, 2015, 10:21:31 PM
 #1182

It must be 81 chars long and can contain '9' and lowercase latin letters.
The seed must contain up to 81 chars. Lower case latin letters and "9" are allowed.

Has something changed (Re: bold parts)?   Undecided

Simcoin (SIM) & CryptoPlay (CPS) DEV NxtChg IS A FUCKIN' LOW-LIFE PIECE OF SHIT EMBEZZLING PSYCHOPATH   Angry
https://bitcointalk.org/index.php?topic=929688.msg10205597#msg10205597                    "A world with the money can not be perfect." - BCNext
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1708

Newbie


View Profile
December 21, 2015, 10:26:10 PM
 #1183

Cuckoo Cycle reduces the gap between commodity and custom hardware by being memory bound, making mining less centralized.

What is the time-memory ratio for algorithm that works with 1 million smaller RAM?
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1708

Newbie


View Profile
December 21, 2015, 10:29:41 PM
 #1184

Is this a concern? You seem pretty relaxed on the issue, am I missing something?

Some merchants accept transfers with 0 (or very few) confirmations. This is why "merchant policy". Those who like risk and can't afford to hire Chuck Norris may become a victim of a doublespending.
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1708

Newbie


View Profile
December 21, 2015, 10:31:11 PM
 #1185

It must be 81 chars long and can contain '9' and lowercase latin letters.
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.
tromp
Hero Member
*****
Offline Offline

Activity: 494


View Profile
December 21, 2015, 10:36:03 PM
 #1186

Cuckoo Cycle reduces the gap between commodity and custom hardware by being memory bound, making mining less centralized.

What is the time-memory ratio for algorithm that works with 1 million smaller RAM?

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...
smaragda
Legendary
*
Offline Offline

Activity: 1414



View Profile
December 21, 2015, 10:39:58 PM
 #1187

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

You mean qwerty9!  Cheesy

Although I had a rough time reaching 81 chars and was hoping I could do less at the time, I'm sticking with it.

Simcoin (SIM) & CryptoPlay (CPS) DEV NxtChg IS A FUCKIN' LOW-LIFE PIECE OF SHIT EMBEZZLING PSYCHOPATH   Angry
https://bitcointalk.org/index.php?topic=929688.msg10205597#msg10205597                    "A world with the money can not be perfect." - BCNext
Come-from-Beyond
Legendary
*
Offline Offline

Activity: 1708

Newbie


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

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).
rlh
Hero Member
*****
Offline Offline

Activity: 775


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

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: 1708

Newbie


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

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: 494


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

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: 1708

Newbie


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

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: 494


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

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: 1708

Newbie


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

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
 #1195

THE SALE IS OVER!

tolstoy
Member
**
Offline Offline

Activity: 89


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

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
 #1197

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

Activity: 760


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

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
 #1199

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: 494


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

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.

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 ... 560 »
  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!