codex-storage
/
das-research
mirror of https://github.com/codex-storage/das-research.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
This repository hosts all the research on DAS for the collaboration between Codex and the EF.
59 Commits 79 Branches 0 Tags 2.6 MiB
Python 100%
Go to file
Csaba Kiraly 763ebfe136
set up complete graph if n<=d 
If the number of nodes in a channel is smaller or equal than the
requested degree, a fully connected graph is used. For n>d, a random
d-regular graph is set up. (For n=d+1, the two are the same.)

Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
 		2023-02-23 09:06:57 +01:00
DAS set up complete graph if n<=d 2023-02-23 09:06:57 +01:00
doc Starting code documentation 2023-02-08 22:45:01 +01:00
.gitignore Update gitignore 2023-02-08 22:46:12 +01:00
README.md Add configuration file, split configuration from simulation shape, fix bug about network degree and unbalanced row/column verification 2023-01-23 18:04:54 +01:00
config.ini Removing static variables 2023-02-08 20:10:26 +01:00
study.py Merging changes from 'develop' branch into 'results' branch 2023-02-08 15:01:50 +01:00

README.md

DAS Research

This repository hosts all the research on DAS for the collaboration between Codex and the EF.

Prepare the environment

  • Clone the DAS repository (if not done yet) and go into the das-research directory
$ git clone https://github.com/status-im/das-research.git
$ cd das-research
  • Create a virtual environment and install the requirements
$ python3 -m venv myenv
$ source myenv/bin/activate
$ pip3 install -r DAS/requirements.txt

Run the simulator

$ python3 study.py config.das