In the end, you will run into the same issue of knapsacking. Can you show the runtime complexity for cracking that mixing?
Knapsacking can't be used to deanonymize transactions, coz there is no blockchain in Qubic. Transaction graph can't be analyzed.
There is no transaction graph in Qubic?
Only part of the network knows that A and B r linked. If u send money a lot of times then none of the peers have the
complete graph.
Okay, I see. An incomplete transaction graph can be analyzed as well, though. So, my weights don't become as big as if I had the complete graph, but they are unequal zero.
Btw. how is the data transfer between the nodes regulated? If it's a push system, when a new node comes in, which nodes will send it the necessary data? If it's a pull system, when a new node comes in, from which nodes will it be allowed to gather the necessary data, if not from all? In the latter case, a new node could easily collect the complete graph.
