4 papers
Short Graph Sketches Suffice for Error-resilient Leader Verification in CONGEST
Pawel Garncarek, Tomasz JurdziÅski, Dariusz Kowalski +1
Locally Checkable Proofs (LCPs) enable the verification of global graph properties using locally checkable certificates assigned by a prover. Recently, this framework was extended…
Distributed Local Verification using Proofs with(out) Errors
PaweÅ Garncarek, Tomasz Jurdzinski, Dariusz Kowalski +1
We study local verification of graph properties in distributed networks under the framework of \emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to n…
Near-Optimal Stability for Distributed Transaction Processing in Blockchain Sharding
Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski
In blockchain sharding, processing nodes are divided into shards, and each shard processes transactions in parallel. A key challenge in such a system is to ensure system st…
Stable Blockchain Sharding under Adversarial Transaction Generation
Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski
Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generate…