danielsanchezq 597d8b3546 Fill leaves with extra nodes one by one

2023-06-28 09:53:03 +02:00

..

__init__.py

Random beacon v1 (#24)

2023-05-18 18:29:28 +02:00

beacon.py

Random Beacon revision (#29)

2023-05-25 10:26:35 +02:00

beaconized_carnot.py

EntropyOverlay refactor (#30)

2023-05-30 21:15:56 +02:00

carnot.py

Random beacon v1 (#24)

2023-05-18 18:29:28 +02:00

overlay.py

EntropyOverlay refactor (#30)

2023-05-30 21:15:56 +02:00

spec.md

Runnable Python implementation (#7)

2023-05-05 09:58:58 +02:00

test_beacon_verification.py

Random Beacon revision (#29)

2023-05-25 10:26:35 +02:00

test_beaconized_carnot.py

EntropyOverlay refactor (#30)

2023-05-30 21:15:56 +02:00

test_happy_path.py

Runnable Python implementation (#7)

2023-05-05 09:58:58 +02:00

test_tree_overlay.py

Add basic tests

2023-06-27 09:39:02 +02:00

test_unhappy_path.py

test: make the committed_blocks test more strict (#31)

2023-06-07 17:04:30 +09:00

tree_overlay.py

Fill leaves with extra nodes one by one

2023-06-28 09:53:03 +02:00