aboutsummaryrefslogtreecommitdiff
path: root/proposals/340-packed-and-fragmented.md
diff options
context:
space:
mode:
Diffstat (limited to 'proposals/340-packed-and-fragmented.md')
-rw-r--r--proposals/340-packed-and-fragmented.md12
1 files changed, 7 insertions, 5 deletions
diff --git a/proposals/340-packed-and-fragmented.md b/proposals/340-packed-and-fragmented.md
index a718bdf..e7f08f4 100644
--- a/proposals/340-packed-and-fragmented.md
+++ b/proposals/340-packed-and-fragmented.md
@@ -2,7 +2,7 @@
Filename: 340-packed-and-fragmented.md
Title: Packed and fragmented relay messages
Author: Nick Mathewson
-Created: 18 May 2022
+Created: 31 May 2022
Status: Open
```
@@ -170,9 +170,9 @@ follows:
accommodates most reasonable MTU choices)
Any increase in maximum length for any other message type requires a new
-relay subprotocol version
-
-
+Relay subprotocol version. (For example, if we later want to allow
+EXTEND2 messages to be 2000 bytes long, we need to add a new proposal
+saying so, and reserving a new subprotocol version.)
# Appendix: Example cells
@@ -266,7 +266,9 @@ message in the same cell.
```
Here is an example with packing and fragmentation: a large DATAGRAM cell, a
-SENDME cell, and an XON cell.
+SENDME cell, and an XON cell. (Note that this sequence of cells would not
+actually be generated by the algorithm described in "Packing decisions"
+above; this is only an example of what parties need to accept.)
```
Cell 1: