diff --git a/src/main/java/baritone/builder/PlaceOrderDependencyGraph.java b/src/main/java/baritone/builder/PlaceOrderDependencyGraph.java
index 6aaf54957..47e39a009 100644
--- a/src/main/java/baritone/builder/PlaceOrderDependencyGraph.java
+++ b/src/main/java/baritone/builder/PlaceOrderDependencyGraph.java
@@ -115,7 +115,7 @@ public class PlaceOrderDependencyGraph {
     }
 
     private void sanityCheck() {
-        int[] test = new int[bounds().sizeX * bounds().sizeY * bounds().sizeZ * Face.NUM_FACES];
+        int[] test = new int[bounds().size * Face.NUM_FACES];
         bounds().forEach(pos -> {
             for (int face = 0; face < 6; face++) {
                 test[bitIndex(pos, Face.VALUES[face])]++;
diff --git a/src/main/java/baritone/builder/ReachabilityCache.java b/src/main/java/baritone/builder/ReachabilityCache.java
index f1f56313e..cf8fb3a0b 100644
--- a/src/main/java/baritone/builder/ReachabilityCache.java
+++ b/src/main/java/baritone/builder/ReachabilityCache.java
@@ -30,7 +30,7 @@ public class ReachabilityCache implements IReachabilityProvider {
         playerPositionToBlock = new Long2ObjectOpenHashMap<>();
         int maxReasonableCacheSize = overlay.bounds().size;
         int[] cnt = {0};
-        overlay.forEachReal(blockPos -> { // by only iterating through real blocks, this will be a much faster and better option for sparse schematics (e.g. map art)
+        overlay.forEachReal(blockPos -> { // by only iterating through real blocks, this will be a much faster and better option for sparse schematics (e.g. staircased map art)
             for (long offset : sphere.positions) {
                 long playerEyeVoxel = (blockPos + offset) & BetterBlockPos.POST_ADDITION_MASK;
                 if (overlay.bounds().inRangePos(playerEyeVoxel)) {