How do you know they won't be double-spent later. Duh. That is the entire point of building a long chain of cumulative PoW so the confirmation is probabilistically more assured. I already wrote this in the prior post.
A to Z are transactions. A is the double spend, there are two competing chains. Here is some sequencing using a deterministic, recursive, longest chain of POW ordering:
Time period X:Chain 1: A<-B<-C
Chain 2: D<-A<-E<-F<-G
Order of transaction application:
D,A (chain
2), A (chain
1, invalid so not applied), E, B, F, C, G
Time period Y:Chain 1: A<-B<-C<-X-<-Y<-Z<-W
Chain 2: D<-A<-E<-F<-G
Order of transaction application:
D,A (chain 1), A (chain 2, invalid not applied), B, E, C, F, X, G, Y, Z, W
Notice how the only transaction which cannot be applied is A in the weaker chain, in both instances? None of the other transactions get invalidated and neither chain is orphaned at any time.
Notice additionally, that the change in chain priority does not affect the relative sequencing of B,C,E,F?Notice additionally, that the change in chain priority does not affect the temporal sequencing of either chain individually?
All trustless cryptocurrency attempts to achieve is to provide a
global ordering for transactions. That's it.
(disclaimer, this is not a description of how Iota works, but a generalisation in DAG/tree transaction ordering)