i just had to see it happen with my own eyes
Monero is actually developed by bitcoin developers under pseudonyms and Dash and ethereum are also developed by bitcoin developers under different pseudonyms ... they just want all the coinz.
Topic: [XMR] Monero - A secure, private, untraceable cryptocurrency - page 615. (Read 4670673 times)
Change DarkFlarb to the the right non-april fools word :-P
Dish? (joke)
looks good, thanks.
Just realized what day it is today… nvm.
I was interested in the future of Cryptonote when they start factoring bigger numbers. Thoughts?
I was interested in the future of Cryptonote when they start factoring bigger numbers. Thoughts?
In Quantum news: http://news.mit.edu/2016/quantum-computer-end-encryption-schemes-0303
OK, so they factored the number 15 ("who's that sniggering in the back?"), BUT it's a potentially scalable solution.
EDIT: Is it just me or is the name Isaac Chuang a beautiful synergy between east and west, ha!
http://web.mit.edu/physics/images/faculty/chuang_isaac.jpg
OK, so they factored the number 15 ("who's that sniggering in the back?"), BUT it's a potentially scalable solution.
Quote
The beginning of the end for encryption schemes?
New quantum computer, based on five atoms, factors numbers in a scalable way.
(…)
Now, in a paper published today in the journal Science, researchers from MIT and the University of Innsbruck in Austria report that they have designed and built a quantum computer from five atoms in an ion trap. The computer uses laser pulses to carry out Shor’s algorithm on each atom, to correctly factor the number 15. The system is designed in such a way that more atoms and lasers can be added to build a bigger and faster quantum computer, able to factor much larger numbers. The results, they say, represent the first scalable implementation of Shor’s algorithm.
“We show that Shor’s algorithm, the most complex quantum algorithm known to date, is realizable in a way where, yes, all you have to do is go in the lab, apply more technology, and you should be able to make a bigger quantum computer,” says Isaac Chuang, professor of physics and professor of electrical engineering and computer science at MIT. “It might still cost an enormous amount of money to build — you won’t be building a quantum computer and putting it on your desktop anytime soon — but now it’s much more an engineering effort, and not a basic physics question.”
New quantum computer, based on five atoms, factors numbers in a scalable way.
(…)
Now, in a paper published today in the journal Science, researchers from MIT and the University of Innsbruck in Austria report that they have designed and built a quantum computer from five atoms in an ion trap. The computer uses laser pulses to carry out Shor’s algorithm on each atom, to correctly factor the number 15. The system is designed in such a way that more atoms and lasers can be added to build a bigger and faster quantum computer, able to factor much larger numbers. The results, they say, represent the first scalable implementation of Shor’s algorithm.
“We show that Shor’s algorithm, the most complex quantum algorithm known to date, is realizable in a way where, yes, all you have to do is go in the lab, apply more technology, and you should be able to make a bigger quantum computer,” says Isaac Chuang, professor of physics and professor of electrical engineering and computer science at MIT. “It might still cost an enormous amount of money to build — you won’t be building a quantum computer and putting it on your desktop anytime soon — but now it’s much more an engineering effort, and not a basic physics question.”
EDIT: Is it just me or is the name Isaac Chuang a beautiful synergy between east and west, ha!
http://web.mit.edu/physics/images/faculty/chuang_isaac.jpg
See:
QC is coming, gradually at first, then quite suddenly. It really is time to panic, before the suddenly phase.
The situation gets more dire every day: http://phys.org/news/2016-03-physicists-quantum-fredkin-gate.htmlFormulate and articulate a plan to manage transition to qc-aware signature algorithms. Add necessary supporting interfaces to development plans.
Eventually someone will submit a pull request. If they know what sort of thing will be well-received, i.e. what and where are the prefered interfaces, it becomes about 100x more likely that pull request will be useful.
Shen Noether commented this on reddit:
Quote
Once the current round of improvements is finished (apps/ guis/multisig/etc) the attention will likely move to quantum secure, and hopefully by then there will be more signature implementations available to choose from, I.e. Hopefully a Bernstein type will have coded the new ref for quantum. Note that a lot of the necessary math ( I.e. Ring sigs / one time keys) has been studied already in the literature..
https://www.reddit.com/r/monero/comments/4c3f1c/monero_and_the_impending_threat_of_quantum/
Change Monero to the the right non-april fools word :-P
Just realized what day it is today… nvm.
I was interested in the future of Cryptonote when they start factoring bigger numbers. Thoughts?
I was interested in the future of Cryptonote when they start factoring bigger numbers. Thoughts?
In Quantum news: http://news.mit.edu/2016/quantum-computer-end-encryption-schemes-0303
OK, so they factored the number 15 ("who's that sniggering in the back?"), BUT it's a potentially scalable solution.
EDIT: Is it just me or is the name Isaac Chuang a beautiful synergy between east and west, ha!
http://web.mit.edu/physics/images/faculty/chuang_isaac.jpg
OK, so they factored the number 15 ("who's that sniggering in the back?"), BUT it's a potentially scalable solution.
Quote
The beginning of the end for encryption schemes?
New quantum computer, based on five atoms, factors numbers in a scalable way.
(…)
Now, in a paper published today in the journal Science, researchers from MIT and the University of Innsbruck in Austria report that they have designed and built a quantum computer from five atoms in an ion trap. The computer uses laser pulses to carry out Shor’s algorithm on each atom, to correctly factor the number 15. The system is designed in such a way that more atoms and lasers can be added to build a bigger and faster quantum computer, able to factor much larger numbers. The results, they say, represent the first scalable implementation of Shor’s algorithm.
“We show that Shor’s algorithm, the most complex quantum algorithm known to date, is realizable in a way where, yes, all you have to do is go in the lab, apply more technology, and you should be able to make a bigger quantum computer,” says Isaac Chuang, professor of physics and professor of electrical engineering and computer science at MIT. “It might still cost an enormous amount of money to build — you won’t be building a quantum computer and putting it on your desktop anytime soon — but now it’s much more an engineering effort, and not a basic physics question.”
New quantum computer, based on five atoms, factors numbers in a scalable way.
(…)
Now, in a paper published today in the journal Science, researchers from MIT and the University of Innsbruck in Austria report that they have designed and built a quantum computer from five atoms in an ion trap. The computer uses laser pulses to carry out Shor’s algorithm on each atom, to correctly factor the number 15. The system is designed in such a way that more atoms and lasers can be added to build a bigger and faster quantum computer, able to factor much larger numbers. The results, they say, represent the first scalable implementation of Shor’s algorithm.
“We show that Shor’s algorithm, the most complex quantum algorithm known to date, is realizable in a way where, yes, all you have to do is go in the lab, apply more technology, and you should be able to make a bigger quantum computer,” says Isaac Chuang, professor of physics and professor of electrical engineering and computer science at MIT. “It might still cost an enormous amount of money to build — you won’t be building a quantum computer and putting it on your desktop anytime soon — but now it’s much more an engineering effort, and not a basic physics question.”
EDIT: Is it just me or is the name Isaac Chuang a beautiful synergy between east and west, ha!
http://web.mit.edu/physics/images/faculty/chuang_isaac.jpg
What is the relationship between Darkflarb and Moner*? 
april fools.
I hope this doesn't go on all day.
What is the relationship between Darkflarb and Moner*?
april fools.
What is the relationship between Darkflarb and Moner*?
it can be setup with tor right now, but the I2p is in the pipeline IIRC
I hope Monero/I2P will be ready shortly after the C++ I2P browser is.
DarkFlarb 
it can be setup with tor right now, but the I2p is in the pipeline IIRC
So currently XMR does not have native (integrated) Tor, right?
Not "enforced", but there are guides on how to use it with TOR. See:
https://github.com/monero-project/bitmonero (check the README, under "using TOR")
Alternatively:
https://moneroexamples.github.io/compile-monero-whonix/
FYI: Tor has been compromised. I'm not sure if it would be easier to track transactions through a compromised node than not but I would think so. There are provably no logging VPN's (one had already been subpoenaed and was unable to provide much info) so I am guessing nesting one in would help. I don't really keep up too much on it so I have no Idea if you can test your tor nodes but I would think using a node that has been up for longer than the addition of the nodes that were/are compromised should be safe. I don't know the date they were added but I believe it was all at once. And I'm sure there were nodes in place that were also used so it would be a gamble I guess to even use one of those.
Hey this is a really good watch if anyone hasn't seen it.
The.Town.That.Took.On.The.Taxman
magnet:?xt=urn:btih:dedc95d700a3cf86526a5f42b8bbcb7265a2cbca&dn=BBC.The.Town.That.Took.on.the.Taxman.720p.HDTV.x265.AAC.MVGroup.Forum.mp4&tr=http%3a%2f%2fwww.mvgroup.org%3a2710%2fannounce&tr=http%3a%2f%2ftracker.ipv6tracker.org%3a80%2fannounce&tr=udp%3a%2f%2ftracker.openbittorrent.com%3a80%2fannounce&tr=udp%3a%2f%2ftracker.coppersurfer.tk%3a6969%2fannounce&tr=udp%3a%2f%2ftracker.leechers-paradise.org%3a6969%2fannounce&tr=udp%3a%2f%2fopen.demonii.com%3a1337%2fannounce&tr=udp%3a%2f%2finferno.demonoid.ooo%3a3392%2fannounce
it can be setup with tor right now, but the I2p is in the pipeline IIRC
So currently XMR does not have native (integrated) Tor, right?
Not "enforced", but there are guides on how to use it with TOR. See:
https://github.com/monero-project/bitmonero (check the README, under "using TOR")
Alternatively:
https://moneroexamples.github.io/compile-monero-whonix/
it can be setup with tor right now, but the I2p is in the pipeline IIRC
So currently XMR does not have native (integrated) Tor, right?
If you are keen on iptables -> https://www.elrippoisland.net/public/how_to/anonymity.html
it can be setup with tor right now, but the I2p is in the pipeline IIRC
So currently XMR does not have native (integrated) Tor, right?
it can be setup with tor right now, but the I2p is in the pipeline IIRC
Does XMR use Tor or I2P ?
I predict a QC threat will come right after the ubiquitous flying car.
Getting ahead of the issue can only be good for XMR. Failing to do so can only be bad.Nothing wrong with getting ahead of the (not fully formed) issue, unless it takes limited resources away from (more clearly defined) projects with better infrastructural return in the short run.
Thank you for the answers.
For 1. I understood now and I will also do the reading on reddit
About 2. I am still uncertain ... is sweep_dust for free? Or how can its cost be calculated?
For 1. I understood now and I will also do the reading on reddit
About 2. I am still uncertain ... is sweep_dust for free? Or how can its cost be calculated?
I read your post incorrectly. I think you can't really calculate its costs precisely in advance. However, if you use the command simplewallet will give you the cost before sending if I recall correctly.
Thank you for the answers.
For 1. I understood now and I will also do the reading on reddit
About 2. I am still uncertain ... is sweep_dust for free? Or how can its cost be calculated?
For 1. I understood now and I will also do the reading on reddit
About 2. I am still uncertain ... is sweep_dust for free? Or how can its cost be calculated?
Hi,
I am a little late with this, but I need a little bit of help with 2 problems.
I switched to 0.9.1.0 Hydrogen Helix.
1.
One sweet surprise was that finally I can use view-only wallets too. (Thank you and well done!)
However, something is not as good as I'd wish:
In the case the wallet was used to also send out coins, the displayed balance is incorrect: it shows the amount of received coins without subtracting the sent out coins.
Am I doing something wrong, is there something I can do to see correct value, or it's a known bug?
2.
I have some dust, mostly from early mining. I've seen that it can be "consolidated". How can I know how much that consolidation costs (to see if it worth it)?
Thanks
I am a little late with this, but I need a little bit of help with 2 problems.
I switched to 0.9.1.0 Hydrogen Helix.
1.
One sweet surprise was that finally I can use view-only wallets too. (Thank you and well done!)
However, something is not as good as I'd wish:
In the case the wallet was used to also send out coins, the displayed balance is incorrect: it shows the amount of received coins without subtracting the sent out coins.
Am I doing something wrong, is there something I can do to see correct value, or it's a known bug?
2.
I have some dust, mostly from early mining. I've seen that it can be "consolidated". How can I know how much that consolidation costs (to see if it worth it)?
Thanks
[1] The viewkey only shows incoming transactions, therefore the "balance" is incorrect when there are also outgoing transactions. There is a way to show outgoing transactions too, but it is a bit more convoluted than we initially thought. Convuluted as in it isn't done by a simple "key". See discussion here:
https://www.reddit.com/r/Monero/comments/4ce5ui/what_is_the_use_of_view_only_wallet_when_its/
[2] You can use the sweep_dust command to do that.
Jump to: