WHAT DO WE KNOW ABOUT THE TOPOLOGY? WHAT DO WE KNOW ABOUT THE - PowerPoint PPT Presentation

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A ∅ ∅ ∅ (1) (1) t x txF P B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) txF txP ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C (2) P x t A’s Mempool C’s Mempool B’s Mempool B A (1) (1) txF txP ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) txF txP ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (3) B’s MapOrphanTransactions t x M US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (3) txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C (4) M x t A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (3) txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (3) txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (4) (3) txM txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C (5) txM A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (4) (3) txM txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (4) (3) txM txM B’s MapOrphanTransactions US Coinscope ∅

ITS NOT THAT EASY Long story short, the technique will fail if we add an additional node to the picture C A’s Mempool C’s Mempool B’s Mempool B A (1) (1) (2) txP txF txP ∅ ∅ ∅ (4) (3) txM txM B’s MapOrphanTransactions US Coinscope (5) txM ∅

MAKE THIS WORK IN A REAL NETWORK Isolation Synchrony E ffi ciency ≈ O ( n ) txP A A ≈ O ( n ) txP n = # nodes B txF

MAKE THIS WORK IN A REAL NETWORK E ffi ciency Synchrony Isolation ≈ O ( n ) txP A A ≈ O ( n ) txP n = # nodes B txF

ISOLATION C (2) P x t B A US Coinscope

ISOLATION C (2) P x t B A US Coinscope

ISOLATION C (2) P x t B A C B A US Coinscope

ISOLATION C (2) P x t B A INV C B A US Coinscope

ISOLATION C (2) P x t B A INV GETDATA C B A US Coinscope

ISOLATION C (2) P x t B A INV GETDATA C B A TX US Coinscope

ISOLATION C (2) P x t B A INV GETDATA C B A TX US Coinscope

ISOLATION C (2) P x t B A INV GETDATA C B A TX US Coinscope

ISOLATION HOW? C (2) P x t B A INV GETDATA C B A TX US Coinscope

ISOLATION HOW? INVBLOCKING C (2) P x t B A INV GETDATA C B A TX US Coinscope

INVBLOCKING C B A US Coinscope

INVBLOCKING C B A US Coinscope

INVBLOCKING C B A INV(txP) INV(txP) INV(txP) US Coinscope

INVBLOCKING C B A US Coinscope

INVBLOCKING txP C B A txP txP US Coinscope

INVBLOCKING txP C GETDATA (txP) B A txP txP GETDATA GETDATA (txP) (txP) US Coinscope

INVBLOCKING txP C B A txP txP US Coinscope

INVBLOCKING txP C We have a 2-min window where isolation and synchrony are B A txP txP not a problem! US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C A’s Mempool B’s Mempool ∅ B A ∅ txP txP B’s Orphanpool ∅ US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C A’s Mempool B’s Mempool ∅ B A ∅ txP txP B’s Orphanpool ∅ txP US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C A’s Mempool B’s Mempool ∅ B A ∅ txP txP B’s Orphanpool ∅ US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C A’s Mempool B’s Mempool ∅ txP B A ∅ txP txP txP B’s Orphanpool ∅ US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C INV(txP ) A’s Mempool B’s Mempool ∅ txP B A ∅ txP txP txP B’s Orphanpool ∅ US Coinscope

C’s Mempool C’s Orphanpool SIMPLIFIED TXPROBE ∅ txP ∅ C A’s Mempool B’s Mempool ∅ txP B A ∅ txP txP txP B’s Orphanpool ∅ US Coinscope