diff --git a/packages/ssz/test/spec/runValidTest.ts b/packages/ssz/test/spec/runValidTest.ts
index 5ea219eb..2385d191 100644
--- a/packages/ssz/test/spec/runValidTest.ts
+++ b/packages/ssz/test/spec/runValidTest.ts
@@ -103,8 +103,8 @@ export function runValidSszTest(type: Type<unknown>, testData: ValidTestCaseData
     if (type.isBasic) {
       console.log("Chunk Bytes Basic", toHexString(type.serialize(testDataValue)));
     } else {
-      const chunkBytes = (type as CompositeType<unknown, unknown, unknown>)["getChunkBytes"](testDataValue);
-      console.log("Chunk Bytes Composite", toHexString(chunkBytes));
+      const blocksBytes = (type as CompositeType<unknown, unknown, unknown>)["getBlocksBytes"](testDataValue);
+      console.log("Blocks Bytes Composite", toHexString(blocksBytes));
     }
   }
 
diff --git a/packages/ssz/test/unit/merkleize.test.ts b/packages/ssz/test/unit/merkleize.test.ts
index d1e611b7..94be7d64 100644
--- a/packages/ssz/test/unit/merkleize.test.ts
+++ b/packages/ssz/test/unit/merkleize.test.ts
@@ -1,6 +1,6 @@
 import {expect} from "chai";
 import {bitLength, maxChunksToDepth, merkleize, mixInLength, nextPowerOf2} from "../../src/util/merkleize";
-import {merkleizeInto, LeafNode, zeroHash} from "@chainsafe/persistent-merkle-tree";
+import {merkleizeBlocksBytes, LeafNode, zeroHash} from "@chainsafe/persistent-merkle-tree";
 
 describe("util / merkleize / bitLength", () => {
   const bitLengthByIndex = [0, 1, 2, 2, 3, 3, 3, 3, 4, 4];
@@ -41,7 +41,7 @@ describe("util / merkleize / mixInLength", () => {
       mixInLengthBuffer.set(root, 0);
       mixInLengthBuffer.writeUIntLE(length, 32, 6);
       const finalRoot = new Uint8Array(32);
-      merkleizeInto(mixInLengthBuffer, 2, finalRoot, 0);
+      merkleizeBlocksBytes(mixInLengthBuffer, 2, finalRoot, 0);
       const expectedRoot = mixInLength(root, length);
       expect(finalRoot).to.be.deep.equal(expectedRoot);
     });
@@ -58,7 +58,7 @@ describe("merkleize should be equal to merkleizeInto of hasher", () => {
       const roots = nodes.map((node) => node.root);
       const expectedRoot = Buffer.alloc(32);
       const chunkCount = Math.max(numNode, 1);
-      merkleizeInto(padData, chunkCount, expectedRoot, 0);
+      merkleizeBlocksBytes(padData, chunkCount, expectedRoot, 0);
       expect(merkleize(roots, chunkCount)).to.be.deep.equal(expectedRoot);
     });
   }