There are many academic articles devoted to Bitcoin blockchain analysis. Their authors trace the flow of money, to identify the owners of coins, determine the balances of the wallet and so on.
The ability to perform this analysis is due to the fact that all transfers between addresses are transparent: each entry in a transaction refers to a single exit. Furthermore, users often re-use their old addresses multiple times, for receiving and sending coins, and this simplifies the analyst’s job.
It happens unintentionally: if you have a public address (for example, for donations), you are sure to use this address for many entries and transactions.
DinastyCoin it is designed to reduce the risks associated with tracking due to the reuse of the same keys and for an input-to-one-output.
Each payment address is a unique key derived from both recipient and sender data.
It can appear twice with a chance of a 256-bit hash collision.
As soon as you use a signature ring in your entry, it leads to uncertainty for the analyst:
what outing has just been spent?
Trying to plot a graph with the addresses of the vertices and the transactions at the edges, you will get a tree: a graph with no cycles (because no key / address has been used twice).
Furthermore, there are billions of possible graphs, since each ring signature produces ambiguity.
Thus, one cannot be sure where the possible sender of the operation comes from – at the edge and the address – at the vertex.
Depending on the size of the ring there can be “one to two” to “one to a thousand” guests. Each subsequent operation increases entropy and creates further obstacles for an analyst.