diff --git a/N.js b/N.js
index cbf01f4..56b9c22 100644
--- a/N.js
+++ b/N.js
@@ -143,7 +143,6 @@ var N =
             if(next.ID.Walk !== N.ID.Walk)
             {
                 next.ID.Walk = N.ID.Walk;
-                //console.log("processing", next.Meta)
                 let results = inIterator(next);
                 if(results !== false)
                 {
diff --git a/Pivot.js b/Pivot.js
index 12d9e98..8d1bfb1 100644
--- a/Pivot.js
+++ b/Pivot.js
@@ -105,14 +105,6 @@ var Pivot =
                         console.log("walking modifiers up from", inLastBranch.Meta.Label);
                         N.ID.Walk++;
                         N.Walk(connectModifiers, inLastBranch, "Hierarchy", false);
-                        /*
-                        N.Walk((n)=>
-                        {
-                            console.log("going up", n);
-                        }
-                        , inLastBranch, "Hierarchy", false);
-                        */
-
                     }
 
                     // lastly connect the leaf to the branch
diff --git a/index.html b/index.html
index 5ae3960..6d417e9 100755
--- a/index.html
+++ b/index.html
@@ -8,6 +8,7 @@
     <body>
 
 <script>
+    var count = 0;
     let root = N.Create("root");
     let recurse = (node, depth) =>
     {
@@ -18,7 +19,7 @@
         N.Connect(node, c2, "parent");
 
         var iterator;
-        if(depth < 3)
+        if(depth < 2)
         {
             // loop over the new nodes and keep recursing
 
@@ -30,14 +31,25 @@
         else
         {
             // walk up
-            iterator = () =>
+            iterator = (child) =>
             {
-
+                /*
+                    issue: why does incrementing walk id cause an infinite loop
+                */
+                N.ID.Walk++;
+                count++;
+                if(count > 100)
+                {
+                    console.log("big problems");
+                    throw new Error("holy crap");
+                }
             };
         }
 
-        N.Walk(iterator, node, "parent", true);
+
+        N.Walk(iterator, node, "parent");
     }
+    N.ID.Walk++;
     recurse(root, 0);
 
 </script>
