diff --git a/go/performance/serialbench/serial_test.go b/go/performance/serialbench/serial_test.go
index 4f5b718114..90146e638d 100644
--- a/go/performance/serialbench/serial_test.go
+++ b/go/performance/serialbench/serial_test.go
@@ -48,11 +48,6 @@ const (
 	SmallKeyOffsetsSz   = 18
 	SmallValueOffsetsSz = 18
 
-	// data        3200 = 800 + 3200
-	// offsets     796  = sizeof(uint16) * (199 + 199)
-	// metadata    11   = TupleFormat * 2, tree_count, tree_level
-	// flatbuffers 65   = (1.6% overhead)
-	// total size  4072
 	LargeLeafNodeSz     = 4080
 	LargeLeafNodeCount  = 200
 	LargeKeyTuplesSz    = 800
diff --git a/go/store/prolly/tree_chunker.go b/go/store/prolly/tree_chunker.go
index f9a4f4c643..0e16749bbe 100644
--- a/go/store/prolly/tree_chunker.go
+++ b/go/store/prolly/tree_chunker.go
@@ -90,6 +90,10 @@ func (tc *treeChunker) resume(ctx context.Context) (err error) {
 			tc.cur.currentSubtreeSz())
 
 		// todo(andy): seek to correct chunk
+		//  currently when inserting tuples between chunks
+		//  we seek to the end of the previous chunk rather
+		//  than the beginning of the next chunk. This causes
+		//  us to iterate over the entire previous chunk
 		//assertFalse(ok)
 
 		if err != nil {