pith. sign in

Suppose then max number of byzantine nodes are ๐‘ = ๐‘› โˆ’ ๐‘˜

The initial state of ๐‘› at time ๐‘‡ = 0, there exists at least a certain threshold of honest nodes ๐‘˜, with overwhelming probability

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DC 1

years

2023 1

verdicts

UNVERDICTED 1

representative citing papers

Vault: Decentralized Storage Made Durable

cs.DC ยท 2023-10-12 ยท unverdicted ยท novelty 5.0

Vault uses node-centric incentives and sampling with verifiable randomness for scalable Byzantine-tolerant data placement in decentralized storage networks.

citing papers explorer

Showing 1 of 1 citing paper.

  • Vault: Decentralized Storage Made Durable cs.DC ยท 2023-10-12 ยท unverdicted ยท none ยท ref 68

    Vault uses node-centric incentives and sampling with verifiable randomness for scalable Byzantine-tolerant data placement in decentralized storage networks.