Expand description
P2P protocol implementation for the Event Graph
Structs§
- A P2P message representing publishing an event on the network
- A P2P message representing an event reply
- A P2P message representing an event request
- Moving
Window π - P2P protocol implementation for the Event Graph.
- A P2P message representing a reply for the peerβs DAG tips
- 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. - 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 - 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