@@ -25,7 +25,7 @@ undergo a series of stages.
25
25
26
26
If the TCP listener accepts a new inbound connection it creates a handshake task which
27
27
attempts to perform a Noise handshake which involves a Diffie-Hellman key exchange and
28
- -- if successfull -- results in an authenticated and secure link with an identified
28
+ -- if successful -- results in an authenticated and secure link with an identified
29
29
peer.
30
30
31
31
### Connect task
@@ -53,7 +53,7 @@ peer a node drops the one whose associated public key is smaller than its own.
53
53
54
54
### I/O tasks
55
55
56
- After successful connection establishment, two tasks are created, one to continously
56
+ After successful connection establishment, two tasks are created, one to continuously
57
57
read incoming data and one to send application data. The data is split and encrypted
58
58
into frames of 64 KiB (the maximum size of a Noise package) or less. Failure of either
59
59
task results in the termination of both and a new connect task is created to
@@ -77,7 +77,7 @@ channel to the respective write task. The capacity of every channel is bounded.
77
77
If the one the application uses is full, backpressure is exercised, i.e. the
78
78
application has to wait. This can happen for example, if no connection is available
79
79
for some time. The channel to an I/O write task is also bounded, but if full, the
80
- connection is considered slow and unhealty and will be dropped, resulting in a new
80
+ connection is considered slow and unhealthy and will be dropped, resulting in a new
81
81
connect task to re-establish the connection.
82
82
83
83
## Data frame
0 commit comments