Expand description
P2P protocol implementation for the Event Graph
StructsΒ§
- Event
Put - A P2P message representing publishing an event on the network
- Event
Rep - A P2P message representing an event reply
- Event
Req - A P2P message representing an event request
- Moving
Window π - Protocol
Event Graph - P2P protocol implementation for the Event Graph.
- TipRep
- A P2P message representing a reply for the peerβs DAG tips
- TipReq
- A P2P message representing a request for a peerβs DAG tips
ConstantsΒ§
- MALICIOUS_
THRESHOLD π - Malicious behaviour threshold. If the threshold is reached, we will drop the peer from our P2P connection.
- RATELIMIT_
EXPIRY_ πTIME - Rolling length of the window
- RATELIMIT_
MIN_ πCOUNT - Ratelimit kicks in above this count
- RATELIMIT_
SAMPLE_ πIDX - Sample point used to calculate sleep time when ratelimit is active
- RATELIMIT_
SAMPLE_ πSLEEP - Sleep for this amount of time when
count == RATE_LIMIT_SAMPLE_IDX. - WINDOW_
EXPIRY_ πTIME - Rolling length of the window
- WINDOW_
MAXSIZE π - Global limit of messages per window