wip: feat: xbox modding post

Reviewed-on: #1

Dockerfile

@@ -4,9 +4,9 @@ WORKDIR /hugo
 RUN hugo new site /hugo
 RUN git clone https://github.com/yihui/hugo-xmin.git themes/hugo-xmin
 ADD hugo.toml /hugo/hugo.toml
-ADD content /hugo/content
 ADD static /hugo/static
 ADD shortcodes /hugo/layouts/shortcodes
 ENV PORT=1313
 EXPOSE $PORT
+ADD content /hugo/content
 CMD ["hugo", "serve", "--baseURL", "https://blog.gtz.dk/", "--bind", "0.0.0.0", "--port", "$PORT"]

Makefile

@@ -1,3 +0,0 @@
-demo:
-	docker build -t wip .
-	docker run --rm -it -p 8080:8080 wip hugo serve --bind 0.0.0.0 --port 8080

README.md

@@ -10,9 +10,7 @@ docker run --rm -it -p 8080:8080 wip hugo serve --bind 0.0.0.0 --port 8080
 
 ## Things I want to write
 
-### Opinion Pieces
+### Opinions
- - [ ] Clean Architecture is stupid - dependency injection is king
- - [ ] Neorg is bad, actually - ?? is king
  - [ ] Clean Architecture is stupid and overly complicated - dependency injection is king
  - [ ] For want of a neater (human) internet
  - [ ] A truly FOSS printer.
@@ -26,7 +24,3 @@ docker run --rm -it -p 8080:8080 wip hugo serve --bind 0.0.0.0 --port 8080
  - [ ] how to securely "self-host" using a VPS, portainer and traefik
  - [x] how to configure neomutt
  - [ ] how to securely host a mail server
-
-### Old sillyblog
- - [x] Avr memory model
- - [x] similarity graph

content/posts/avr-memory-model.md

