From eefaaf5ac3b68e9f733bfb22212ac86b329e8bc4 Mon Sep 17 00:00:00 2001
From: Chris Leishman <chris@leishman.org>
Date: Fri, 7 Dec 2018 16:39:52 -0800
Subject: [PATCH] Clarify TreeHash treatment of integers > 256bit

Also clarify treatment of hashes < 32bytes
---
 specs/simple-serialize.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/specs/simple-serialize.md b/specs/simple-serialize.md
index 2bd781d4e..4af75ed63 100644
--- a/specs/simple-serialize.md
+++ b/specs/simple-serialize.md
@@ -394,11 +394,11 @@ The below `SSZTreeHash` algorithm is defined recursively in the case of lists an
 
 We define `hash(x)` as `BLAKE2b-512(x)[0:32]`.
 
-#### `uintN`, `bool`, `address`, `hash32`
+#### `uint8`..`uint256`, `bool`, `address`, `hash1`..`hash32`
 
 Return the serialization of the value.
 
-#### `bytes`, `hashN`
+#### `uint264`..`uintN`, `bytes`, `hash33`..`hashN`
 
 Return the hash of the serialization of the value.