𝑃 (𝑏 > 𝑛 − 𝑘) = 1 − 𝑛−𝑘∑︁ 𝑖=0 𝑁 3 𝑖 2𝑁 3 𝑛−𝑖 𝑁 𝑛 (3) ≤ 𝑒 −2 ( 2𝑛 3 −𝑘 )2 𝑛 (4) ≤ 𝜀 (5) However, Although the initial state might be valid, we cannot say future states will be

Utilizing Hoeffding’s Inequality [29] to draw a bound

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

1 Pith paper citing it

browse 1 citing papers

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 after filters.

Vault: Decentralized Storage Made Durable cs.DC · 2023-10-12 · unverdicted · none · ref 71
Vault uses node-centric incentives and sampling with verifiable randomness for scalable Byzantine-tolerant data placement in decentralized storage networks.

𝑃 (𝑏 > 𝑛 − 𝑘) = 1 − 𝑛−𝑘∑︁ 𝑖=0 𝑁 3 𝑖 2𝑁 3 𝑛−𝑖 𝑁 𝑛 (3) ≤ 𝑒 −2 ( 2𝑛 3 −𝑘 )2 𝑛 (4) ≤ 𝜀 (5) However, Although the initial state might be valid, we cannot say future states will be

fields

years

verdicts

representative citing papers

citing papers explorer