police
ff8d4ddb12
[research/lotterysim] git rm log files
|
пре 3 година | |
|---|---|---|
| .. | ||
| .ipynb_checkpoints | пре 3 година | |
| blockchain_scripts | пре 3 година | |
| core | пре 3 година | |
| img | пре 3 година | |
| pid | пре 3 година | |
| reports | пре 3 година | |
| search_space | пре 3 година | |
| README.md | пре 3 година | |
| __init__.py | пре 3 година | |
| acc_vs_staked_ratio.py | пре 3 година | |
| discrete_instance.py | пре 3 година | |
| draw.py | пре 3 година | |
| playground.ipynb | пре 3 година | |
| primary_discrete_auto_crawler.py | пре 3 година | |
| secondary_discrete_auto_crawler.py | пре 3 година | |
| secondary_takahashi_auto_crawler.py | пре 3 година | |
| takahashi_instance.py | пре 3 година | |
README.md
title: darkfi lottery simulation author: ertosns
date: 11/1/2023
simulate darkfi consensus lottery with a discrete controller
discrete pid controller.
control lottery f tunning paramter
$$f[k] = f[k-1] + K_1e[k] + K_2e[k-1] + K_3e[k-2]$$
with $k_1 = k_p + K_i + K_d$, $k_2 = -K_p -2K_d$, $k_3 = K_d$, and e is the error function.
simulation criterion
find $K_p$, $k_i$, $K_d$ for highest accuracy running the simulation on N trials, of random number of nodes, starting with random airdrop (that all sum to total network stake), running for random runing time.
notice that best parameters are spread out in the search space, picking the highest of which, and running the simulation, running for 600 slots, result in with >36% accuracy
comparing range of target values between
notice below that both y,T in the pallas field, and simulation have same range.
conclusion
using discrete controller the lottery accuracy > 33% with randomized number of nodes, and randomized relative stake. can be coupled with khonsu^1 to achieve 100% accuracy and instant finality.