ASURA implementation in Rust. A better alternative of consistent-hashing.

Akira Hayakawa

Last update: May 30, 2022

Related tags

Cryptography ASURA

Overview

ASURA (阿修羅)

ASURA implementation in Rust. A better alternative of consistent-hashing.

What is ASURA?

ASURA, like best-known consistent-hashing, is an algorithm to compute the placement node from a key. ASURA is a abbreviation of Advanced Scalable and Uniform storage by Random number Algorithm.

The basic: ASURA is a class of Monte Carlo method because it uses random number to choose the placement node. Nodes are mapped to segments (non-overlapping but allowing gaps) and it generates random numbers until hit one.

The core of the ASURA is ASURA random number generator. Because of the property, we can add or remove a node without changing most of the previous placements just like consistent-hashing.

For more detail, you can read the paper here: https://arxiv.org/ftp/arxiv/papers/1309/1309.7720.pdf.

Author

Akira Hayakawa ([email protected])

IBC modules and relayer - Formal specifications and Rust implementation

ibc-rs Rust implementation of the Inter-Blockchain Communication (IBC) protocol. This project comprises primarily four crates: The ibc crate defines t

296 Dec 31, 2022

A Rust implementation of BIP-0039

bip39-rs A Rust implementation of BIP0039 Changes See the changelog file, or the Github releases for specific tags. Documentation Add bip39 to your Ca

49 Dec 9, 2022

Official Rust implementation of the Nimiq protocol

Nimiq Core implementation in Rust (core-rs) Rust implementation of the Nimiq Blockchain Core Nimiq is a frictionless payment protocol for the web. Thi

72 Sep 23, 2022

Rust implementation of Zcash protocol

The Parity Zcash client. Gitter Blog: Parity teams up with Zcash Foundation for Parity Zcash client Installing from source Installing the snap Running

183 Sep 8, 2022

A (mostly) pure-Rust implementation of various cryptographic algorithms.

Rust-Crypto A (mostly) pure-Rust implementation of various common cryptographic algorithms. Rust-Crypto seeks to create practical, auditable, pure-Rus

1.2k Dec 27, 2022

A pure-Rust implementation of group operations on Ristretto and Curve25519

curve25519-dalek A pure-Rust implementation of group operations on Ristretto and Curve25519. curve25519-dalek is a library providing group operations

611 Dec 25, 2022

[INACTIVE] TLS 1.2 implementation in Rust

suruga is Rust implementation of TLS 1.2. It currently implements some core parts of TLS 1.2, NIST P-256 ECDHE and chacha20-poly1305. Usage extern cra

123 Dec 27, 2022

A prototype implementation of the Host Identity Protocol v2 for bare-metal systems, written in pure-rust.

Host Identity Protocol for bare-metal systems, using Rust I've been evaluating TLS replacements in constrained environments for a while now. Embedded

31 Dec 12, 2022

An implementation of the FP-Growth algorithm in pure Rust.

fp-growth-rs An implementation of the FP-Growth algorithm in pure Rust, which is inspired by enaeseth/python-fp-growth. Usage Add this to your Cargo.t

13 Dec 20, 2022

Comments

bench: search multiple candidates
Let

n: number of nodes

k: choose k nodes

and assume each node has the same cap.

The number of searching segment table will be

sum (n/(n-i)) for i = [0,k)

for example, if n=10 and k=3 it will be 1+10/9+10/8 ~ 3

Write benchmark to check if the actual execution time can be explained by the math.
opened by akiradeveloper 1
Implement serializer/deserializer

The minimum information to reconstruct the Cluster is h: HashMap<u64, Segment>.

Implement Cluster::serialize(Cluster, serializer) -> Vec<u8> and Cluster::deserialize(&[u8], deserializer) -> Cluster. The requirement for the serializer is only capability to serialize the HashMap to Vec<u8>.

opened by akiradeveloper 0
Add distribution comparison
Add a program to compare the distribution between ASURA, consistent_hash and rendezvous_hash.

The condition:

n nodes. all nodes has the equal capacity.

consistent_hash varies the # of virtual nodes.

place k keys and see how they distribute (compared by variance)
opened by akiradeveloper 0