@@ -52,2 +59,4 @@
 - `X xor Y`: denotes the bit-wise XOR of `X` and `Y` (same width).
+- `X | Y`: denotes the bit-wise OR of `X` and `Y` (same width).
+- `~X`: denotes the bit-wise negation of `X`.
 

@@ -327,0 +401,4 @@
+
+To make sure that all input bits have a chance to impact any bit in the output digest (avalanche effect), the final step of the XXH3 algorithm is usually one of the two fixed operations that mix the bits in a 64-bit value. These operation are denoted `avalanche()` and `avalanche_XXH64()` in the following XXH3 description.
+
+```c

@@ -327,0 +622,4 @@
+#### 129-240 bytes of input
+
+The input is split into 16-byte (XXH3-64) or 32-byte (XXH3-128) chunks. The first 128 bytes are first mixed chunk by chunk, followed by an intermediate avalanche operation. Then the remaining full chunks are processed, and finally the last 16/32 bytes are treated as a chunk to process.
+

@@ -327,0 +730,4 @@
+    acc[i] = acc[i] xor secretWords[i];
+    acc[i] = acc[i] * PRIME32_1;
+  }
+```

@@ -327,0 +622,4 @@
+#### 129-240 bytes of input
+
+The input is split into 16-byte (XXH3-64) or 32-byte (XXH3-128) chunks. The first 128 bytes are first mixed chunk by chunk, followed by an intermediate avalanche operation. Then the remaining full chunks are processed, and finally the last 16/32 bytes are treated as a chunk to process.
+