diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index 632a0ae..db42aa6 100644
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -14,7 +14,7 @@
               "type": "markdown",
               "state": {
                 "file": "Minecraft Datapacking/When Two Macros are Faster Than One.md",
-                "mode": "source",
+                "mode": "preview",
                 "source": false
               },
               "icon": "lucide-file",
@@ -181,9 +181,9 @@
   },
   "active": "246e3fe4155bbefd",
   "lastOpenFiles": [
+    "Minecraft Datapacking/When Two Macros are Faster Than One.md",
     "Minecraft Server Administration/Tips for Minecraft Server Administration.md",
     "Minecraft Server Administration/index.md",
-    "Minecraft Datapacking/When Two Macros are Faster Than One.md",
     "Minecraft Datapacking/Arrays",
     "Minecraft Datapacking",
     "index.md",
diff --git a/Minecraft Datapacking/When Two Macros are Faster than One.md b/Minecraft Datapacking/When Two Macros are Faster than One.md
index 7159256..03a84b2 100644
--- a/Minecraft Datapacking/When Two Macros are Faster than One.md	
+++ b/Minecraft Datapacking/When Two Macros are Faster than One.md	
@@ -1,6 +1,7 @@
 ---
 title: when two macros are faster than one
 draft: "false"
+published: 2025-03-25
 ---
 While working on my Database datapack (still WIP), I knew I'd want to find the most efficient way to dynamically access dynamically populated arrays. I had some ideas and decided to benchmark them using [Kragast's Benchmark Datapack](https://www.planetminecraft.com/data-pack/benchmark-6443027/). This process was really illuminating to me, and I hope it will be for you as well. Thanks for all the help from **PuckiSilver**, **amandin**, and **Nicoder**.