Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Nesterenko, Mikhail"'
We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnected throughout the computation. We determine the necessary and suffici
Externí odkaz:
http://arxiv.org/abs/2406.04497
We present TRAIL: an algorithm that uses a novel consensus procedure to tolerate failed or malicious shards within a blockchain-based cryptocurrency. Our algorithm takes a new approach of selecting validator shards for each transaction from those tha
Externí odkaz:
http://arxiv.org/abs/2405.07146
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication graph is a planar embedding that rem
Externí odkaz:
http://arxiv.org/abs/2403.12256
We present a solution to consensus on a torus with Byzantine faults. Any solution to classic consensus that is tolerant to $f$ Byzantine faults requires $2f+1$ node-disjoint paths. Due to limited torus connectivity, this bound necessitates spatial se
Externí odkaz:
http://arxiv.org/abs/2303.12870
We consider blockchain in dynamic networks. We define the Blockchain Decision Problem. It requires miners that maintain the blockchain to confirm whether a particular block is accepted. We establish the necessary conditions for the existence of a sol
Externí odkaz:
http://arxiv.org/abs/2208.03355
We present QUANTAS: a simulator that enables quantitative performance analysis of distributed algorithms. It has a number of attractive features. QUANTAS is an abstract simulator, therefore, the obtained results are not affected by the specifics of a
Externí odkaz:
http://arxiv.org/abs/2205.04930
Autor:
Nesterenko, Mikhail V.1 mikhail.v.nesterenko@gmail.com, Katrich, Victor A.1, Pshenichnaya, Svetlana V.1
Publikováno v:
East European Journal of Physics. 2024, Issue 2, p450-455. 6p.
We consider operation of blockchain-based cryptocurrency in case of partitioning. We define the Partitionable Blockchain Consensus Problem. The problem may have an interesting solution if the partitions proceed independently by splitting accounts. We
Externí odkaz:
http://arxiv.org/abs/2012.10413
We define and investigate the consensus problem for a set of $N$ processes embedded on the $d$-dimensional plane, $d\geq 2$, which we call the {\em geoconsensus} problem. The processes have unique coordinates and can communicate with each other throu
Externí odkaz:
http://arxiv.org/abs/2010.02436