Merge pull request #24 from robinbryce/robin/issue-20/uint-for-indice…

…s-and-sizes

issue #20 uint vs int for tree indices and sizes

draft-ietf-cose-merkle-tree-proofs.md

@@ -280,10 +280,10 @@ The CBOR representation of an inclusion proof for RFC9162_SHA256 is:
 inclusion-proof = bstr .cbor [
 
     ; tree size at current merkle root
-    tree-size: int
+    tree-size: uint
 
     ; index of leaf in tree
-    leaf-index: int
+    leaf-index: uint
 
     ; path from leaf to current merkle root
     inclusion-path: [ + bstr ]
@@ -402,10 +402,10 @@ The cbor representation of a consistency proof for RFC9162_SHA256 is:
 consistency-proof =  bstr .cbor [
 
     ; previous merkle root tree size
-    tree-size-1: int
+    tree-size-1: uint
 
     ; latest merkle root tree size
-    tree-size-2: int
+    tree-size-2: uint
 
     ; path from previous merkle root to latest merkle root.
     consistency-path: [ + bstr ]