@@ -1,108 +0,0 @@
-+++
-date = '2019-03-24'
-draft = false
-title = 'AVR Memory Model: The Practical Explanation'
-tags = ['avr', 'programming', 'memory']
-categories = ['technical']
-+++
-
-There is A LOT of people that have already explained this, but I personally don't feel like going through billions of
-forum posts, with most of them just dying out somewhere in 2008 with no better answer than "I figured it out, thanks". 
-
-Regardless. BIG shoutout to the amazing people at [AVR Freaks](https://www.avrfreaks.net/). They are really cool.
-Seriously. Make a user and ask them about anything, and they'll help you.
-
-## Disclaimer
-
-I have only been debugging the memory usage of a specific ATMega chip. I don't know if other AVR chip-types use the
-same, but this explanation should be valid for all MCUs that the
-[avr-libc](http://www.nongnu.org/avr-libc/user-manual/index.html) package supports.
-
-I also assume that GNU/Linux is being used on the development computer.
-
-### Open-Source development tools
-
-The [avr-gcc](http://www.nongnu.org/avr-libc/user-manual/pages.html) compiler chain is an open source effort to have
-C/C++ for AVR Atmel chips. They do provide some rudimentary C++ support, but there's no STL and the `new` and `delete`
-keywords are not implemented by default. Even purely virtual functions doesn't work out of the box. These things can be
-added manually though.
-
-## The Memory Model
-
-As the avr-libc developers [explain](http://www.nongnu.org/avr-libc/user-manual/malloc.html), there's typically not a
-lot of RAM available on most many devices and therefore it's very important to keep track of how much memory you are
-using.
-
-{{< centered image="/malloc-std.png" >}}
-
-All of these symbols `SP`, `RAMEND`, `__data_start`, `__malloc_heap_start`, etc. Can be modified in the compiler, but
-the picture above gives the default layout (for an ATMega128 MCU). It goes without saying, that if you don't have an
-external RAM chip, you won't be able to utilize the extra RAM space for that. Otherwise, the memory addresses are pretty
-straight forward: `0x0100 => 256` bytes is the start of the memory, `0x10FF => 4351` bytes is the end. If you're
-wondering where the RAM ends on your specific MCU, you can usually simply open the spec-sheet of the chip and see the
-amount of available memory is in it. 
-For the [ATMega128](https://www.microchip.com/wwwproducts/en/ATMEGA128) that number is 4096 (`4351 - 256 = 4095` (the
-spec-sheet also counts the 0th byte)).
-
-## The avr-libc Memory Allocators
-
-Now for the juicy part. whenever you `malloc` something in your program, the allocator first writes a 2-byte *free-list
-entry* that tells the system how big your object is.
-
-Example:
-
-```cpp
-/* ... */
-// Allocate an array of 5 integers
-int* my_heap_object = static_cast<int*>(malloc(sizeof(int) * 5));
-/* ... */
-```
-
-Assuming that the memory has been cleared on chip-startup, the above example ends up with the memory setup looking like
-this: (Don't mind the specifc memory addresses. If you're curious, you can try doing this, by attaching `avr-gdb` to a
-simulator or On Chip Debugger (OCD)). 
-
-```
-gdb: > x/16xb my_heap_object
-0x800100:	0a 00 00 00 00 00 00 00 
-0x800108: 	00 00 00 00 00 00 00 00
-```
-
-The first bytes at address `0x800100` are `0a` and `00`. These bytes are the *free-list* entry and explains how "big"
-the object is. When reading this, we have to remember that the model is little endian-based (meaning that the bytes are
-switched), 
-so we actually have the value of `0x000a`, meaning `10` in decimal. This makes a lot of sense, since we allocated 5
-`int`s, that is of size 2 (16bit integers). 
-
-The memory dump shows 16 bytes in total, so the last 4 bytes displayed in the gdb example are not part of the object.
-However, if you look at the Memory Model picture again, you can see that the `__brkval` value points to the biggest
-memory address that has not been allocated. In our example, if you check where the `__brkval` points to after our
-allocation, we get:
-
-```
-gdb: > __brkval
-$ 268
-```
-
-268 in hexadecimal is `0x10c`, and if interpreted as an address we get `0x80010c`, which fits very well with our
-example, since it is exactly 12 bytes away from where the free-list entry of `my_heap_object` is located at. 
-
-When `free`-ing the object again, the deallocator looks at the free-list entry at the given address, and wipes the
-free-list entry. **This is why you should not free a dangling pointer**. Freeing something that is not really free-list
-entry *will* result in undefined behaviour, and I think we all know how bad **that** is. (Even though the AVR
-environment is actually very good at handling it. In my experience, it usually just crashes and starts over.) 
-However, as
-[explained](http://www.nongnu.org/avr-libc/user-manual/group__avr__stdlib.html#gafb8699abb1f51d920a176e695ff3be8a) in
-the avrlibc documentation, freeing the `NULL` value, doesn't do anything. So remember to assign your free'd pointers to
-`NULL` afterwards. 
-
-## Wrapping up
-
-The memory allocators of AVR can be very confusing and if you don't keep your thoughts straight when programming, you
-can very easily get yourself into a lot of trouble. Since STL is not available to avr-gcc programmers, we dont have our
-glorious smart pointers, so we should implement them ourselves (or use arduino's implementations). That might become a
-future blogpost. 
-
-Regardless, I hope this helps the lost souls that are trying to actually use these tools. 
-
-{{< centered image="/6616144.png" >}}

content/posts/bubble-graph.md

@@ -1,103 +0,0 @@
-+++
-date = '2019-03-13'
-draft = false
-title = 'Plotting Circular Bubble Graph in LaTeX'
-tags = ['latex', 'programming']
-categories = ['technical']
-+++
-
-When doing web-intelligence, you might need to visualize what's called inter-sentence similarity in a particular format.
-I personally haven't found an official name for these kinds of graphs, so I just simply call them Circular Bubble
-Graphs. 
-
-During a university project we needed such a graph in our report, and I got the idea of automatically plotting it
-through `gnuplot` and integrating it directly into our report with `gnuplottex`. You can see an example of the outcome
-of the script.
-
-![Sentence similarity bubble graph example](/sentence_similarity_graph_example.svg)
-
-The script operates on a comma-seperated file (`.csv`). The data should be provided as a matrix of sentences assumed to
-be symmetric, with the cells containing a real number from 0 to 1, indicating the similarity between the column and the
-row. Because of this symmetric property, half of the matrix is ignored by the script. (It also ignores the diagonal,
-since sentence `23` will always have a maximum similarity to sentence `23`. It would also be hard to plot that line)
-
-The whole script can be seen below, but you can also download it as a file
-[here](/sentence_similarity_graph.gnuplot). Make sure to set the `my_dataset` variable to your desired
-dataset. Example matrix can be downloaded [here](/example_similarities.csv).
-
-```bash
-# Sentence similarity graph plotter
-# uncomment this for manual operation of the dataset plotted
-# my_dataset = "./sentence_similarities.csv" # ARG1
-set parametric
-set size square
-
-# Styling
-set pointsize 7.5
-set style fill solid 1.0 border rgb 'grey30'
-set style line 1 lc rgb 'black' pt 6 lw 0.5
-
-# Basically a one-dimensional circular coordinate system
-fx(t) = cos(t)
-fy(t) = sin(t)
-rownum = floor(system("wc -l ".my_dataset."")) +1
-coord(k) = (k/real(rownum))*(2*pi)
-fxx(t) = cos(coord(t))
-fyy(t) = sin(coord(t))
-
-set trange [0:2*pi-(coord(1.0))]
-set sample rownum
-set noborder
-unset tics
-set xrange [-1.2:1.2]
-set yrange [-1.2:1.2]
-set title "Sentence inter-similarity graph"
-set multiplot
-refloptimization = 0
-do for [i = 0:rownum-1] {
-  do for [j = refloptimization:rownum-1] {
-    if (i != j) {
-      # Get how many columns there are in the dataset.
-      arrwidth = real(system("awk 'FNR == ".(i+1)." {print $".(j+1)."}' ".my_dataset.""))
-      if (arrwidth > 0.0) {
-        bubblerad = 0.125
-        x1 = fxx(i)
-        y1 = fyy(i)
-        x2 = fxx(j)
-        y2 = fyy(j)
-        
-        dvx = x2-x1
-        dvy = y2-y1
-        dvl = sqrt((dvx ** 2) + (dvy ** 2))
-        x1 = x1 + (dvx/dvl)*bubblerad
-        y1 = y1 + (dvy/dvl)*bubblerad
-        x2 = x2 - (dvx/dvl)*bubblerad
-        y2 = y2 - (dvy/dvl)*bubblerad
-        # Overleaf's arrow-width rendering is pretty terrible, 
-        # so we use a color-gradient to determine connection-strength.
-        if (arrwidth > 0.2) { 
-          col = "#000000" 
-        } else { 
-          if (arrwidth < 0.1) { 
-            col = "#B8B8B8"
-          } else { 
-            col = "#E4E4E4" 
-          } 
-        }
-        
-        set arrow "".i.j."" from x1,y1 to x2,y2 nohead lw 0.5 lc rgb col
-        #set label "H" at (fxx(j)-fxx(i)),(fyy(j)-fyy(i))
-        show arrow "".i.j.""
-      }
-    }
-  }
-  refloptimization = refloptimization + 1
-}
-# Plot the circles
-plot '+' u (fx(t)):(fy(t)) w p ls 1 notitle
-
-# Plot the sentence labels
-plot '+' u (fx(t)):(fy(t)):(sprintf("s.%d",$0+1)) with labels notitle
-```
-
-{{< centered image="/6616144.png" >}}

content/posts/computation-in-nature.md

@@ -1,90 +0,0 @@
-+++
-date = '2018-05-10'
-draft = false
-title = 'Computation in Nature'
-tags = ['philosophy', 'old']
-categories = ['opinion']
-+++
-
-## Disclaimer
-
-This was written as a student project as part of our ethics course, where we had to write an opinion piece on anything
-we wanted in the field of computer science. Note that this was before *LLM*'s was a thing. I also apologize if the
-wording is off - this was written in an afternoon as a rush-job. I still think it's an interesting read though.
-
-# Computation in Nature
-
-> "If you ever think your code is bad, just remember that CPUs are just rocks that we tricked into thinking"
-
-**Does nature compute, or is computation something that only humans are doing? If so, what is it about?**
-
-To answer this question, we would need to define what the terms used in it even means.  If you look up the definition
-of the word ’compute’ on Merriam Websters dictionary, you find that it primarily means _"to determine
-especially by mathematical means"_. This definition mentions a usage of mathematics, which suggests a close bond
-between these concepts.  What would it mean to determine something? I would argue that it means to make a decision
-based on either prior experience, data or calculations. This implies that computation have a focus on deciding
-and _"finishing a thought"_. It has an end goal. You can even use conclusions made by previous computations to
-compute more advanced problems.
-
-In other words, computation is about answering queries about data and the process of doing so.  We see
-mathematics emerge in nature aswell. In
-[The Chemical Basis of Morphogenesis](https://www.dna.caltech.edu/courses/cs191/paperscs191/turing.pdf), Alan M. Turing
-mentions that flower petals rarely exceeds a quantity of five. We even see the fibonacci sequence in [sunflower
-seeds](http://popmath.org.uk/rpamaths/rpampages/sunflower.html).
-
-An example of computation in nature is actually very easy to find. Take a rabbit, or any other smaller prey. A rabbit
-is constantly observing and reacting to the sorrounding environment, otherwise it gets eaten by predators or fall
-into a lake and drown or any other scenario involving death. You could argue that the rabbit is constantly asking
-questions about what to: _"Should I run away?"_, _"Should I keep eating?"_, _"Should I be eating this?"_ etc. The
-rabbit may not be consciously aware of these queries, but nevertheless, it is answering to them through actions.
-
-In Empiricism, the concept of a mind being a blank slate (in this case we are talking about a human mind, not
-a rabbit’s), which remembers experiences throughout it's life is very much applicable here. This trait means that a
-human mind has a memory, i.e. It can remember old conclusions and recall them when desired. We can actually prove that
-this trait is not exclusive to humans, since we can observe other mammals (and even fish and reptiles) demonstrating
-the usage of memory. A prime example is the elephant, but pretty much any animal applies here.
-
-In Rationalism, we see a similar pattern that mimics memory - using the method of deduction to find conclusions and
-deduct new conclusions. However, if you were to believe the Rationalists, getting the data needed for computation
-in nature, may be a tricky task. We previously had an assumption that we could trust our senses and that other
-creatures also had senses. In Rationalism the only thing we can trust is the fact that we are doubting. Since we
-can’t say anything about if the rabbit is doubting everything. This is where the rabbit example breaks down a
-little, but we are not completely stuck here. Humans are mammals and mammals are a type of animal. Animals are
-part of nature, therefore humans must be part of nature. You and I are humans (I assume) and this logic enables us
-to make deductive arguments based on subjective thoughts. The first part of the Cartesian circle, _"Dubito ergo
-cogito"_ (_"I doubt, therefore I think"_) made by René Descartes, is actually very applicable to computation in
-nature. Thinking is a form of computation and since _I_ am part of nature. Computation rationally happens in nature.
-
-But what about non-natural computation? Artificial computation machines such as modern digital computers or even
-old mechanical adding-machines are definitely things that compute data. There is a diconnect from artificial
-computers to natural computers (brains) though. Currently humans have not been able to produce a machine with natural
-intuition as we observe it in nature. We have come close to something that looks like it with simulated organisms,
-but we are not even close to the complexeties of an intuitive brain such as the human one (or even other clever
-mammals, such as the dolphin or chimp). I personally believe that the reason for this disconnect is because of
-the intention of the computational device at the point of origin. The intent that biology had when brains were
-invented was certainly not to fix mathematical problems. It was primarily for the organism to survive and have a
-better chance for survival. But fixing mathematical problems is the exact intent humans had when we created our
-artificial computers. This **intent** changes the very nature of the system, and because of this, even though brains
-and computers might be similar in some ways they are and always will be fundamentally different things.
-
-A. M. Turing presents (and disagrees with) various arguments, in his article
-[Computing Machinery and Intelligence](https://archive.org/details/MIND--COMPUTING-MACHINERY-AND-INTELLIGENCE),
-that a computer will not be able to be conscious. I tend to follow Turings idea that most of the arguments he
-presents are either made out of a tendency towards thinking that humans have to be superior to machines, either
-intellectually or that we can *feel* things. I do disagree with one point that he makes in the article: Turing
-argues that a computer/program will never be able to change it’s behavior based off of prior experiences, which
-sounds ludicrous if you’ve taken any modern Machine Intelligence class. This was probably a conclusion he came
-to because of the time era he was in and that AI as a field was not as big (if at all existent) at the time.
-
-Turing finishes the article with the notion that there is still a lot of work to be done in the field of AI and it
-is a fun contrast to see what arguments and thoughts a mind like his had back in the fifties, compared to modern
-AI can offer. Will humans ever be able to create a truly conscious artificial mind? And will we ever be able to
-test it properly?
-
-If you believe the Mathematical Realists, mathematics is a thing that exists independently of humans, and can be
-found/discovered by any being clever enough to deduct these laws. This point of view can be very reassuring, if
-you believe that real artificial intelligence can be made.  Since mathematics is an inherit trait of the universe,
-and that computers are machines that can (essentially) execute math, and that humans are part of nature. It might
-be possible to make an AI that is (atleast) as clever as humans, maybe it is innevitable.
-
-{{< centered image="/6616144.png" >}}

content/posts/neorg.md

@@ -1,102 +0,0 @@
-+++
-date = '2024-11-27'
-draft = true
-title = 'Moving Away From Neorg'
-tags = ['tutorial']
-categories = ['technical', 'life']
-+++
-
-Neorg is a great neovim plugin, but it's in that awkward state that many free and open source projects are in where
-it's only actively maintained by one guy, and the whole thing is apparently undergoing a rewrite. For me it was a bit
-of a honeypot trap, as I saw the tagline **"Modernity meets insane extensibility"** and thought that there surely was
-many, easy to use plugins that could extend the default functionality. There's obviously the great `awesome` list for
-neorg [here](https://github.com/nvim-neorg/awesome-neorg) but most of these plugins have been abandonned or won't work
-well with the new rewrite.
-Don't get me wrong, the default neorg experience is actually amazing and the syntax is clearly (subjectively) superior
-to regular emacs org-mode, but I'm not sure if either of those can compete with the increasingly standardized markdown
-syntax. In any case, when you are trusting your most personal inner thoughts with a syntax, you should really strive
-to use something that has (Neorg actually fails in both of these points):
-
-1. Survived the bathtub curve, and
-2. Won't lock you down to a specific tool.
-
-The second point is probably the most important one. A general life-advise that I first heard from Luke Smith is that
-whenever you have a life decision to make, you should favor the choice that maximises your personal freedom. i.e. If
-one of the choices limit you to only being able to do a thing in one way, using only one tool, provided, managed and
-maintained by one entity (company or person) and the other enables you to do the thing however you want. Or at least
-you can do the thing in multiple ways. You should strongly prefer the second option - even if it's a bit less
-convenient and less sleek or sexy.
-
-We got a bit off track there. Let's get back to how to migrate away from Neorg. I have a couple of criteria for such a
-tool that I need.
-
-## Criteria
-
-Any agenda-ing and kanban-ing will (and should) be done from a separate program. This <u>should</u> also be possible with
-neorg, but the problem here is that the syntax is not that popular (yet), so not many programs actually support it.
-Finding such programs is a separate tools-search though, and should be done based on the syntax decision.
-
-- Conceal level (trivial if there's native treesitter support)
-- Folding (`set foldmethod=expr` see [https://www.jmaguire.tech/posts/treesitter_folding/](https://www.jmaguire.tech/posts/treesitter_folding/))
-- Quickly marking checklists as done (e.g. `<C-space>` or `<leader>td`)
-- Standardized syntax that is widely used
-- Pressing `<Return>` to follow links (create if not exists)
-- `image.nvim` support - preferably through `snacks.nvim`
-
-## Markdown
-
-Just raw markdown might be the way to go. I can set `conceallevel=2` for prettier text whilst editing. There's only
-a couple of things that I want that I might need to mold out using custom things.
-- Follow links: [https://github.com/jghauser/follow-md-links.nvim](https://github.com/jghauser/follow-md-links.nvim)
-
-
-### Converting from Neorg
-
-Neorg have an integrated markdown exporter which works fairly okay. It gets links a bit messed up - especially if it
-is a link to [another neorg file](#indexmd).
-
-## Vimwiki
-
-[plugin page](https://github.com/vimwiki/vimwiki)
-
-This is a great plugin, but it is <u>just</u> a tad too "vim-pilled" and a bit difficult to get to do _excactly_ what I
-want from a note-taking system. The primary issue is that `vimwiki_global_ext = 0` doesn't do the thing it says. The
-`SYNTAX` is registered in neovim with as `vimwiki`, making any markdown based plugins useless. e.g. folding is
-impossible to do (in a good way), because treesitter does not have a vimwiki parser, and if you set the syntax to
-markdown, the actual syntax in the file is still not vimwiki.
-This is a bit dissapointing, because vimwiki is actually <u>great</u>.
-
-```lua
-vim.g.vimwiki_list = {{
-    syntax = "markdown",
-    ext = ".md"
-}}
-vim.g.vimwiki_global_ext = 0
-
--- In your list of lazy.nvim plugins:
-"vimwiki/vimwiki"
-```
-
-### Converting from Neorg
-
-If using markdown as the vimwiki syntax, it should be the same procedure as [Markdown](#markdown). Otherwise, `pandoc` can
-probably get you there if you use markdown as a middle-step.
-
-## Org-mode
-
-[plugin page](https://github.com/nvim-orgmode/orgmode).
-
-This is using the traditional org-mode syntax. This used by almost all emacs users, so it'll make it easy to change
-editor to emacs if I ever decide I want that. Neovim is nice and cool, but it's also very new and not even version 1
-yet.
-
-### Converting from Neorg
-
-You can do a two-step conversion from `.norg` to `.markdown` (see [Markdown](#markdown)) to `.org` (see 
-[https://emacs.stackexchange.com/questions/5465/how-to-migrate-markdown-files-to-emacs-org-mode-format](https://emacs.stackexchange.com/questions/5465/how-to-migrate-markdown-files-to-emacs-org-mode-format)).
-
-
-# Conclusion
-
-
-{{< centered image="/6616144.png" >}}

content/posts/xbox-modding.md

@@ -1,15 +1,16 @@
 +++
 date = '2025-01-27'
-draft = true
+draft = false
-title = 'Softmod your Xbox Original Today'
+title = 'Softmod your Original Xbox Today'
 tags = ['technical', 'games', 'modding']
-categories = ['technical']
+categories = ['technical', 'personal']
 +++
 
+If you want to skip the personal story, the tutorial part starts [here]({{< ref "xbox-modding.md#softmodding-the-xbox" >}}).
+
 The original Xbox is a phenominal little machine.
 In this post I will go over my journey of modding my own personal xbox.
 Feel free to follow along, but this is mostly just a recollection of my journey for the sake of writing it down.
-If you want to skip the personal story, the tutorial part starts [here]().
 
 ## First Things First
 If you own an Xbox Original and you haven't removed the clock capacitor yet, DO IT NOW. YOU SHOULD'VE DONE IT SEVERAL
@@ -68,22 +69,40 @@ The first game console that I modded was a Wii that I bought on a flea-market fo
 Side tangent: The Wii is the _easiest_ console to softmod. You only need an SDCard - that's it.
 This Wii modding lit a fire under me, and I started taking apart 
 
-## Softmodding the Xbox
+## Softmodding the Xbox {#softmodding-the-xbox}
 There are a couple of directions you can take when it comes to modding the OG Xbox.
 I will be exclusively *softmodding* mine, as if I were to solder anything that is required for hardmodding it, I would
-at best brick the console and at worst burn my apartment to the ground.
+at best: brick the console, and at worst burn my apartment to the ground.
-This mod _does_ require purchasing some hardware, namely:
+This mod _does_ require purchasing some hardware though, namely:
- - An xbox (male) to USB (female) adapter.
-   These are increasingly difficult to find, so if you tend to drag your feet on projects like these (like I tend to)
-   buy it now!
- - An older USB stick
- - A DVD burner
- - Some (writable / blank) DVDs
 
-TODO:
+ - **An xbox (male) to USB (female) adapter.**
- - Full list of required hardware
+
+   These are increasingly difficult to find, so if you tend to drag your feet on projects like these (like I tend to)
+   buy it now! Or you might have to make one yourself - and I just said that soldering is out of the picture for me.
+   It has to look like this:
+
+   {{< centered image="/xbox-to-usb.png" style="width: 40%" >}}
+
+ - **An older USB stick.**
+
+   The Xbox will reject most modern USB flash drives - it has to be a fairly small one (I used a 4GiB one), and no, you
+   cannot just set the partition sizes to be small, the physical hardware has to be old. You probably have one lying
+   around, or your parents might have one in their "random electronics" drawer.
+
+ - **A DVD burner and some (writable and blank) DVDs.**
+
+   This is mostly just to burn a single DVD with the softmodding tools on it. I think you can buy pre-burned discs, but
+   if you have a DVD burner (generally just a good doohickey to have), it's much easier to just use `xfburn` to burn the
+   disc yourself.
+
+### Software
+I am using GNU/Linunx, but all of these are also available on Microsoft Windows - I haven't checked if OSX have these,
+but I wouldn't be surprised to find that they also work there.
+
+ - `xfburn` for burning DVDs.
+
+## TODO:
  - Link to MrMario (check for peertube link as a backup)
- - Xbox Controller USB thingy
  - Xbox softmodding tool disc
  - Extras (chimp)
  - Holy crap the IDE hot-swapping
@@ -93,4 +112,9 @@ Now that we have softmodded it, we can choose to upgrade the aging IDE harddrive
 harddrive! This is totally optional, but I highly recommend it as it'll enable you to store many more games on the 
 console itself, rather than mucking about with DVD discs and a dying DVD drive.
 
+## Thanks
+I would like to thank [bringus studios](https://www.youtube.com/@BringusStudios) for keeping the interest of console
+hacking alive and a special thanks to [mr mario](https://www.youtube.com/@MrMario2011) for his fantastic tutorials.
+Please check both of these creators out.
+
 {{< centered image="/6616144.png" >}}

shortcodes/centered.html

@@ -1,3 +1,3 @@
 <p align="center">
-    <img alt="example" src="{{.Get `image`}}" style="max-width: 100%;">
+    <img alt="example" src="{{.Get `image`}}" style="max-width: 100%; {{.Get `style`}}">
 </p>

static/example_similarities.csv

@@ -1,21 +0,0 @@
-1.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0492 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.2353 0.0000 0.0000 0.2182
-0.0000 1.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 1.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 1.0000 0.0000 0.1694 0.0510 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.1186 0.0371 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 1.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.1694 0.0000 1.0000 0.2748 0.0286 0.2232 0.2697 0.1424 0.0000 0.0000 0.2443 0.2312 0.0000 0.1602 0.0000 0.0000 0.2273 0.1699
-0.0000 0.0000 0.0000 0.0510 0.0000 0.2748 1.0000 0.0480 0.0627 0.0761 0.0432 0.0000 0.0000 0.2907 0.1857 0.0000 0.0543 0.0000 0.0000 0.0737 0.0517
-0.0492 0.0000 0.0000 0.0000 0.0000 0.0286 0.0480 1.0000 0.0520 0.0000 0.0634 0.0000 0.0739 0.1664 0.1848 0.1117 0.0370 0.2022 0.0739 0.2066 0.1055
-0.0000 0.0000 0.0000 0.0000 0.0000 0.2232 0.0627 0.0520 1.0000 0.0000 0.0000 0.0000 0.0000 0.1581 0.0518 0.0000 0.0000 0.0597 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.2697 0.0761 0.0000 0.0000 1.0000 0.0000 0.0000 0.0000 0.2148 0.0595 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.1424 0.0432 0.0634 0.0000 0.0000 1.0000 0.0000 0.0000 0.1091 0.0304 0.0000 0.0000 0.0391 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0739 0.0000 0.0000 0.0000 0.0000 1.0000 0.0000 0.0000 0.0000 0.0000 0.1010 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.1186 0.0000 0.2443 0.2907 0.1664 0.1581 0.2148 0.1091 0.0000 0.0000 1.0000 0.2803 0.0000 0.1291 0.0000 0.0000 0.2894 0.1543
-0.0000 0.0000 0.0000 0.0371 0.0000 0.2312 0.1857 0.1848 0.0518 0.0595 0.0304 0.0000 0.0000 0.2803 1.0000 0.0000 0.0375 0.0560 0.0000 0.2090 0.0748
-0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.1117 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1.0000 0.0000 0.0830 0.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.1602 0.0543 0.0370 0.0000 0.0000 0.0000 0.0000 0.0000 0.1291 0.0375 0.0000 1.0000 0.0000 0.0000 0.0000 0.0000
-0.2353 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.2022 0.0597 0.0000 0.0391 0.0000 0.1010 0.0000 0.0560 0.0830 0.0000 1.0000 0.0000 0.0000 0.2176
-0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0739 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1.0000 0.0000 0.0000
-0.0000 0.0000 0.0000 0.0000 0.0000 0.2273 0.0737 0.2066 0.0000 0.0000 0.0000 0.0000 0.0000 0.2894 0.2090 0.0000 0.0000 0.0000 0.0000 1.0000 0.0650
-0.2182 0.0000 0.0000 0.0000 0.0000 0.1699 0.0517 0.1055 0.0000 0.0000 0.0000 0.0000 0.0000 0.1543 0.0748 0.0000 0.0000 0.2176 0.0000 0.0650 1.0000

static/sentence_similarity_graph.gnuplot

@@ -1,77 +0,0 @@
-# Copyright 2019 sillydan1
-# Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-# The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-# Sentence similarity graph plotter
-# uncomment this for manual operation of the dataset plotted
-# my_dataset = "./sentence_similarities.csv" # ARG1
-set parametric
-set size square
-
-# Styling
-set pointsize 7.5
-set style fill solid 1.0 border rgb 'grey30'
-set style line 1 lc rgb 'black' pt 6 lw 0.5
-
-# Basically a one-dimensional circular coordinate system
-fx(t) = cos(t)
-fy(t) = sin(t)
-rownum = floor(system("wc -l ".my_dataset."")) +1
-coord(k) = (k/real(rownum))*(2*pi)
-fxx(t) = cos(coord(t))
-fyy(t) = sin(coord(t))
-
-set trange [0:2*pi-(coord(1.0))]
-set sample rownum
-set noborder
-unset tics
-set xrange [-1.2:1.2]
-set yrange [-1.2:1.2]
-set title "Sentence inter-similarity graph"
-set multiplot
-refloptimization = 0
-do for [i = 0:rownum-1] {
-	do for [j = refloptimization:rownum-1] {
-		if (i != j) {
-			# Get how many columns there are in the dataset.
-			arrwidth = real(system("awk 'FNR == ".(i+1)." {print $".(j+1)."}' ".my_dataset.""))
-			if (arrwidth > 0.0) {
-				bubblerad = 0.125
-				x1 = fxx(i)
-				y1 = fyy(i)
-				x2 = fxx(j)
-				y2 = fyy(j)
-				
-				dvx = x2-x1
-				dvy = y2-y1
-				dvl = sqrt((dvx ** 2) + (dvy ** 2))
-				x1 = x1 + (dvx/dvl)*bubblerad
-				y1 = y1 + (dvy/dvl)*bubblerad
-				x2 = x2 - (dvx/dvl)*bubblerad
-				y2 = y2 - (dvy/dvl)*bubblerad
-				# Overleaf's arrow-width rendering is pretty terrible, 
-				# so we use a color-gradient to determine connection-strength.
-				if (arrwidth > 0.2) { 
-					col = "#000000" 
-				} else { 
-					if (arrwidth < 0.1) { 
-						col = "#B8B8B8"
-					} else { 
-						col = "#E4E4E4" 
-					} 
-				}
-				
-				set arrow "".i.j."" from x1,y1 to x2,y2 nohead lw 0.5 lc rgb col
-				#set label "H" at (fxx(j)-fxx(i)),(fyy(j)-fyy(i))
-				show arrow "".i.j.""
-			}
-		}
-	}
-	refloptimization = refloptimization + 1
-}
-# Plot the circles
-plot '+' u (fx(t)):(fy(t)) w p ls 1 notitle
-
-# Plot the sentence labels
-plot '+' u (fx(t)):(fy(t)):(sprintf("s.%d",$0+1)) with labels notitle