In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.
The whole point was for it to not be possible. And this is still the case for Bitcoin Cash.
And lmfao what you described is something that is possible on EVERY blockchain.
It’s called double spending, or replacing transactions.
Any transaction that is not CONFIRMED, can be replaced, on any blockchain.
This has nothing to do with some “change” the M4RX1575 have made.
Idiocy at it’s finest.
Lol you are too dumb...
From the Bitcoin white paper:
The whole point was for it to not be possible. And this is still the case for Bitcoin Cash.