-
Notifications
You must be signed in to change notification settings - Fork 25
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
survivable-eclipse-durations: draft report #422
base: main
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Merely reifying the TODOs.
|
||
Let GR_W be a random variable that counts the minimum possible growth of the honest chain within some fixed interval of W slots (ie the growth assuming every message was delayed by the full Delta). | ||
Note that 0 <= GR_W - GR_{W-1} <= 1 and 0 <= GR_{W+1} - GR_W <= 1. | ||
(TODO This seems right to me, but probably deserves a proof sketch.) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
TODO
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Note to self: Alexander Russell sketched this in a private Slack message. https://input-output-rnd.slack.com/archives/C02EF6ET4DC/p1697038571622419?thread_ts=1696962923.870129&cid=C02EF6ET4DC
Note that 0 <= GR_W - GR_{W-1} <= 1 and 0 <= GR_{W+1} - GR_W <= 1. | ||
(TODO This seems right to me, but probably deserves a proof sketch.) | ||
Also, note that the expected value of GR_W is mu(W) = W/( Delta + 1/phi_f(0.66) ), according to "the growth constant". | ||
(TODO citation for this?) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
TODO
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Note to self: I anticipate that it's from https://iohk.io/en/research/library/papers/practical-settlement-bounds-for-longest-chain-consensus/
eb2a527
to
10a1d78
Compare
eec9d25
to
eb736f4
Compare
365f972
to
138db20
Compare
This model (and the script that implements it) addresses the question of how long an eclipse can last before its victim has an appreciable chance of not being able to rejoin the honest network when the eclipse ends.
138db20
to
31bbe9f
Compare
Part of #427 |
Single commit PR, see the message.