Open sragss opened 2 months ago
Spice describes this in Figure 2. The goal is to avoid reordering attacks. We need to guarantee that the prover's insertions happen in the correct order.
Current implementation: Proveread timestamps <= global_timestamp for all insertions in 2^n.
read timestamps <= global_timestamp
2^n
0 <= every read timestamp <= 2^n
0 <= global_timestamp - read_timestamp <= 2^n
Spice describes this in Figure 2. The goal is to avoid reordering attacks. We need to guarantee that the prover's insertions happen in the correct order.
Current implementation: Prove
read timestamps <= global_timestampfor all insertions in2^n.0 <= every read timestamp <= 2^n0 <= global_timestamp - read_timestamp <= 2^n