From b48abb1624b14a42ee2a23c2a0402c9d82948169 Mon Sep 17 00:00:00 2001
From: Shadow <146137079+0xShadowX@users.noreply.github.com>
Date: Fri, 25 Sep 2026 16:01:55 +0400
Subject: [PATCH] bip98: fix the third SKIP hash in the example proof

The example says the skipped hashes are 0x00..., 0x66... and 0x22...,
and traversal-example.dot has 0x22... as the SKIP branch of D, but the
base64 proof ended with 32 bytes of 0x44, which is one of the VERIFY
hashes. Re-encode the proof with 0x22... as the last hash. The length
(101 bytes) and the tree serialization are unchanged.
---
 bip-0098.mediawiki | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/bip-0098.mediawiki b/bip-0098.mediawiki
index d63fd38d..a4a7ab1d 100644
--- a/bip-0098.mediawiki
+++ b/bip-0098.mediawiki
@@ -222,10 +222,10 @@ The remaining four (4) hashes are provided at runtime to be verified by the proo
 
 The serialization begins with the VarInt encoded number of inner nodes, <code>0x06</code>, followed by the tree serialization itself, <code>0xbd8440</code>.
 Next the number of SKIP hashes is VarInt encoded, <code>0x03</code>, followed by the three (3) hashes in sequence.
-The resulting 101 byte proof, encoded in base64:.
+The resulting 101 byte proof, encoded in base64:
 
     Br2EQAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGZmZmZmZmZmZmZmZmZmZmZmZmZm
-    ZmZmZmZmZmZmZmZmREREREREREREREREREREREREREREREREREREREREREQ=
+    ZmZmZmZmZmZmZmZmIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiI=
 
 ===Rationale===