that. Uh but then I thought, "Well, what would it really mean? What would be possible or how could it be possible to make the coding agent fully recursive? So, the coding agent harness like calls itself, like the exact version of itself. Um and how might you implement that? And that is what I called Y pie. Uh Y stands for the lambda calculus uh Y combinator. And pie, in case you haven't heard of it, is really awesome coding agent. It's incredibly minimal and it's specifically designed to be extensible. So, Mario uh wants you to write extensions for pie for new features that you would like rather than trying to stuff your ideas into the the main um agent. So, it's meant to be a very minimal core that you extend however you like. And when I originally had the uh recursive coding agent idea, I wanted to do it with pie. I was not able to use pie extensions to achieve this goal. Um and so, I had to fork it instead. I'm very excited to report that in anticipation of this talk, I revisited this and now pie has evolved um and the pie extensions have evolved such that you can uh make it fully recursive with a pure extension. So, I have both the pure recursive um extension pi recursive uh package as well as the y pi wrapper that is like a convenience wrapper for this. So, this is very quite literally a recursive coding agent in the sense that pi calls pi calls pi calls pi. You can set the depth however you want. Um