Link to Razetime's AoC blog post; update data

1 files changed, 12 insertions, 12 deletions

diff --git a/docs/community/aoc.html b/docs/community/aoc.html
index f9ca0b00..97f2816a 100644
--- a/docs/community/aoc.html
+++ b/docs/community/aoc.html
@@ -5,7 +5,7 @@
 </head>
 <div class="nav">(<a href="https://github.com/mlochbaum/BQN">github</a>) / <a href="../index.html">BQN</a> / <a href="index.html">community</a></div>
 <h1 id="advent-of-code"><a class="header" href="#advent-of-code">Advent of Code</a></h1>
-<p><a href="https://adventofcode.com/2021">Advent of Code 2021</a> saw great participation by the BQN community, with a total of 233 solutions published by 22 programmers. They can be found in these repositories:</p>
+<p><a href="https://adventofcode.com/2021">Advent of Code 2021</a> saw great participation by the BQN community, with a total of 234 solutions published by 22 programmers. They can be found in these repositories:</p>
 <center>
 
 <p><a href="https://github.com/dzaima/aoc/tree/master/2021/BQN">dzaima</a> •
@@ -15,8 +15,8 @@
 <a href="https://github.com/leahneukirchen/adventofcode2021">Leah Neukirchen</a> •
 <a href="https://github.com/Detegr/aoc2021">Antti Keränen</a> •
 <a href="https://gitlab.com/icen/aoc21">Caleb Quilley</a> •
-<a href="https://github.com/AlexDikelsky/puzzles/tree/main/advent_of_code/advent_2021">Alex Dikelsky</a> •
 <a href="https://github.com/alvinvoo/aoc2021">Alvin Voo</a> •
+<a href="https://github.com/AlexDikelsky/puzzles/tree/main/advent_of_code/advent_2021">Alex Dikelsky</a> •
 <a href="https://github.com/andreypopp/aoc2021">Andrey Popp</a> •
 <a href="https://github.com/JohnnyJayJay/adventofcode-21">Johnny</a> •
 <a href="https://git.sr.ht/~jshholland/adventofcode/tree/master/item/2021">Josh Holland</a> •
@@ -77,8 +77,8 @@
     <text x='10' y='137'>Leah</text>
     <text x='10' y='155'>Antti</text>
     <text x='10' y='173'>Caleb</text>
-    <text x='10' y='191'>Alex</text>
-    <text x='10' y='209'>Alvin</text>
+    <text x='10' y='191'>Alvin</text>
+    <text x='10' y='209'>Alex</text>
     <text x='10' y='227'>Andrey</text>
     <text x='10' y='245'>Johnny</text>
     <text x='10' y='263'>Josh</text>
@@ -100,8 +100,8 @@
       <path d='M90 132.5h220M330 132.5h60M410 132.5h40M470 132.5h40M550 132.5h40'/>
       <path d='M90 150.5h360M470 150.5h40'/>
       <path d='M90 168.5h360'/>
-      <path d='M90 186.5h220M330 186.5h40'/>
-      <path d='M90 204.5h260'/>
+      <path d='M90 186.5h280'/>
+      <path d='M90 204.5h220M330 204.5h40'/>
       <path d='M90 222.5h60M170 222.5h60M290 222.5h60M370 222.5h20M410 222.5h20M470 222.5h20'/>
       <path d='M90 240.5h140M250 240.5h40'/>
       <path d='M90 258.5h160'/>
@@ -118,7 +118,7 @@
     </g>
     <g stroke-width='6' class='red' opacity='0.2'>
       <path d='M310 132.5h20M390 132.5h20M450 132.5h20M510 132.5h40'/>
-      <path d='M310 186.5h20'/>
+      <path d='M310 204.5h20'/>
       <path d='M230 240.5h20'/>
       <path d='M110 294.5h20'/>
       <path d='M90 330.5h100M230 330.5h20M270 330.5h60'/>
@@ -130,8 +130,8 @@
   </g>
 </svg>
 
-<p>In addition to these, Leah wrote two blog posts explaining her solutions for <a href="https://leahneukirchen.org/blog/archive/2021/12/counting-lanternfish-with-bqn-and-linear-algebra.html">day 6</a> and <a href="https://leahneukirchen.org/blog/archive/2021/12/surveying-lava-basins-with-bqn-and-fixpoints.html">day 9</a>.</p>
-<p>The number of BQN solutions for each of the 25 days is plotted below, along with totals from AoC's <a href="https://adventofcode.com/2021/stats">stats page</a>. The BQN solutions are scaled to be visible here: there are 6828 times more valid AoC submissions than published BQN solutions overall.</p>
+<p>Some wrote about aspects of the Advent experience: Leah explained her solutions for <a href="https://leahneukirchen.org/blog/archive/2021/12/counting-lanternfish-with-bqn-and-linear-algebra.html">day 6</a> and <a href="https://leahneukirchen.org/blog/archive/2021/12/surveying-lava-basins-with-bqn-and-fixpoints.html">day 9</a>, Hannu <a href="https://hannuhartikainen.fi/blog/advent-of-bqn/">reflected</a> on the choice of BQN, and Raghu <a href="https://razetime.github.io/blog1/2022/01/09/aoc-bqn.html">commented on</a> each problem.</p>
+<p>The number of BQN solutions for each of the 25 days is plotted below, along with totals from AoC's <a href="https://adventofcode.com/2021/stats">stats page</a>. The BQN solutions are scaled to be visible here: there are 6827 times more valid AoC submissions than published BQN solutions overall.</p>
 <svg viewBox='-40 -25 336 178'>
   <g stroke-width='1.2' font-size='13px' text-anchor='end' fill='currentColor'>
     <rect class='code' stroke-width='1' rx='6' x='-20' y='-20' width='296' height='168'/>
@@ -143,13 +143,13 @@
       <text transform='rotate(-90)' dy='-0.35em' x='-64' y='0'>count</text>
     </g>
     <path class='Paren' stroke='currentColor' fill='none' d='M0 0V128H256'/>
-    <path class='red' style='fill:none' d='M0 0L10.667 21.122L21.333 34.102L32 66.959L42.667 74.553L53.333 74.245L64 77.333L74.667 82.701L85.333 86.213L96 90.435L106.667 95.042L117.333 99.219L128 98.637L138.667 98.499L149.333 104.789L160 108.939L170.667 109L181.333 114.175L192 118.798L202.667 115.309L213.333 113.605L224 116.203L234.667 119.708L245.333 121.228L256 119.294'/>
-    <path class='green' style='fill:none' d='M0 51.357L10.667 71.526L21.333 55.39L32 79.594L42.667 75.56L53.333 67.492L64 67.492L74.667 87.661L85.333 75.56L96 87.661L106.667 87.661L117.333 95.729L128 87.661L138.667 95.729L149.333 95.729L160 103.797L170.667 95.729L181.333 99.763L192 111.865L202.667 99.763L213.333 103.797L224 111.865L234.667 123.966L245.333 115.898L256 111.865'/>
+    <path class='red' style='fill:none' d='M0 0L10.667 21.116L21.333 34.08L32 66.927L42.667 74.514L53.333 74.193L64 77.272L74.667 82.658L85.333 86.149L96 90.367L106.667 94.989L117.333 99.169L128 98.574L138.667 98.442L149.333 104.735L160 108.875L170.667 108.938L181.333 114.112L192 118.738L202.667 115.258L213.333 113.545L224 116.127L234.667 119.629L245.333 121.132L256 119.185'/>
+    <path class='green' style='fill:none' d='M0 51.572L10.667 71.684L21.333 55.594L32 79.73L42.667 75.707L53.333 67.662L64 67.662L74.667 87.775L85.333 75.707L96 87.775L106.667 87.775L117.333 95.82L128 87.775L138.667 91.797L149.333 95.82L160 103.865L170.667 95.82L181.333 99.842L192 111.91L202.667 99.842L213.333 103.865L224 111.91L234.667 123.977L245.333 115.932L256 111.91'/>
   </g>
 </svg>
 
 <p>The BQN counts fall off much less than the average. Most likely this is because programmers who decide to try AoC in a crazy new language like BQN tend to be more committed to the task, but BQN also has to meet some minimum bar to enable these crazy people to continue.</p>
