Hello all,i think i have something that i am struggling to understand.I read your paper and you said in order to resolve the forks that occurs when multiple DS nodes solve the puzzle together, your algorithm sorts them in a increasing order. I am not get convinced that all the nodes agree on the same order due to network latency.This will lead for some messages to be lost or delayed.Thus, some nodes may follow wrong leader.What about that??How you preserve the consistency on this matter?Are there any synchronization mechanism? you are not so clear in the paper.
i would be grateful at a reply at your earliest convenience