Search Results

Documents authored by Jovanovic, Philipp


Document
Not All Reads Are Conflicts: A Write-Only Analysis of the Sui Blockchain

Authors: Haygen Tsoi, Alberto Sonnino, and Philipp Jovanovic

Published in: LIPIcs, Volume 395, 8th Conference on Advances in Financial Technologies (AFT 2026)


Abstract
Sui’s object-centric data model enables parallel transaction execution, but realised performance is fundamentally bounded by workload contention. Prior empirical analyses of Sui have relied on "read+write" (R+W) conflict graphs inherited from account-based blockchains. Because Sui’s engine serialises only on mutable shared access, R+W graphs contain spurious edges, bounding contention from above. In this paper, we adopt a complementary "write-set-only" (W-only) model in which every edge represents a real write-serialisation event, providing a lower bound on contention. Together, the two models bracket Sui’s true execution-dependency structure. Applying the W-only analysis to Sui mainnet data through 2025 yields three primary findings. First, removing read-only dependencies (notably the system clock) causes previously reported "hub-and-spoke" structures to collapse. The remaining contention topology is highly assortative and clique-dominated, with the W-only bound shaving roughly 30-40% off the R+W estimate of Sui’s optimal-parallelism headroom. Second, via union-find object grouping, we isolate DeepBook (Sui’s native central limit order book). While it dominates contention by volume, its underlying logic does not impose disproportionate sequential bottlenecks. Finally, we quantify the economic cost of contention, showing that 10-50% of the network’s USD-denominated value flows through sequentially constrained execution paths, exposing it to potential ordering effects.

Cite as

Haygen Tsoi, Alberto Sonnino, and Philipp Jovanovic. Not All Reads Are Conflicts: A Write-Only Analysis of the Sui Blockchain. In 8th Conference on Advances in Financial Technologies (AFT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 395, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{tsoi_et_al:LIPIcs.AFT.2026.10,
  author =	{Tsoi, Haygen and Sonnino, Alberto and Jovanovic, Philipp},
  title =	{{Not All Reads Are Conflicts: A Write-Only Analysis of the Sui Blockchain}},
  booktitle =	{8th Conference on Advances in Financial Technologies (AFT 2026)},
  pages =	{10:1--10:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-451-2},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{395},
  editor =	{Kiayias, Aggelos and Kyropoulou, Maria},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2026.10},
  URN =		{urn:nbn:de:0030-drops-278641},
  doi =		{10.4230/LIPIcs.AFT.2026.10},
  annote =	{Keywords: Sui, blockchain, parallel execution, conflict graphs, transaction analysis}
}
Document
BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation

Authors: Alireza Kavousi, Duc V. Le, Philipp Jovanovic, and George Danezis

Published in: LIPIcs, Volume 361, 29th International Conference on Principles of Distributed Systems (OPODIS 2025)


Abstract
Maximal Extractable Value (MEV) is a crucial challenge in blockchains and cryptocurrencies. A principal countermeasure is using encrypted mempools to hide the transaction payloads until they are committed in a block. However, the existing approaches based on encrypted mempools remain vulnerable to metadata leakage and may not provide sufficient mitigation against block producers due to their sole control in block preparation. In this paper, we propose techniques that utilize randomized permutation on the committed block, offering a multi-layer solution. With a focus on proof-of-stake (PoS) committee-based consensus, we then introduce BlindPerm, a framework that enhances an encrypted mempool with permutation and present various optimizations. Notably, we propose a construction where this enhancement comes at essentially no overhead by piggybacking on the encrypted mempool and without relying on any external entity such as randomness beacon. Further, we illustrate the effectiveness of our solutions by running simulations using historical Ethereum data.

Cite as

Alireza Kavousi, Duc V. Le, Philipp Jovanovic, and George Danezis. BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 36:1-36:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)


Copy BibTex To Clipboard

@InProceedings{kavousi_et_al:LIPIcs.OPODIS.2025.36,
  author =	{Kavousi, Alireza and Le, Duc V. and Jovanovic, Philipp and Danezis, George},
  title =	{{BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation}},
  booktitle =	{29th International Conference on Principles of Distributed Systems (OPODIS 2025)},
  pages =	{36:1--36:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-409-3},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{361},
  editor =	{Arusoaie, Andrei and Onica, Emanuel and Spear, Michael and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2025.36},
  URN =		{urn:nbn:de:0030-drops-252091},
  doi =		{10.4230/LIPIcs.OPODIS.2025.36},
  annote =	{Keywords: Encrypted mempool, maximal extractable value, distributed systems}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail