I see from the paper that the complexity of FPC is
nlog(n)^2, although it has come up in multiple conversations how FPC can handle a spamming of double spends?
Obviously with enough computational power its possible, but I am curious about what the complexity is, or simply any idea on how FPC can handle a DDOS attack.
If anybody knows anything on the subject it is much appreciated. We could also simply emperically test this on the dev net right now if anybody had the computational resources...