logos-co/nomos-specs
1
0
Fork 0
mirror of https://github.com/logos-co/nomos-specs.git synced 2025-01-22 05:19:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

Removed slow versions

Browse Source
This commit is contained in:
danielsanchezq 2024-06-28 17:59:07 +02:00
parent 60a5dbfe26
commit c35b18d395
2 changed files with 4 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
da/subnetwork_assignment.py
View File

@ -13,7 +13,7 @@ def _lazy_recursive_hash(_id: Id, hasher=lambda x: blake2b(x).digest()) -> Gener
yield _id
def generate_distribution_set(_id: Id, set_size: int, modulus=4096, hasher=lambda x: blake2b(x).digest()) -> Set[int]:
def generate_distribution_set_with_recursive_hash(_id: Id, set_size: int, modulus=4096, hasher=lambda x: blake2b(x).digest()) -> Set[int]:
result_set = set()
ids = _lazy_recursive_hash(_id)
while len(result_set) < set_size:
@ -21,11 +21,6 @@ def generate_distribution_set(_id: Id, set_size: int, modulus=4096, hasher=lambd
return result_set
def generate_distribution_set_v3(_id: Id, set_size: int, replication_factor: int, modulus=4096) -> Set[int]:
halton = Halton(set_size*replication_factor, seed=int.from_bytes(_id))
return set(chain.from_iterable(halton.integers(l_bounds=0, u_bounds=modulus, n=set_size*replication_factor)))
def calculate_minimum_membership(network_size: int, number_of_nodes: int, replication_factor: int) -> int:
return ceil(network_size / number_of_nodes) * replication_factor

27
da/test_subnetwork_assignment.py
View File

@ -2,8 +2,7 @@ from math import ceil, floor
from typing import List
from unittest import TestCase
from .subnetwork_assignment import (
generate_distribution_set,
generate_distribution_set_v3,
generate_distribution_set_with_recursive_hash,
calculate_minimum_membership
)
from hashlib import blake2b, sha512
@ -13,7 +12,7 @@ from itertools import chain
SUBNETWORK_SIZE: int = 4096
NODES_OVER_NETWORK_SIZE: List[float] = [0.1, 0.25, 0.5, 0.75, 1.0, 2.0, 10.0]
HASHERS = [lambda x: sha512(x).digest()]
HASHERS = [lambda x: sha512(x).digest(), lambda x: blake2b(x).digest()]
class TestSubnetworkAssignment(TestCase):
@ -26,7 +25,7 @@ class TestSubnetworkAssignment(TestCase):
minimum_membership = calculate_minimum_membership(SUBNETWORK_SIZE, total_nodes, replication_factor)
subsets = set(
chain.from_iterable(
generate_distribution_set(
generate_distribution_set_with_recursive_hash(
blake2b(_id.bytes).digest(),
minimum_membership,
SUBNETWORK_SIZE,
@ -37,23 +36,3 @@ class TestSubnetworkAssignment(TestCase):
)
print(f"Total nodes: {total_nodes}")
self.assertGreater(len(subsets), floor(SUBNETWORK_SIZE*0.99))
def test_no_subnetwork_v3_empty(self):
for nodes_factor in reversed(NODES_OVER_NETWORK_SIZE):
total_nodes = int(SUBNETWORK_SIZE * nodes_factor)
nodes = [uuid4() for _ in range(total_nodes)]
replication_factor = ceil(3/nodes_factor)
minimum_membership = calculate_minimum_membership(SUBNETWORK_SIZE, total_nodes, 1)
subsets = set(
chain.from_iterable(
generate_distribution_set_v3(
blake2b(_id.bytes).digest(),
minimum_membership,
replication_factor,
SUBNETWORK_SIZE
)
for _id in nodes
)
)
print(f"Total nodes: {total_nodes}")
self.assertGreater(len(subsets), floor(SUBNETWORK_SIZE*0.99))