-<p>Just how okay is BQN? Hannu makes a case for optimism in <a href="https://hannuhartikainen.fi/blog/advent-of-bqn/">this blog post</a>. Hannu writes that BQN's slogan &quot;might be the best [further glowing praise/context]&quot;, in stark contrast to that time <a href="https://adspthepodcast.com/2021/12/17/Episode-56.html">Bryce and Conor agreed</a> that it was a bad slogan. And Andrey offers <a href="https://news.ycombinator.com/item?id=29521264">suspiciously positive comments</a> as well. The list includes &quot;good text editor support&quot;, but Johnny remarked on the forums that he didn't manage a good editor/REPL setup—a second contradiction, meaning that I can now prove the Riemann hypothesis in <em>two</em> independent ways. Johnny also cited little support for string handling and low-information error messages as obstacles. I like that these aren't tied to the core language, and can eventually be improved, even though it won't be easy. dzaima complained about frequent confusion between functions and immediate blocks, and right-to-left folds being the much less useful direction. I dislike that dzaima is right a lot.</p>
+<p>Just how okay is BQN? Hannu <a href="https://hannuhartikainen.fi/blog/advent-of-bqn/">made the case</a> for optimism. Hannu writes that BQN's slogan &quot;might be the best [further glowing praise/context]&quot;, in stark contrast to that time <a href="https://adspthepodcast.com/2021/12/17/Episode-56.html">Bryce and Conor agreed</a> that it was a bad slogan. And Andrey offers <a href="https://news.ycombinator.com/item?id=29521264">suspiciously positive comments</a> as well. The list includes &quot;good text editor support&quot;, but Johnny remarked on the forums that he didn't manage a good editor/REPL setup—a second contradiction, meaning that I can now prove the Riemann hypothesis in <em>two</em> independent ways. Johnny also cited little support for string handling and low-information error messages as obstacles. I like that these aren't tied to the core language, and can eventually be improved, even though it won't be easy. dzaima complained about frequent confusion between functions and immediate blocks, and right-to-left folds being the much less useful direction. I dislike that dzaima is right a lot.</p>
 <p>All three non-dzaimas of the last paragraph are essentially array outsiders, with little or no experience with languages like J or APL. In fact I think this describes the majority of Adventurers in BQN (although the list also includes array junkies like Raghu and Leah, and they've predictably made it further than most participants). Reaching out to a general programming audience wasn't initially a goal of BQN because I didn't think it <em>was</em> within reach. I realized this was wrong, and began to adjust course, in the early days, but am pleased to continue getting even more wrong.</p>
 <p>With all this said, a handful of reports about recreational programming is a pretty poor basis for judging a programming language. Advent of Code was more useful as a checkup on BQN and its environment, resulting in fixes to documentation and implementation. And dzaima improved various aspects of performance as a way to cheat in speed battles with ngn/k.</p>
 <p>BQN did do okay in terms of performance. At times programmers on the forum commented about having slow solutions (tens of seconds) or having to rewrite an obviously unsatisfactory algorithm. I don't think anyone mentioned having to switch languages for performance reasons, which is good news for an implementation as young as CBQN. But also not a surprise, as it's pretty fast with scalar code for an interpreter: about 10 times slower than C when I've measured it. Array code is usually faster, but can be slower. A particular problem was that in-place mutation <code><span class='Modifier2'>⌾</span><span class='Paren'>(</span><span class='Value'>i</span><span class='Modifier2'>⊸</span><span class='Function'>⊑</span><span class='Paren'>)</span></code> is only fast for very simple cases. Of course, this problem only arises because BQN's arrays are immutable, highlighting that immutable arrays, despite being perfect in every way, can be a pain. In a serious application you might be willing to endure more pain and use a mutable array object, to ensure good performance.</p>