3 ms·
You can trivially distinguish those transactions from real ones. In fact so trivial that you could do it in one if clause #define LATEST_BLOCK_BEFORE_EMERG
by Erlich_Bachman 6y ago
You can trivially distinguish those transactions from real ones. In fact so trivial that you could do it in one if clause
#define LATEST_BLOCK_BEFORE_EMERGENCE_OF_QC 76283747
# fill in number when that happens
if (block_height>LATEST_BLOCK_BEFORE_EMERGENCE_OF_QC) {
# Treat transaction as invalid if it still uses SHA256
}
You know transactions are timestamped through the medium of being included in a block, right?
- Retric 6y agoYou don’t understand, this has nothing to do with SHA256 for mining after crypto. You need to sign a transaction with a private key. Quantum crypto makes all current private keys public. This means you need to pick some date where everyone with a private key needs to create a new key under a new system. Then before quantum crypto is available they need to make this transaction from their old wallet using an old key to a new wallet with a new secure private key. And they need to do this before quantum crypto is available.
- Erlich_Bachman 6y agoYes? That's exactly what they'll do.
- Retric 6y agoHow and when? People are working on quantum crypto right now and as far as anyone know someone could literally break Bitcoin tomorrow February 24th 2020. It seems unlikely, but the same could be said for every day until it happens.
- athriren 6y agohopefully tomorrow is in 2021, regardless of time zone or day and month.
- Retric 6y agoCommon misconception, real programmers use zero indexed years. None of this 1BC/BCE to 1AD propaganda people keep sprouting. ;-)
- dvh 6y agoCurrent record for quantum factorisation using Shor is 21, done by IBM in 2019.
- Retric 6y agoCurrent public record, NSA etc don’t publish their research.