Script updating archive at 2025-10-23T01:59:00Z. [ci skip]

Author: ID Bot

archive.json

@@ -1,6 +1,6 @@
 {
   "magic": "E!vIA5L86J2I",
-  "timestamp": "2025-10-19T02:10:15.407888+00:00",
+  "timestamp": "2025-10-23T01:58:58.737387+00:00",
   "repo": "davidben/merkle-tree-certs",
   "labels": [
     {
@@ -2595,6 +2595,22 @@
       "updatedAt": "2025-10-15T16:13:39Z",
       "closedAt": null,
       "comments": []
+    },
+    {
+      "number": 153,
+      "id": "I_kwDOJIBkVc7S6XKc",
+      "title": "Inclusion and consistency proof test vectors",
+      "url": "https://github.com/davidben/merkle-tree-certs/issues/153",
+      "state": "OPEN",
+      "author": "davidben",
+      "authorAssociation": "OWNER",
+      "assignees": [],
+      "labels": [],
+      "body": "I think the best strategy to test an implementation is actually to just exhaustively test all subtrees in all trees up to size, say, 128, but we should also have some representative test vectors.\n\nIn addition to finding funny cases along the right edge, we should include a test vector where the tree size is 2^64 - 1. I think we can construct this input by just pretending every leaf in the tree is identical, then we can compute the hash at every layer.",
+      "createdAt": "2025-10-21T23:31:08Z",
+      "updatedAt": "2025-10-21T23:31:08Z",
+      "closedAt": null,
+      "comments": []
     }
   ],
   "pulls": [