<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.logic.world/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=GHXX</id>
	<title>Logic World Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.logic.world/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=GHXX"/>
	<link rel="alternate" type="text/html" href="https://wiki.logic.world/wiki/Special:Contributions/GHXX"/>
	<updated>2026-05-15T13:48:42Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wiki.logic.world/index.php?title=User:NellieScholz6&amp;diff=893</id>
		<title>User:NellieScholz6</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=User:NellieScholz6&amp;diff=893"/>
		<updated>2026-03-29T14:36:44Z</updated>

		<summary type="html">&lt;p&gt;GHXX: removed external link as you have not made any contributions and are advertising an external service&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hｅllo, I&#039;m Nellie, a 25 year old fr᧐m Le Havre, Frɑnce.&amp;lt;br&amp;gt;My hobbies incluɗe (but are not limited to) Climbing, Canoeing and watching Modern Family.&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=890</id>
		<title>Mods talk:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=890"/>
		<updated>2026-03-17T19:42:40Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fix indent&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Mods list (moved from Talk: Your First Computer) ==&lt;br /&gt;
&#039;&#039;Moved by [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:36, 17 March 2026 (UTC)&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:We will provide an official mod portal down the road. That way we can offer some features that third party mod websites cannot. For now most people use github for hosting the source which is also easily loadable in logicworld. Though there is a mod manager maintained by a community member, but i havent tried it yet: https://discord.com/channels/401255675264761866/1431623621843095622 [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:41, 17 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=889</id>
		<title>Mods talk:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=889"/>
		<updated>2026-03-17T19:41:53Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Mods list (moved from Talk: Your First Computer) */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Mods list (moved from Talk: Your First Computer) ==&lt;br /&gt;
&#039;&#039;Moved by [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:36, 17 March 2026 (UTC)&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;br /&gt;
::We will provide an official mod portal down the road. That way we can offer some features that third party mod websites cannot. For now most people use github for hosting the source which is also easily loadable in logicworld. Though there is a mod manager maintained by a community member, but i havent tried it yet: https://discord.com/channels/401255675264761866/1431623621843095622 [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:41, 17 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=888</id>
		<title>Mods talk:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=888"/>
		<updated>2026-03-17T19:39:39Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Mods list (moved f rom Talk: Your First Computer) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Mods list (moved from Talk: Your First Computer) ==&lt;br /&gt;
&#039;&#039;Moved by [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:36, 17 March 2026 (UTC)&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Your_First_Computer&amp;diff=887</id>
		<title>Talk:Your First Computer</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Your_First_Computer&amp;diff=887"/>
		<updated>2026-03-17T19:39:20Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Mods list */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Discussing the article ==&lt;br /&gt;
&lt;br /&gt;
Hi.&lt;br /&gt;
The article must clearly explain that CPU designs can be very different.&lt;br /&gt;
It&#039;s better to start with showing different possibilities and then building one of the easiest variant.&lt;br /&gt;
Here and now I&#039;m talking about the current explanation with ROM and the specific IS. It&#039;s not clear that this is only one option and it&#039;s not even the most flexible due to ROM. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 14:46, 11 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Mods list ==&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;br /&gt;
::Indeed, lets continue here: https://wiki.logic.world/wiki/Mods_talk:Introduction [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:39, 17 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=886</id>
		<title>Mods talk:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=886"/>
		<updated>2026-03-17T19:38:15Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Mods list (moved f rom Talk: Your First Computer) ==&lt;br /&gt;
&#039;&#039;Moved by [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:36, 17 March 2026 (UTC)&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=885</id>
		<title>Mods talk:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods_talk:Introduction&amp;diff=885"/>
		<updated>2026-03-17T19:36:54Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Mods list (moved f rom Talk: Your First Computer) */ moved from Talk: Your First Computer&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Mods list (moved f rom Talk: Your First Computer) ==&lt;br /&gt;
&lt;br /&gt;
Create a “Mods” section that lists mods “approved or verified by the community,” and provide download links (such as Cursforge or Modrinth) along with their dependencies to make them easier to use in the game. [[User:Lubou 99|Lubou 99]] ([[User talk:Lubou 99|talk]]) 19:12, 15 March 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
:I don&#039;t think Jimmy will ever use CurseForge or Modrinth for Logic World. In my opinion, he would probably use the Logic World website for modding, like the creation hub.&lt;br /&gt;
:Also, why is this in the &amp;quot;Your First Computer&amp;quot; discussion? [[User:FoxFireFive|FoxFireFive]] ([[User talk:FoxFireFive|talk]]) 06:10, 16 March 2026 (UTC)&lt;br /&gt;
[[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 19:36, 17 March 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Dedicated_Server_Setup_Guide&amp;diff=803</id>
		<title>Dedicated Server Setup Guide</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Dedicated_Server_Setup_Guide&amp;diff=803"/>
		<updated>2025-12-04T01:06:07Z</updated>

		<summary type="html">&lt;p&gt;GHXX: dedicated server is now accessible anonymously&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
The Logic World Dedicated Server (LWDS) allows [[Disciples of Bobby]] to create circuits together.&lt;br /&gt;
[[File:Logo alt square.png|thumb|Icon for Logic World Dedicated Server]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Required Specs ==&lt;br /&gt;
&lt;br /&gt;
The required machine to run a Logic World server depends a lot on the complexity and amount of circuits you build in the world and how many players will be using it at the same time.&lt;br /&gt;
&lt;br /&gt;
For a couple of players, a 4gb server is plenty. &lt;br /&gt;
&lt;br /&gt;
== Linux (Ubuntu) ==&lt;br /&gt;
&lt;br /&gt;
This guide assumes the following:&lt;br /&gt;
* Ubuntu 24.04 has been freshly installed.&lt;br /&gt;
* The server has a public IP Address&lt;br /&gt;
&lt;br /&gt;
==== Update and Install Packages ====&lt;br /&gt;
&lt;br /&gt;
Enable 32-bit packages&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo dpkg --add-architecture i386&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Enable multiverse repositories&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo add-apt-repository multiverse&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
These two commands allow steamcmd to be installed which is the tool used to install the Logic world server software.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Update the system&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo apt-get update&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo apt-get upgrade -y --no-install-recommends&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
These update your package manager and install updates for any installed packages.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Install new packages&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo apt-get install -y --no-install-recommends steamcmd screen ufw&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;steamcmd&amp;lt;/code&amp;gt; is used to install Logic world.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;screen&amp;lt;/code&amp;gt; is used to keep Logic World running even if you close the terminal.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;ufw&amp;lt;/code&amp;gt; is used to control the firewall.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Allow connections for Logic World in the firewall&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo ufw allow 43531/udp&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== Setup a Logic World User ====&lt;br /&gt;
We are now going to create a user that will run the logic world server.&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Create the user:&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo adduser logicworld&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
This is start a wizard to guide you through creating the user, the only important setting is the password, all other settings can be left blank.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Switch to the User:&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sudo su logicworld&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
This command will make you the new user you just created. If you would like to switch back to your initial user type &amp;lt;code&amp;gt;exit&amp;lt;/code&amp;gt;. For now, stay as the logicworld user, all the following commands need to be run by them.&lt;br /&gt;
&lt;br /&gt;
==== Install Logic World Server ====&lt;br /&gt;
&lt;br /&gt;
Make sure you are currently in your home directory.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;cd&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Create a directory where we can install logic world.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;mkdir -p /home/logicworld/logic_world/logic_world_ds/&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Everything for Logic World will be placed in the logic_world folder, logic_world_ds will contain the logic world server software.&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Use steamcmd to install the Logic World server, simply use &amp;lt;i&amp;gt;anonymous&amp;lt;/i&amp;gt; as the username.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;steamcmd +force_install_dir /home/logicworld/logic_world/logic_world_ds/ +login anonymous +app_update 1252670 validate +quit&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
If you want to run the exciting but unstable public-preview version of Logic World, run the following command instead of the previous one&lt;br /&gt;
&amp;lt;code&amp;gt;steamcmd +force_install_dir /home/logicworld/logic_world/logic_world_ds/ +login anonymous +app_update 1252670 -beta public-previews validate +quit&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Make sure all connecting clients are also running public preview or they will be unable to connect.&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== Configure your new Server ====&lt;br /&gt;
&lt;br /&gt;
Create a shortcut to the Gamedata folder&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;ln -s /home/logicworld/logic_world/logic_world_ds/GameData/ /home/logicworld/logic_world/GameData&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Change the default password.&amp;lt;br&amp;gt;&lt;br /&gt;
This command will change the password to &amp;lt;code&amp;gt;12345678&amp;lt;/code&amp;gt;, modify this to set your own password.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;sed -i &#039;s/this is a very secure password/12345678/g&#039; ~/logic_world/logic_world_ds/config.jecs&amp;lt;/code&amp;gt;&lt;br /&gt;
The config file is located at &amp;lt;code&amp;gt;~/logic_world/logic_world_ds/config.jecs&amp;lt;/code&amp;gt; you can use vim or nano if you want to customize it further.&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== Create Management Scripts ====&lt;br /&gt;
&lt;br /&gt;
Create the start up script&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;printf &amp;quot;#!/usr/bin/env bash\n\nscreen -L -m -d -S lwserver Server/Server\n&amp;quot; &amp;gt; ~/start_lw_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Make it executable&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;chmod +x ~/start_lw_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Create the update script&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;printf &amp;quot;#!/usr/bin/env bash\n\nsteamcmd +force_install_dir /home/logicworld/logic_world/logic_world_ds/ +login anonymous +app_update 1252670 validate +quit\n&amp;quot; &amp;gt; ~/update_logic_world_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Or, it you are using the public-preview version use this to command instead.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;printf &amp;quot;#!/usr/bin/env bash\n\nsteamcmd +force_install_dir /home/logicworld/logic_world/logic_world_ds/ +login anonymous +app_update 1252670 -beta public-previews validate +quit\n&amp;quot; &amp;gt; ~/update_logic_world_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Make the update script executable&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;chmod +x ~/update_logic_world_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== Start the Server ====&lt;br /&gt;
To start your new server run this command.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;./start_lw_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
This will start the server in the background, if you are able to connect to the server with your Logic World game you can now disconnect from the server.&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
If you need to log in again to make changes make sure to run &amp;lt;code&amp;gt;sudo su logicworld&amp;lt;/code&amp;gt; to switch to your user then run &amp;lt;code&amp;gt;cd&amp;lt;/code&amp;gt; to go to your home directory.&amp;lt;br&amp;gt;&lt;br /&gt;
From here you can:&amp;lt;br&amp;gt;&lt;br /&gt;
Start the server: &amp;lt;code&amp;gt;./start_lw_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Update the server: &amp;lt;code&amp;gt;./update_logic_world_server.sh&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
View the output of the running server: &amp;lt;code&amp;gt;screen -r&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
To stop viewing the running server output press &amp;lt;code&amp;gt;ctrl+a&amp;lt;/code&amp;gt; then press &amp;lt;code&amp;gt;d&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
If you would like to stop the server instead, press &amp;lt;code&amp;gt;ctrl+c&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt; while viewing the output.&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Edge_Detection&amp;diff=782</id>
		<title>Edge Detection</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Edge_Detection&amp;diff=782"/>
		<updated>2025-10-17T17:01:16Z</updated>

		<summary type="html">&lt;p&gt;GHXX: Tweak wording a bit&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Edge detection&#039;&#039;&#039; is the process of sending a signal at the moment a signal transitions.&lt;br /&gt;
&lt;br /&gt;
A &#039;&#039;&#039;rising edge&#039;&#039;&#039; refers to the instant when a signal changes from &#039;&#039;off&#039;&#039; to &#039;&#039;on&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
A &#039;&#039;&#039;falling edge&#039;&#039;&#039; refers to the instant when a signal changes from &#039;&#039;on&#039;&#039; to &#039;&#039;off&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
== Construction ==&lt;br /&gt;
[[File:Raising-edge-detector.png|thumb|right|alt=Raising edge detector|Raising edge detector]]&lt;br /&gt;
You can detect a rising edge by checking whether the input signal was &#039;&#039;off&#039;&#039; some number of [[Tick|ticks]] ago but is now &#039;&#039;on&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
This can be done using an [[AND Gate]] and an [[Inverter]].  &lt;br /&gt;
Connect one input of the AND gate directly to your signal, and connect the other input through the inverter.&lt;br /&gt;
&lt;br /&gt;
When the input signal turns on, the direct input to the AND gate is immediately on. The inverter output, however, is delayed by 1 tick, so it remains &#039;&#039;on&#039;&#039; for one more tick.  &lt;br /&gt;
Since both inputs of the AND gate are &#039;&#039;on&#039;&#039;, it becomes marked for activation in the next tick.&lt;br /&gt;
&lt;br /&gt;
On the next tick, the AND gate turns &#039;&#039;on&#039;&#039; while the inverter output turns &#039;&#039;off&#039;&#039;. At this point, not all AND gate inputs are &#039;&#039;on&#039;&#039;, so it will be marked to turn &#039;&#039;off&#039;&#039; on the following tick.&lt;br /&gt;
&lt;br /&gt;
The pulse length is determined by the delay between the direct and inverted inputs of the AND gate.  &lt;br /&gt;
You can extend the pulse to 2 ticks using a [[Buffer]], or make it 2 ticks or longer with a [[Delayer]].&lt;br /&gt;
&lt;br /&gt;
== Example Signal Diagram ==&lt;br /&gt;
Below is an example timing diagram showing how a rising edge detector behaves:&lt;br /&gt;
* &#039;&#039;&#039;Input&#039;&#039;&#039; shows the original signal toggling between off and on.&lt;br /&gt;
* &#039;&#039;&#039;Output&#039;&#039;&#039; is the short pulse generated on each rising edge of the input signal.&lt;br /&gt;
&lt;br /&gt;
{{Binary signal&lt;br /&gt;
| signals=Input, Output&lt;br /&gt;
| signal1=000011110000111&lt;br /&gt;
| signal2=000010000000100&lt;br /&gt;
}}{{Note|NOTE: This diagram is simplified for educational purposes. While this diagram suggests that the output turns on immediately when the input turns on, in reality, logic gates create a delay, and the output signal will lag behind the input signal by at least one tick.}}&lt;br /&gt;
&lt;br /&gt;
How it looks in the Logic World:&lt;br /&gt;
[[File:edge-oscillator.png|frame|center|alt=oscilloscope|Raising Edge on oscilloscope ]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Edge_Detection&amp;diff=765</id>
		<title>Talk:Edge Detection</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Edge_Detection&amp;diff=765"/>
		<updated>2025-10-07T18:54:33Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Edge detection circuit diagram output is not delayed */ new section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Edge detection circuit diagram output is not delayed ==&lt;br /&gt;
&lt;br /&gt;
@[[User:N00basaurus|N00basaurus]], in the circuit diagram you show (not lw), the output immediately becomes 1 as soon as the input becomes 1, whereas in logicworld the behaviour would be a bit different, in that the output would be delayed by one tick. I&#039;d propose delaying the output by 1 tick in the diagram to not &#039;bait&#039; people into thinking they could build such a circuit even though they cannot. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 18:54, 7 October 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Control_Unit&amp;diff=764</id>
		<title>Control Unit</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Control_Unit&amp;diff=764"/>
		<updated>2025-10-07T18:49:55Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fixed minor spelling&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;; &#039;&#039;&#039;Control Unit&#039;&#039;&#039;&lt;br /&gt;
: In &#039;&#039;Logic World&#039;&#039;, a &#039;&#039;&#039;Control Unit&#039;&#039;&#039; (&#039;&#039;&#039;CU&#039;&#039;&#039;) is a composite component designed to generate and coordinate control signals for other circuits.  &lt;br /&gt;
: Its primary functions are:&lt;br /&gt;
# To produce ordered sequences of control signals over time&lt;br /&gt;
# To provide a convenient interface that prevents mistaken combinations of control signals&lt;br /&gt;
&lt;br /&gt;
== Overview ==&lt;br /&gt;
&lt;br /&gt;
All computers, however complex, are built on a fundamental idea: changing from one state to another state.&lt;br /&gt;
By sequencing control signals in various combinations, any computation can be achieved.&lt;br /&gt;
&lt;br /&gt;
Each transfer of information inside the computer requires one &#039;&#039;read&#039;&#039; signal and one &#039;&#039;write&#039;&#039; signal.  &lt;br /&gt;
For example, transferring information from one [[Register]] to another involves first activating the read signal on the source register, then the write signal on the destination register.  &lt;br /&gt;
The control unit is responsible for generating these signals in the correct order.&lt;br /&gt;
&lt;br /&gt;
More elaborate control sequences, such as performing operations on data or displaying results on a [[Display]], are similarly coordinated by the control unit.&lt;br /&gt;
&lt;br /&gt;
A control unit can adjusts its sequence of control signals based on different input conditions.  &lt;br /&gt;
These inputs typically originate from other components such as the [[Instruction Register]], [[Status Register]], or various system flags.  &lt;br /&gt;
By interpreting these inputs, the control unit can &amp;quot;execute an instruction&amp;quot; - dynamically altering its control signal sequence according to the contents of the instruction register.&lt;br /&gt;
&lt;br /&gt;
The control unit may also update the instruction register by fetching new data from memory.  &lt;br /&gt;
This operation, known as an &#039;&#039;instruction fetch&#039;&#039;, is part of the core fetch → decode → execute cycle present in virtually all computer architectures.  &lt;br /&gt;
The overall timing of these operations is usually governed by a [[Clock]].&lt;br /&gt;
&lt;br /&gt;
== Implementation ==&lt;br /&gt;
&lt;br /&gt;
=== Pipelined Computers ===&lt;br /&gt;
In [[Pipelined Computer|pipelined computer]] architectures, control signals are often generated using a series of shift registers.  &lt;br /&gt;
Each register passes its state to the next on the [[Edge Detection|rising edge]] of the clock.  &lt;br /&gt;
Each stage of the pipeline corresponds to one register and produces its control signals through devices such as [[Decoder]]s, [[Lookup Table]]s, [[Programmable Logic Array|PLAs]], or [[ROM]]s.  &lt;br /&gt;
As new states are shifted through the pipeline, each stage updates its control signals accordingly.&lt;br /&gt;
&lt;br /&gt;
=== Sequential Computers ===&lt;br /&gt;
For non-pipelined (sequential) computers, control logic is generally more complex.  &lt;br /&gt;
While a simple design can use a [[Counter]] and a [[ROM]] to step through predefined control sequences, systems that require conditional branching or loops typically implement their control unit as a [[Finite State Machine]] (FSM).  &lt;br /&gt;
This approach allows for flexible control flow and dynamic sequencing based on internal and external conditions.&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=User:GHXX&amp;diff=666</id>
		<title>User:GHXX</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=User:GHXX&amp;diff=666"/>
		<updated>2025-09-11T02:53:05Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Kinda just making this so the link isn&#039;t red anymore, but yeah, I like math, and the wiki supports it.&lt;br /&gt;
&lt;br /&gt;
So enjoy this funny formula: &amp;lt;div style=&amp;quot;font-size: xx-large;&amp;quot;&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;\bold{W}_{t+1}=\bold{W}_t - \eta \nabla_\bold{W}\lVert f(\bold{X}; \bold{W}_t) - \bold{y}\rVert_2 &amp;lt;/math&amp;gt;&amp;lt;/div&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=User:GHXX&amp;diff=645</id>
		<title>User:GHXX</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=User:GHXX&amp;diff=645"/>
		<updated>2025-09-10T16:10:03Z</updated>

		<summary type="html">&lt;p&gt;GHXX: funny profile with funny formula&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Kinda just making this so the link isn&#039;t red anymore, but yeah, I like math, and the wiki supports it.&lt;br /&gt;
&lt;br /&gt;
So enjoy this funny formula: &amp;lt;div style=&amp;quot;font-size: xx-large;&amp;quot;&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;\bold{W}_{t+1}=\bold{W}_t - \eta \nabla_\bold{W}\lVert f(\bold{X}; \bold{W}_t) - \bold{b}\rVert_2 &amp;lt;/math&amp;gt;&amp;lt;/div&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=507</id>
		<title>Mods:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=507"/>
		<updated>2025-09-08T22:19:09Z</updated>

		<summary type="html">&lt;p&gt;GHXX: unify url format&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
[[Logic World]] currently features &#039;&#039;&#039;unofficial&#039;&#039;&#039; first-party modification (mod) support, this means, the Logic World client / server will load &amp;amp; compile mods, and while this will most likely be maintained, it might be lacking some quality of life features, and the API may undergo heavy changes. Though, this does &#039;&#039;&#039;not&#039;&#039;&#039; mean that every game update will break the game.&lt;br /&gt;
&lt;br /&gt;
Of course the probability of a mod breaking depends on how deep you are interfacing with the game; if you are simply adding components it is likely that updating the mod will be very easy or not even necessary.&lt;br /&gt;
&lt;br /&gt;
There are currently two built-in ways of adding components to the game:&lt;br /&gt;
&lt;br /&gt;
== C# ==&lt;br /&gt;
This allows you to edit nearly all game code, and thus there is almost no limit to what can be achieved. Most mods are currently written this way, and thus you will find many pre-existing that you could base your mod off of. If you are already familiar with programming, with C, C++, Java, or with C# itself, it should be very easy to pick up the concepts. But even in case you are not, it should be fairly easy to just tweak an existing mod and pick up the language that way.&lt;br /&gt;
&lt;br /&gt;
The initial setup consists of creating a manifest.jecs&amp;lt;ref&amp;gt;Formerly, &amp;lt;code&amp;gt;.jecs&amp;lt;/code&amp;gt; files used the &amp;lt;code&amp;gt;.succ&amp;lt;/code&amp;gt; file-extension.&amp;lt;/ref&amp;gt; file, along with any required folders. This initial structure could look like, as follows, though empty folders can be omitted:&lt;br /&gt;
 YourMod/ &amp;lt;-- This folder (&#039;&#039;&#039;not&#039;&#039;&#039; its contents) is supposed to be placed into the GameData folder when installing the mod&lt;br /&gt;
  manifest.jecs&lt;br /&gt;
  components/&lt;br /&gt;
   &amp;lt;.jecs component files&amp;gt; &amp;lt;-- these files define the actual component shapes, colors, peg counts and reference the C# code, if desired&lt;br /&gt;
  languages/&lt;br /&gt;
   English/&lt;br /&gt;
    English.jecs &amp;lt;-- Translation files simply map an internal name, e.g. author.modname.componentname to a human readable name, e.g. And Gate; See the MHG basemod for a complete list of supported languages.&lt;br /&gt;
   French/&lt;br /&gt;
    French.jecs&lt;br /&gt;
   &amp;lt;other language folders&amp;gt;&lt;br /&gt;
  src/ &amp;lt;-- (indirectly) contains all C# source files, which will be compiled when starting the game&lt;br /&gt;
   client/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
   server/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+Examples to base your mod off of&lt;br /&gt;
!Mod Name&lt;br /&gt;
!Description&lt;br /&gt;
!Link&lt;br /&gt;
!License&lt;br /&gt;
|-&lt;br /&gt;
|MHG (basemod)&lt;br /&gt;
|The Logic World base mod which contains most game content.&lt;br /&gt;
|Located in your &amp;lt;code&amp;gt;Logic World/GameData&amp;lt;/code&amp;gt; folder&lt;br /&gt;
|All Rights Reserved&lt;br /&gt;
|-&lt;br /&gt;
|Basic Logic World Mod&lt;br /&gt;
|Adds a basic NAND Gate component to Logic World.&lt;br /&gt;
|[https://github.com/FoxFireFive0135/Basic-Logic-World-Mod/tree/main https://github.com/FoxFireFive0135/Basic-Logic-World-Mod]&lt;br /&gt;
|MIT&lt;br /&gt;
|-&lt;br /&gt;
|Tcp Bridge&lt;br /&gt;
|Adds a component supporting real-world tcp connections. Farily complex, but shows off using threads within components.&lt;br /&gt;
|https://github.com/GHXX/LogicWorld-TcpBridge&lt;br /&gt;
|MIT&lt;br /&gt;
|}&lt;br /&gt;
{{Todo|List more mods that perform various actions, e.g. adding a basic component that uses dynamic pegs, like the vanilla AND gate; one that adds custom UI; maybe one for adding chat commands or something; etc.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logic Script ==&lt;br /&gt;
This is an alternative way which requires less programming knowledge, but is much more limited.&lt;br /&gt;
{{Todo|describe logic script}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=432</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=432"/>
		<updated>2025-09-07T22:52:33Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Improve further */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
:@[[User:GHXX|GHXX]], yes to all, except one thing. Why LUTs should output only a single bit? I thought using it to produce a pattern of bits is a common application. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 20:45, 7 September 2025 (UTC)&lt;br /&gt;
::@[[User:DjSapsan|DjSapsan]], No, usually it only produces one output bit (&amp;lt;math&amp;gt;Output1&amp;lt;/math&amp;gt;), because all those chains get OR ed together, and unless the other output (&amp;lt;math&amp;gt;Output2&amp;lt;/math&amp;gt;)) can be computed by &amp;lt;math&amp;gt;Output2 = Output1 \quad OR \quad (other chains)&amp;lt;/math&amp;gt;, there is no way of computing that other output, as far as i am aware. &lt;br /&gt;
::I suppose you could maybe re-use the intermediate NOT outputs, but that is far from the general case from my experience. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:55, 7 September 2025 (UTC)&lt;br /&gt;
:::@[[User:GHXX|GHXX]] I&#039;m so sorry, I keep merging this &amp;quot;optimized&amp;quot; LUT with a &amp;quot;full&amp;quot; LUT in mind.&lt;br /&gt;
::: By &amp;quot;full&amp;quot; LUT, I mean essentially a decoder.&lt;br /&gt;
::: We need to sort this out.&lt;br /&gt;
::: The article talks about building a LUT only for true outputs. Thanks for reminding me, that the logic for non-true outputs is absent.&lt;br /&gt;
::: But the &amp;quot;full&amp;quot; LUT has a logic for every single input combination (even if the corresponding output is off).&lt;br /&gt;
::: &amp;lt;br&amp;gt;&lt;br /&gt;
::: So... should we make two versions? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:02, 7 September 2025 (UTC)&lt;br /&gt;
::::@[[User:DjSapsan|DjSapsan]] i think making a separate decoder page, if that name is appropriate ,would make sense; but, wouldnt that in a way be a multiplexer with fixed inputs (possibly using switches) that you are choosing from using address lines?&lt;br /&gt;
::::From my experience a lookup table is always simply used to compute one bit from a set of input bits, encoding an arbitrary logical formula by just listing all inputs that lead to a true output.&lt;br /&gt;
::::I think the architecture of a &amp;quot;full&amp;quot; LUT as you are describing it would be fundamentally different as changing outputs in a normal LUT tends to be really annoying, as you would need to physically add/remove chains and couldnt simply flip a switch. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:09, 7 September 2025 (UTC)&lt;br /&gt;
:::::@[[User:GHXX|GHXX]] Maybe we misunderstand each other a little bit.&lt;br /&gt;
::::: The &amp;quot;full&amp;quot; LUT is 100% equivalent to the &amp;quot;1-bit&amp;quot; LUT. It only adds a possibility to output a pattern of bits (as well as the same 1 bit).&lt;br /&gt;
::::: In my experience, LUTs are used in programming, for example in Lua:&lt;br /&gt;
:::::&amp;lt;code&amp;gt;t = {}&amp;lt;br&amp;gt;t[1] = &amp;quot;logic&amp;quot;&amp;lt;br&amp;gt;t[2] = &amp;quot;world&amp;quot;&amp;lt;/code&amp;gt;&lt;br /&gt;
:::::And in LW, I store characters for multi-segmented displays in LUTs.&lt;br /&gt;
:::::Changing it should be simpler, because it doesn&#039;t require adding/removing parts, only changing the output bits. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:19, 7 September 2025 (UTC)&lt;br /&gt;
::::::hmmmmmmmmmmm i see, in a sense the LUT i am /have-been describing is a special case of that then, as 0 outputs are unnecessary, and that then also avoids needing a circuit after the chains that actually selects the output values (i.e relays or something like that), and thus you get away with just ORing the chains.&lt;br /&gt;
::::::Do you think it might work out to present a more general LUT further down that extends the circuit? (To my experience this specific case is the most common one, because usually a single bit is enough where speed is this necessary (if you can allow for 2 ticks instead of one you can replace the chains with a set of xors and a nand for example, which is a lot more configurable) [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:28, 7 September 2025 (UTC)&lt;br /&gt;
:::::::I suggest to present a general LUT at first and then show the optimized variant and maybe other variants.&lt;br /&gt;
:::::::The article needs to be more direct at showing possible applications, including fast computation of the formula, storing data (effectively ROM) etc.&lt;br /&gt;
:::::::I can write it tomorrow. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:50, 7 September 2025 (UTC)&lt;br /&gt;
::::::::kk, yeah im curious to see/read what the general approach for constructing a general LUT will look like [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:52, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=429</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=429"/>
		<updated>2025-09-07T22:28:10Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Improve further */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
:@[[User:GHXX|GHXX]], yes to all, except one thing. Why LUTs should output only a single bit? I thought using it to produce a pattern of bits is a common application. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 20:45, 7 September 2025 (UTC)&lt;br /&gt;
::@[[User:DjSapsan|DjSapsan]], No, usually it only produces one output bit (&amp;lt;math&amp;gt;Output1&amp;lt;/math&amp;gt;), because all those chains get OR ed together, and unless the other output (&amp;lt;math&amp;gt;Output2&amp;lt;/math&amp;gt;)) can be computed by &amp;lt;math&amp;gt;Output2 = Output1 \quad OR \quad (other chains)&amp;lt;/math&amp;gt;, there is no way of computing that other output, as far as i am aware. &lt;br /&gt;
::I suppose you could maybe re-use the intermediate NOT outputs, but that is far from the general case from my experience. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:55, 7 September 2025 (UTC)&lt;br /&gt;
:::@[[User:GHXX|GHXX]] I&#039;m so sorry, I keep merging this &amp;quot;optimized&amp;quot; LUT with a &amp;quot;full&amp;quot; LUT in mind.&lt;br /&gt;
::: By &amp;quot;full&amp;quot; LUT, I mean essentially a decoder.&lt;br /&gt;
::: We need to sort this out.&lt;br /&gt;
::: The article talks about building a LUT only for true outputs. Thanks for reminding me, that the logic for non-true outputs is absent.&lt;br /&gt;
::: But the &amp;quot;full&amp;quot; LUT has a logic for every single input combination (even if the corresponding output is off).&lt;br /&gt;
::: &amp;lt;br&amp;gt;&lt;br /&gt;
::: So... should we make two versions? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:02, 7 September 2025 (UTC)&lt;br /&gt;
::::@[[User:DjSapsan|DjSapsan]] i think making a separate decoder page, if that name is appropriate ,would make sense; but, wouldnt that in a way be a multiplexer with fixed inputs (possibly using switches) that you are choosing from using address lines?&lt;br /&gt;
::::From my experience a lookup table is always simply used to compute one bit from a set of input bits, encoding an arbitrary logical formula by just listing all inputs that lead to a true output.&lt;br /&gt;
::::I think the architecture of a &amp;quot;full&amp;quot; LUT as you are describing it would be fundamentally different as changing outputs in a normal LUT tends to be really annoying, as you would need to physically add/remove chains and couldnt simply flip a switch. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:09, 7 September 2025 (UTC)&lt;br /&gt;
:::::@[[User:GHXX|GHXX]] Maybe we misunderstand each other a little bit.&lt;br /&gt;
::::: The &amp;quot;full&amp;quot; LUT is 100% equivalent to the &amp;quot;1-bit&amp;quot; LUT. It only adds a possibility to output a pattern of bits (as well as the same 1 bit).&lt;br /&gt;
::::: In my experience, LUTs are used in programming, for example in Lua:&lt;br /&gt;
:::::&amp;lt;code&amp;gt;t = {}&amp;lt;br&amp;gt;t[1] = &amp;quot;logic&amp;quot;&amp;lt;br&amp;gt;t[2] = &amp;quot;world&amp;quot;&amp;lt;/code&amp;gt;&lt;br /&gt;
:::::And in LW, I store characters for multi-segmented displays in LUTs.&lt;br /&gt;
:::::Changing it should be simpler, because it doesn&#039;t require adding/removing parts, only changing the output bits. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:19, 7 September 2025 (UTC)&lt;br /&gt;
::::::hmmmmmmmmmmm i see, in a sense the LUT i am /have-been describing is a special case of that then, as 0 outputs are unnecessary, and that then also avoids needing a circuit after the chains that actually selects the output values (i.e relays or something like that), and thus you get away with just ORing the chains.&lt;br /&gt;
::::::Do you think it might work out to present a more general LUT further down that extends the circuit? (To my experience this specific case is the most common one, because usually a single bit is enough where speed is this necessary (if you can allow for 2 ticks instead of one you can replace the chains with a set of xors and a nand for example, which is a lot more configurable) [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:28, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=427</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=427"/>
		<updated>2025-09-07T22:09:00Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Improve further */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
:@[[User:GHXX|GHXX]], yes to all, except one thing. Why LUTs should output only a single bit? I thought using it to produce a pattern of bits is a common application. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 20:45, 7 September 2025 (UTC)&lt;br /&gt;
::@[[User:DjSapsan|DjSapsan]], No, usually it only produces one output bit (&amp;lt;math&amp;gt;Output1&amp;lt;/math&amp;gt;), because all those chains get OR ed together, and unless the other output (&amp;lt;math&amp;gt;Output2&amp;lt;/math&amp;gt;)) can be computed by &amp;lt;math&amp;gt;Output2 = Output1 \quad OR \quad (other chains)&amp;lt;/math&amp;gt;, there is no way of computing that other output, as far as i am aware. &lt;br /&gt;
::I suppose you could maybe re-use the intermediate NOT outputs, but that is far from the general case from my experience. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:55, 7 September 2025 (UTC)&lt;br /&gt;
:::@[[User:GHXX|GHXX]] I&#039;m so sorry, I keep merging this &amp;quot;optimized&amp;quot; LUT with a &amp;quot;full&amp;quot; LUT in mind.&lt;br /&gt;
::: By &amp;quot;full&amp;quot; LUT, I mean essentially a decoder.&lt;br /&gt;
::: We need to sort this out.&lt;br /&gt;
::: The article talks about building a LUT only for true outputs. Thanks for reminding me, that the logic for non-true outputs is absent.&lt;br /&gt;
::: But the &amp;quot;full&amp;quot; LUT has a logic for every single input combination (even if the corresponding output is off).&lt;br /&gt;
::: &amp;lt;br&amp;gt;&lt;br /&gt;
::: So... should we make two versions? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 22:02, 7 September 2025 (UTC)&lt;br /&gt;
::::@[[User:DjSapsan|DjSapsan]] i think making a separate decoder page, if that name is appropriate ,would make sense; but, wouldnt that in a way be a multiplexer with fixed inputs (possibly using switches) that you are choosing from using address lines?&lt;br /&gt;
::::From my experience a lookup table is always simply used to compute one bit from a set of input bits, encoding an arbitrary logical formula by just listing all inputs that lead to a true output.&lt;br /&gt;
::::I think the architecture of a &amp;quot;full&amp;quot; LUT as you are describing it would be fundamentally different as changing outputs in a normal LUT tends to be really annoying, as you would need to physically add/remove chains and couldnt simply flip a switch. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 22:09, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=401</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=401"/>
		<updated>2025-09-07T20:56:10Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
:@[[User:GHXX|GHXX]], yes to all, except one thing. Why LUTs should output only a single bit? I thought using it to produce a pattern of bits is a common application. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 20:45, 7 September 2025 (UTC)&lt;br /&gt;
::@[[User:DjSapsan|DjSapsan]], No, usually it only produces one output bit (&amp;lt;math&amp;gt;Output1&amp;lt;/math&amp;gt;), because all those chains get OR ed together, and unless the other output (&amp;lt;math&amp;gt;Output2&amp;lt;/math&amp;gt;)) can be computed by &amp;lt;math&amp;gt;Output2 = Output1 \quad OR \quad (other chains)&amp;lt;/math&amp;gt;, there is no way of computing that other output, as far as i am aware. &lt;br /&gt;
::I suppose you could maybe re-use the intermediate NOT outputs, but that is far from the general case from my experience. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:55, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=400</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=400"/>
		<updated>2025-09-07T20:55:27Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Improve further */ Reply&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
:@[[User:GHXX|GHXX]], yes to all, except one thing. Why LUTs should output only a single bit? I thought using it to produce a pattern of bits is a common application. [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 20:45, 7 September 2025 (UTC)&lt;br /&gt;
::No, usually it only produces one output bit (&amp;lt;math&amp;gt;Output1&amp;lt;/math&amp;gt;), because all those chains get OR ed together, and unless the other output (&amp;lt;math&amp;gt;Output2&amp;lt;/math&amp;gt;)) can be computed by &amp;lt;math&amp;gt;Output2 = Output1 \quad OR \quad (other chains)&amp;lt;/math&amp;gt;, there is no way of computing that other output, as far as i am aware. &lt;br /&gt;
::I suppose you could maybe re-use the intermediate NOT outputs, but that is far from the general case from my experience. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:55, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Backpropagation&amp;diff=396</id>
		<title>Template:Backpropagation</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Backpropagation&amp;diff=396"/>
		<updated>2025-09-07T20:43:16Z</updated>

		<summary type="html">&lt;p&gt;GHXX: reword slightly&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;; &#039;&#039;&#039;Backpropagation&#039;&#039;&#039;&lt;br /&gt;
: In &#039;&#039;Logic World&#039;&#039;, &#039;&#039;&#039;Backpropagation&#039;&#039;&#039; is an undesired propagation of a signal from an output back into an input. It can be the cause of obscure logic bugs that are often difficult to diagnose.&lt;br /&gt;
&lt;br /&gt;
[[File:Backpropagation.png|frame|alt=Backpropagation|An example of backpropagation: a signal from one button going to a gate, but then travels to the unrelated input and activates the wrong lamp.]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template_talk:Backpropagation&amp;diff=394</id>
		<title>Template talk:Backpropagation</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template_talk:Backpropagation&amp;diff=394"/>
		<updated>2025-09-07T20:41:39Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Move to full wiki page? ==&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]]&lt;br /&gt;
&lt;br /&gt;
Does it make sense for this to be a template? I feel it would be much nicer to have it be its own wiki page and then link to it rather than including it in the relevant articles. (if so, i can move it over) [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:41, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template_talk:Backpropagation&amp;diff=393</id>
		<title>Template talk:Backpropagation</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template_talk:Backpropagation&amp;diff=393"/>
		<updated>2025-09-07T20:41:17Z</updated>

		<summary type="html">&lt;p&gt;GHXX: /* Move to full wiki page? */ new section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Move to full wiki page? ==&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]]&lt;br /&gt;
&lt;br /&gt;
Does it make sense for this to be a template? I feel it would be much nicer to have it be its own wiki page and then link to it rather than including it in the relevant articles. [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:41, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=391</id>
		<title>Talk:Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Talk:Lookup_Table&amp;diff=391"/>
		<updated>2025-09-07T20:31:56Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Improve further ==&lt;br /&gt;
&lt;br /&gt;
Hi @[[User:GHXX|GHXX]] and hi all, I made a change to the article to make it simpler and clearer.&lt;br /&gt;
However, I suspect it needs some improvements. &lt;br /&gt;
How it can be improved in terms of phrasing and/or additional information ? [[User:DjSapsan|DjSapsan]] ([[User talk:DjSapsan|talk]]) 17:36, 7 September 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
@[[User:DjSapsan|DjSapsan]],&lt;br /&gt;
&lt;br /&gt;
Imo we should add that the AND-inputs may also be negated.&lt;br /&gt;
&lt;br /&gt;
And that a lut can only output a single bit, in the general case, and not a batch of outputs (instead of &#039;The output may be a single bit or a pattern of bits.&#039;)&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;we can avoid delays by not using buffers&amp;quot; paragraph should imo be replaced with one that states that the not-inputs are generally fed through a fastbuffer first, so that no backpropagation happens.&lt;br /&gt;
&lt;br /&gt;
Lmk what you think, please [[User:GHXX|GHXX]] ([[User talk:GHXX|talk]]) 20:31, 7 September 2025 (UTC)&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=269</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=269"/>
		<updated>2025-09-07T01:28:33Z</updated>

		<summary type="html">&lt;p&gt;GHXX: remove styleguide link for now as that conflicts with the guide-to-contributing page&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Welcome to the Logic World Wiki. This wiki is dedicated anything and everything related to [[Logic World]], a video game where you can invent a new computer!&lt;br /&gt;
&lt;br /&gt;
We only just started the wiki and it doesn&#039;t have a lot of content yet. You can help by editing pages and creating new pages.&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
* [https://logic.world Logic World home page]&lt;br /&gt;
* [https://store.steampowered.com/app/1054340/Logic_World/ Logic World on Steam]&lt;br /&gt;
* [https://discord.gg/C5Qkk53 Logic World Discord]&lt;br /&gt;
&lt;br /&gt;
== Featured articles ==&lt;br /&gt;
&lt;br /&gt;
* [[Logic World Wiki:Contributing|Guide to contributing]]&lt;br /&gt;
* [[Modding:Introduction|Modding introduction]]&lt;br /&gt;
* [[Dedicated Server Setup Guide]]&lt;br /&gt;
&amp;lt;!--* [[Wiki Style Guide]]--&amp;gt;&lt;br /&gt;
* [[Lookup Table]]&lt;br /&gt;
* [[:Category:Components]]&lt;br /&gt;
&lt;br /&gt;
== Stats ==&lt;br /&gt;
&lt;br /&gt;
The wiki has:&lt;br /&gt;
&lt;br /&gt;
* {{NUMBEROFARTICLES}} articles&lt;br /&gt;
* {{NUMBEROFUSERS}} registered users&lt;br /&gt;
* {{NUMBEROFEDITS}} total edits&lt;br /&gt;
&lt;br /&gt;
For more, see [[Special:Statistics]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Panel_Display&amp;diff=152</id>
		<title>Panel Display</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Panel_Display&amp;diff=152"/>
		<updated>2025-09-06T23:32:07Z</updated>

		<summary type="html">&lt;p&gt;GHXX: rename redlink, fix minor spelling&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The &#039;&#039;&#039;Panel Display&#039;&#039;&#039; is one of five components that can only be placed through [[Circuit_Board|circuit boards]]. The Panel Display is generally used analogously to the [[Display]] component, but due to the fact its input peg is on the other side of a panel, it is often used to hide internal wiring in displays.&lt;br /&gt;
&lt;br /&gt;
The Panel Display is about &amp;lt;math&amp;gt;2 \frac{1}{6}&amp;lt;/math&amp;gt;tiles long, 1 tile in width, and 1 tile in height (65cm by 30cm by 30cm, see [[Measurements|in-game measurements]]).&amp;lt;!-- TODO: create and link an in-game measurements article --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Behaviour ==&lt;br /&gt;
When a Panel Display is configured to have a single input, the color of its display is blank when its input is &#039;&#039;&#039;off&#039;&#039;&#039;, and colored when its input is &#039;&#039;&#039;on&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
When a Panel Display is configured to have multiple inputs, the color of its display is blank when all inputs are &#039;&#039;&#039;off&#039;&#039;&#039;, and a color determined by its [[palette]] when any of its inputs are on. The inputs are read as a binary number, where the shortest input peg is the least significant bit, and the longest input peg is the most significant, this number then corresponds to the index in its specified [[Palette|color palette]].&lt;br /&gt;
&lt;br /&gt;
== Timing ==&lt;br /&gt;
The Panel Display changes its display one tick after its input is changed.&lt;br /&gt;
&lt;br /&gt;
== Configurability ==&lt;br /&gt;
The Panel Display can be configured in two ways:&lt;br /&gt;
&lt;br /&gt;
* Its amount of input pegs can be changed via a &#039;Input Count&#039; slider, which ranges from 1 to 3 at its default size, and a maximum of 9 if resized. The default amount of input pegs is 1.&lt;br /&gt;
* Its [[Palette|color palette]] can be specified from the list of palettes in that world. Note that you can add or change palettes by clicking the &#039;Edit Configurations&#039; button.&lt;br /&gt;
&lt;br /&gt;
== Resizability ==&lt;br /&gt;
The Panel Display can be resized from a default 1 by 1 size, to 12 by 12.&lt;br /&gt;
&lt;br /&gt;
If the Panel Display is at least 2 by 2 in size, its input pegs can be increased from a maximum of 3 to a maximum of 9.&lt;br /&gt;
&lt;br /&gt;
== Trivia ==&lt;br /&gt;
Unlike its counterpart, the [[Display]], the Panel Display can have up to 9 input pegs when resized from its default size, whereas the [[Display]] can only have up to 4 input pegs.&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Logic_World_Wiki:Contributing&amp;diff=76</id>
		<title>Logic World Wiki:Contributing</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Logic_World_Wiki:Contributing&amp;diff=76"/>
		<updated>2025-09-06T22:19:02Z</updated>

		<summary type="html">&lt;p&gt;GHXX: clarify template description, point people to existing examples&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This page contains resources for contributors to this wiki.&lt;br /&gt;
&lt;br /&gt;
We use [https://www.mediawiki.org/ MediaWiki], so if you&#039;re familiar with other MediaWiki wikis you&#039;ll feel right at home. If you&#039;ve never used MediaWiki before, don&#039;t worry! It&#039;s a great piece of software, and you&#039;ll figure out your way around it in no time :)&lt;br /&gt;
&lt;br /&gt;
Thanks for your interest in contributing!&lt;br /&gt;
&lt;br /&gt;
==What should I contribute?==&lt;br /&gt;
&lt;br /&gt;
Contribute whatever you think would make the wiki better! That&#039;s the amazing thing about wikis - they&#039;re websites that anybody can edit, and they&#039;re at their best when lots of people are doing that.&lt;br /&gt;
&lt;br /&gt;
Do you see a place where information is missing? Do you see an awkwardly-written sentence that could be phrased better? Is there an image that should be replaced with a more appropriate one? Please, go ahead and make that improvement! Never be afraid of editing the wiki -- if the other editors think a change is bad, it&#039;s easy to revert it, so there&#039;s no risk to editing.&lt;br /&gt;
&lt;br /&gt;
If you&#039;d like to get a sense of what the other editors are working on and where help would be especially appreciated, we use a private discord channel for discussing shared priorities (see [[#Collaborating]]).&lt;br /&gt;
&lt;br /&gt;
==Formatting help==&lt;br /&gt;
&lt;br /&gt;
For info on how to add headers, tables, lists, links, and more, see: https://www.mediawiki.org/wiki/Help:Formatting&lt;br /&gt;
&lt;br /&gt;
==Templates==&lt;br /&gt;
&lt;br /&gt;
Templates act like prefabs, letting you reusing wiki content across pages, even supporting parameters. An example of this would be the &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;{{stub}}&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt; template, which will be rendered as:&lt;br /&gt;
{{stub}}&lt;br /&gt;
&lt;br /&gt;
The MediaWiki docs on templates are here: https://www.mediawiki.org/wiki/Help:Templates&lt;br /&gt;
&lt;br /&gt;
You can see a list of all templates on this wiki at https://wiki.logic.world/wiki/Special:AllPages?namespace=10&lt;br /&gt;
template.&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
&lt;br /&gt;
As our templates currently aren&#039;t well documented, you can look at some pre-existing pages for how to use them. MediaWiki comes with a SpecialPage that shows all pages that use a certain page (including templates). Thus, if you are curious about the usage of the Todo template you can use the following link: https://wiki.logic.world/wiki/Special:WhatLinksHere/Template:Todo (referencing the template is done via &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;{{todo}}&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
For an example on how to add LaTeX math expressions, see [[Lookup_Table]].&lt;br /&gt;
&lt;br /&gt;
==Collaborating==&lt;br /&gt;
&lt;br /&gt;
You can discuss a particular page with other editors on [https://www.mediawiki.org/wiki/Help:Talk_pages talk pages].&lt;br /&gt;
&lt;br /&gt;
We also have a private channel in the Logic World Discord for wiki editors to collaborate. Currently there&#039;s no way to opt-in to this channel yourself. If you&#039;d like to join, ask to be added in #logic-world.&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=68</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=68"/>
		<updated>2025-09-06T20:37:29Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fix Discord spelling&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Welcome to the Logic World Wiki. This wiki is dedicated anything and everything related to [[Logic World]], a video game where you can invent a new computer!&lt;br /&gt;
&lt;br /&gt;
We only just started the wiki and it doesn&#039;t have a lot of content yet. You can help by editing pages and creating new pages.&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
* [https://logic.world Logic World home page]&lt;br /&gt;
* [https://store.steampowered.com/app/1054340/Logic_World/ Logic World on Steam]&lt;br /&gt;
* [https://discord.gg/C5Qkk53 Logic World Discord]&lt;br /&gt;
&lt;br /&gt;
== Featured articles ==&lt;br /&gt;
&lt;br /&gt;
* [[Modding:Introduction|Modding introduction]]&lt;br /&gt;
* [[Dedicated Server Setup Guide]]&lt;br /&gt;
* [[Wiki Style Guide]]&lt;br /&gt;
* [[Lookup Table]]&lt;br /&gt;
&lt;br /&gt;
== Stats ==&lt;br /&gt;
&lt;br /&gt;
The wiki has:&lt;br /&gt;
&lt;br /&gt;
* {{NUMBEROFARTICLES}} articles&lt;br /&gt;
* {{NUMBEROFUSERS}} registered users&lt;br /&gt;
* {{NUMBEROFEDITS}} total edits&lt;br /&gt;
&lt;br /&gt;
For more, see [[Special:Statistics]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Infobox&amp;diff=57</id>
		<title>Template:Infobox</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Infobox&amp;diff=57"/>
		<updated>2025-09-06T13:47:26Z</updated>

		<summary type="html">&lt;p&gt;GHXX: stash&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot;|&amp;lt;span style=&amp;quot;font-size: larger;&amp;quot;&amp;gt; {{PAGENAME}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
! Test &lt;br /&gt;
| TestValue&lt;br /&gt;
|-&lt;br /&gt;
! Test2&lt;br /&gt;
| {{{TestArg2|test}}}&lt;br /&gt;
&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=56</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=56"/>
		<updated>2025-09-06T13:06:39Z</updated>

		<summary type="html">&lt;p&gt;GHXX: clarify wording&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can always be represented in [[wikipedia:Disjunctive_normal_form|Disjunctive normal form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
[[File:5BitEqualityLut.png|alt=5 bit equality LUT|thumb|5 bit equality LUT]]&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a &#039;&#039;lookup table&#039;&#039; (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become incredibly expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size. &lt;br /&gt;
&lt;br /&gt;
Sometimes, LUTs are essential building blocks for designing a more complex circuit within a predefined, small time constraint (generally in the range of 2-3 ticks), as this often means that part of the function needs to be executed in a single tick, which, for non-trivial functions, is usually only achievable via a lookup table.&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=55</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=55"/>
		<updated>2025-09-06T13:01:30Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fix link text&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can always be represented in [[wikipedia:Disjunctive_normal_form|Disjunctive normal form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
[[File:5BitEqualityLut.png|alt=5 bit equality LUT|thumb|5 bit equality LUT]]&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a &#039;&#039;lookup table&#039;&#039; (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become incredibly expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size. Sometimes, LUTs are the only way of designing a circuit within a predefined, small time constraint (generally in the range of 2-3 ticks).&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=54</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=54"/>
		<updated>2025-09-06T13:00:03Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fix linking cnf instead of dnf&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can always be represented in [[wikipedia:Disjunctive_normal_form|https://en.wikipedia.org/wiki/Disjunctive normal form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
[[File:5BitEqualityLut.png|alt=5 bit equality LUT|thumb|5 bit equality LUT]]&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a &#039;&#039;lookup table&#039;&#039; (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become incredibly expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size. Sometimes, LUTs are the only way of designing a circuit within a predefined, small time constraint (generally in the range of 2-3 ticks).&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=53</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=53"/>
		<updated>2025-09-06T12:42:43Z</updated>

		<summary type="html">&lt;p&gt;GHXX: clarify wording&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
[[File:5BitEqualityLut.png|alt=5 bit equality LUT|thumb|5 bit equality LUT]]&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a &#039;&#039;lookup table&#039;&#039; (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become incredibly expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size. Sometimes, LUTs are the only way of designing a circuit within a predefined, small time constraint (generally in the range of 2-3 ticks).&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=52</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=52"/>
		<updated>2025-09-06T12:41:30Z</updated>

		<summary type="html">&lt;p&gt;GHXX: add lut image&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can, theoretically, always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
[[File:5BitEqualityLut.png|alt=5 bit equality LUT|thumb|5 bit equality LUT]]&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a &#039;&#039;lookup table&#039;&#039; (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become incredibly expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size. Sometimes, LUTs are the only way of designing a circuit within a predefined, small time constraint (generally in the range of 2-3 ticks).&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=File:5BitEqualityLut.png&amp;diff=51</id>
		<title>File:5BitEqualityLut.png</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=File:5BitEqualityLut.png&amp;diff=51"/>
		<updated>2025-09-06T12:34:45Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Shows a board containing a lookup table computing 5bit equality&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=50</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=50"/>
		<updated>2025-09-06T12:09:01Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can, theoretically, always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a Lookup Table (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in, that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become very expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size.&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;br /&gt;
{{todo|add screenshot of 5 bit equality LUT}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=48</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=48"/>
		<updated>2025-09-06T11:56:50Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can, theoretically, always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a Lookup Table (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become very expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size.&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;br /&gt;
{{todo|add screenshot of 5 bit equality LUT}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=47</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=47"/>
		<updated>2025-09-06T11:53:00Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Any arbitrary logic formula can, theoretically, always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs. Each AND-gate represents a single case where the output is supposed to be &#039;&#039;true&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
In Logic World, this is referred to as a Lookup Table (LUT), which is generally implemented by first creating a list of all input states that should lead to a &#039;&#039;true&#039;&#039; output. From this list, the LUT can then be constructed quite easily. It consists of multiple relay chains that are simply OR-ed together at the end, where one chain corresponds to one input-assignment that should lead to a truthy output value. The aforementioned relay chains are started by a single NOT-gate whose inputs are all signals that are &#039;&#039;false&#039;&#039; in the case where a &#039;&#039;true&#039;&#039; output is expected, followed by a set of relays where the top input is expected to be &#039;&#039;true&#039;&#039; for such a &#039;&#039;true&#039;&#039; result.&lt;br /&gt;
&lt;br /&gt;
Normally, however, it is also necessary to prevent back-propagation of signals by using fast-buffers, meaning each chain requires as many components as there are inputs to account for relays and fast-buffers, along with one NOT-gate if there are any inputs that are supposed to be off.&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the arrangement described above, we can compute the approximate required component count as &amp;lt;math&amp;gt;chainCount \cdot (1 + inputCount)&amp;lt;/math&amp;gt;. If we assume that half of the possible input assignments lead to a true output, the number of chains would be equivalent to &amp;lt;math&amp;gt;50% \cdot 2^{inputCount} = 2^{inputCount-1}&amp;lt;/math&amp;gt;. If we factor in that each chain requires &amp;lt;math&amp;gt;1+inputCount&amp;lt;/math&amp;gt; components, the total can be written as &amp;lt;math&amp;gt;2^{inputCount-1} \cdot (1+inputCount)&amp;lt;/math&amp;gt;. Approximately, this could be written as &amp;lt;math&amp;gt;\mathcal{O}(2^{inputCount-1} \cdot (1+inputCount))=\mathcal{O}(2^{inputCount} \cdot (inputCount)) = \mathcal{O}(2^{inputCount})&amp;lt;/math&amp;gt;. In order words, the component count scales exponentially with input size, under the assumption that the amount of true assignment also scales exponentially.&lt;br /&gt;
&lt;br /&gt;
While LUTs tend to become very expensive quite quickly, they are &#039;&#039;&#039;very fast&#039;&#039;&#039;, computing the output in a single tick, regardless of input size.&lt;br /&gt;
&lt;br /&gt;
{{todo|add infobox giving an overview of time and component count maybe?}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=46</id>
		<title>Lookup Table</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Lookup_Table&amp;diff=46"/>
		<updated>2025-09-06T09:11:20Z</updated>

		<summary type="html">&lt;p&gt;GHXX: Created page with &amp;quot;{{stub}}  Any arbitrary logic formula can, theoretically, always be represented in Conjunctive Normal Form. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs.   == Complexity == When following the usual arrangement  &amp;lt;math&amp;gt;\mathcal{O}(n \cdot \frac{n}{2}) = \mathcal{O}(n^2)&amp;lt;/math&amp;gt;&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
Any arbitrary logic formula can, theoretically, always be represented in [[wikipedia:Conjunctive_normal_form|Conjunctive Normal Form]]. Put in simple terms, this means the output is computed using a single OR-operation, whose inputs are formed by AND gates, which directly use (possibly negated) inputs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Complexity ==&lt;br /&gt;
When following the usual arrangement&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\mathcal{O}(n \cdot \frac{n}{2}) = \mathcal{O}(n^2)&amp;lt;/math&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=45</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=45"/>
		<updated>2025-09-06T08:51:50Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;strong&amp;gt;MediaWiki has been installed.&amp;lt;/strong&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User&#039;s Guide] for information on using the wiki software.&lt;br /&gt;
&lt;br /&gt;
== Getting started ==&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Configuration_settings Configuration settings list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:FAQ MediaWiki FAQ]&lt;br /&gt;
* [https://lists.wikimedia.org/postorius/lists/mediawiki-announce.lists.wikimedia.org/ MediaWiki release mailing list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Localisation#Translation_resources Localise MediaWiki for your language]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Combating_spam Learn how to combat spam on your wiki]&lt;br /&gt;
&lt;br /&gt;
[[Modding:Introduction|Modding introduction]]&lt;br /&gt;
&lt;br /&gt;
[[Dedicated Server Setup Guide]]&lt;br /&gt;
&lt;br /&gt;
[[Wiki Style Guide]]&lt;br /&gt;
&lt;br /&gt;
Common components:&lt;br /&gt;
&lt;br /&gt;
[[Lookup Table]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=44</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=44"/>
		<updated>2025-09-06T08:51:39Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;strong&amp;gt;MediaWiki has been installed.&amp;lt;/strong&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User&#039;s Guide] for information on using the wiki software.&lt;br /&gt;
&lt;br /&gt;
== Getting started ==&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Configuration_settings Configuration settings list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:FAQ MediaWiki FAQ]&lt;br /&gt;
* [https://lists.wikimedia.org/postorius/lists/mediawiki-announce.lists.wikimedia.org/ MediaWiki release mailing list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Localisation#Translation_resources Localise MediaWiki for your language]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Combating_spam Learn how to combat spam on your wiki]&lt;br /&gt;
&lt;br /&gt;
[[Modding:Introduction|Modding introduction]]&lt;br /&gt;
&lt;br /&gt;
[[Dedicated Server Setup Guide]]&lt;br /&gt;
&lt;br /&gt;
[[Wiki Style Guide]]&lt;br /&gt;
&lt;br /&gt;
Common components:&lt;br /&gt;
[[Lookup Table]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=43</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=43"/>
		<updated>2025-09-06T08:51:31Z</updated>

		<summary type="html">&lt;p&gt;GHXX: add placeholder link for LUT&amp;#039;s&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;strong&amp;gt;MediaWiki has been installed.&amp;lt;/strong&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User&#039;s Guide] for information on using the wiki software.&lt;br /&gt;
&lt;br /&gt;
== Getting started ==&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Configuration_settings Configuration settings list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:FAQ MediaWiki FAQ]&lt;br /&gt;
* [https://lists.wikimedia.org/postorius/lists/mediawiki-announce.lists.wikimedia.org/ MediaWiki release mailing list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Localisation#Translation_resources Localise MediaWiki for your language]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Combating_spam Learn how to combat spam on your wiki]&lt;br /&gt;
&lt;br /&gt;
[[Modding:Introduction|Modding introduction]]&lt;br /&gt;
&lt;br /&gt;
[[Dedicated Server Setup Guide]]&lt;br /&gt;
&lt;br /&gt;
[[Wiki Style Guide]]&lt;br /&gt;
&lt;br /&gt;
Common components:[[Lookup Table]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Main_Page&amp;diff=41</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Main_Page&amp;diff=41"/>
		<updated>2025-09-05T07:14:49Z</updated>

		<summary type="html">&lt;p&gt;GHXX: add some more future page links&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;strong&amp;gt;MediaWiki has been installed.&amp;lt;/strong&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Consult the [https://www.mediawiki.org/wiki/Special:MyLanguage/Help:Contents User&#039;s Guide] for information on using the wiki software.&lt;br /&gt;
&lt;br /&gt;
== Getting started ==&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Configuration_settings Configuration settings list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:FAQ MediaWiki FAQ]&lt;br /&gt;
* [https://lists.wikimedia.org/postorius/lists/mediawiki-announce.lists.wikimedia.org/ MediaWiki release mailing list]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Localisation#Translation_resources Localise MediaWiki for your language]&lt;br /&gt;
* [https://www.mediawiki.org/wiki/Special:MyLanguage/Manual:Combating_spam Learn how to combat spam on your wiki]&lt;br /&gt;
&lt;br /&gt;
[[Modding:Introduction|Modding introduction]]&lt;br /&gt;
&lt;br /&gt;
[[Dedicated Server Setup Guide]]&lt;br /&gt;
&lt;br /&gt;
[[Wiki Style Guide]]&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=40</id>
		<title>Mods:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=40"/>
		<updated>2025-09-04T00:49:01Z</updated>

		<summary type="html">&lt;p&gt;GHXX: update formatting&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
[[Logic World]] currently features &#039;&#039;&#039;unofficial&#039;&#039;&#039; first-party modification (mod) support, this means, the Logic World client / server will load &amp;amp; compile mods, and while this will most likely be maintained, it might be lacking some quality of life features, and the API may undergo heavy changes. Though, this does &#039;&#039;&#039;not&#039;&#039;&#039; mean that every game update will break the game.&lt;br /&gt;
&lt;br /&gt;
Of course the probability of a mod breaking depends on how deep you are interfacing with the game; if you are simply adding components it is likely that updating the mod will be very easy or not even necessary.&lt;br /&gt;
&lt;br /&gt;
There are currently two built-in ways of adding components to the game:&lt;br /&gt;
&lt;br /&gt;
== C# ==&lt;br /&gt;
This allows you to edit nearly all game code, and thus there is almost no limit to what can be achieved. Most mods are currently written this way, and thus you will find many preexisting that you could base your mod off of. If you are already familiar with programming, with C/C++/Java or with C# itself, it should be very easy to pick up the concepts. But even in case you are not, it should be fairly easy to just tweak an existing mod and pick up the language that way.&lt;br /&gt;
&lt;br /&gt;
The initial setup consists of creating a manifest.jecs&amp;lt;ref&amp;gt;Formerly, &amp;lt;code&amp;gt;.jecs&amp;lt;/code&amp;gt; files used the &amp;lt;code&amp;gt;.succ&amp;lt;/code&amp;gt; file-extension.&amp;lt;/ref&amp;gt; file, along with any required folders. This initial structure could look like, as follows, though empty folders can be omitted:&lt;br /&gt;
 YourMod/ &amp;lt;-- This folder (&#039;&#039;&#039;not&#039;&#039;&#039; its contents) is supposed to be placed into the GameData folder when installing the mod&lt;br /&gt;
  manifest.jecs&lt;br /&gt;
  components/&lt;br /&gt;
   &amp;lt;.jecs component files&amp;gt; &amp;lt;-- these files define the actual component shapes, colors, peg counts and reference the C# code, if desired&lt;br /&gt;
  languages/&lt;br /&gt;
   English/&lt;br /&gt;
    English.jecs &amp;lt;-- Translation files simply map an internal name, e.g. author.modname.componentname to a human readable name, e.g. And Gate; See the MHG basemod for a complete list of supported languages.&lt;br /&gt;
   French/&lt;br /&gt;
    French.jecs&lt;br /&gt;
   &amp;lt;other language folders&amp;gt;&lt;br /&gt;
  src/ &amp;lt;-- (indirectly) contains all C# source files, which will be compiled when starting the game&lt;br /&gt;
   client/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
   server/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+Examples to base your mod off of&lt;br /&gt;
!Mod Name&lt;br /&gt;
!Description&lt;br /&gt;
!Link&lt;br /&gt;
!License&lt;br /&gt;
|-&lt;br /&gt;
|MHG (basemod)&lt;br /&gt;
|The Logic World base mod which contains most game content.&lt;br /&gt;
|Located in your &amp;lt;code&amp;gt;Logic World/GameData&amp;lt;/code&amp;gt; folder&lt;br /&gt;
|All Rights Reserved&lt;br /&gt;
|-&lt;br /&gt;
|Tcp Bridge&lt;br /&gt;
|Adds a component supporting real-world tcp connections. Farily complex, but shows off using threads within components.&lt;br /&gt;
|https://github.com/GHXX/LogicWorld-TcpBridge&lt;br /&gt;
|MIT&lt;br /&gt;
|-&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
{{Todo|List more mods that perform various actions, e.g. adding a basic component; one that uses dynamic pegs, like the vanilla AND gate; one that adds custom UI; maybe one for adding chat commands or something; etc.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logic Script ==&lt;br /&gt;
This is an alternative way which requires less programming knowledge, but is much more limited.&lt;br /&gt;
{{Todo|describe logic script}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=39</id>
		<title>Mods:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=39"/>
		<updated>2025-09-03T23:01:31Z</updated>

		<summary type="html">&lt;p&gt;GHXX: put references into their own secion&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
[[Logic World]] currently features &#039;&#039;&#039;unofficial&#039;&#039;&#039; first-party modification (mod) support, this means, the Logic World client / server will load &amp;amp; compile mods, and while this will most likely be maintained, it might be lacking some quality of life features, and the API may undergo heavy changes. Though, this does &#039;&#039;&#039;not&#039;&#039;&#039; mean that every game update will break the game.&lt;br /&gt;
&lt;br /&gt;
Of course the probability of a mod breaking depends on how deep you are interfacing with the game; if you are simply adding components it is likely that updating the mod will be very easy or not even necessary.&lt;br /&gt;
&lt;br /&gt;
There are currently two built-in ways of adding components to the game:&lt;br /&gt;
&lt;br /&gt;
== C# ==&lt;br /&gt;
This allows you to edit nearly all game code, and thus there is almost no limit to what can be achieved. Most mods are currently written this way, and thus you will find many preexisting that you could base your mod off of. If you are already familiar with programming, with C/C++/Java or with C# itself, it should be very easy to pick up the concepts. But even in case you are not, it should be fairly easy to just tweak an existing mod and pick up the language that way.&lt;br /&gt;
&lt;br /&gt;
The initial setup consists of creating a manifest.jecs&amp;lt;ref&amp;gt;Formerly, &amp;lt;code&amp;gt;.jecs&amp;lt;/code&amp;gt; files used the &amp;lt;code&amp;gt;.succ&amp;lt;/code&amp;gt; file-extension.&amp;lt;/ref&amp;gt; file, along with any required folders. This initial structure could look like, as follows, though empty folders can be omitted:&lt;br /&gt;
 YourMod/ &amp;lt;-- This folder (&#039;&#039;&#039;not&#039;&#039;&#039; its contents) is supposed to be placed into the GameData folder when installing the mod&lt;br /&gt;
  manifest.jecs&lt;br /&gt;
  components/&lt;br /&gt;
   &amp;lt;.jecs component files&amp;gt; &amp;lt;-- these files define the actual component shapes, colors, peg counts and reference the C# code, if desired&lt;br /&gt;
  languages/&lt;br /&gt;
   English/&lt;br /&gt;
    English.jecs &amp;lt;-- Translation files simply map an internal name, e.g. author.modname.componentname to a human readable name, e.g. And Gate; See the MHG basemod for a complete list of supported languages.&lt;br /&gt;
   French/&lt;br /&gt;
    French.jecs&lt;br /&gt;
   &amp;lt;other language folders&amp;gt;&lt;br /&gt;
  src/ &amp;lt;-- (indirectly) contains all C# source files, which will be compiled when starting the game&lt;br /&gt;
   client/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
   server/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+Examples to base your mod off of&lt;br /&gt;
!Mod Name&lt;br /&gt;
!Description&lt;br /&gt;
!Link&lt;br /&gt;
!License&lt;br /&gt;
|-&lt;br /&gt;
|MHG (basemod)&lt;br /&gt;
|The Logic World base mod which contains most game content.&lt;br /&gt;
|Located in your &#039;Logic World/GameData&#039; folder&lt;br /&gt;
|All Rights Reserved&lt;br /&gt;
|-&lt;br /&gt;
|Tcp Bridge&lt;br /&gt;
|Adds a component supporting real-world tcp connections. Farily complex, but shows off using threads within components.&lt;br /&gt;
|https://github.com/GHXX/LogicWorld-TcpBridge&lt;br /&gt;
|MIT&lt;br /&gt;
|-&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
{{Todo|List more mods that perform various actions, e.g. adding a basic component; one that uses dynamic pegs, like the vanilla AND gate; one that adds custom UI; maybe one for adding chat commands or something; etc.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logic Script ==&lt;br /&gt;
This is an alternative way which requires less programming knowledge, but is much more limited.&lt;br /&gt;
{{Todo|describe logic script}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=38</id>
		<title>Mods:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=38"/>
		<updated>2025-09-03T23:00:45Z</updated>

		<summary type="html">&lt;p&gt;GHXX: convert subscript to proper footnote&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
[[Logic World]] currently features &#039;&#039;&#039;unofficial&#039;&#039;&#039; first-party modification (mod) support, this means, the Logic World client / server will load &amp;amp; compile mods, and while this will most likely be maintained, it might be lacking some quality of life features, and the API may undergo heavy changes. Though, this does &#039;&#039;&#039;not&#039;&#039;&#039; mean that every game update will break the game.&lt;br /&gt;
&lt;br /&gt;
Of course the probability of a mod breaking depends on how deep you are interfacing with the game; if you are simply adding components it is likely that updating the mod will be very easy or not even necessary.&lt;br /&gt;
&lt;br /&gt;
There are currently two built-in ways of adding components to the game:&lt;br /&gt;
&lt;br /&gt;
== C# ==&lt;br /&gt;
This allows you to edit nearly all game code, and thus there is almost no limit to what can be achieved. Most mods are currently written this way, and thus you will find many preexisting that you could base your mod off of. If you are already familiar with programming, with C/C++/Java or with C# itself, it should be very easy to pick up the concepts. But even in case you are not, it should be fairly easy to just tweak an existing mod and pick up the language that way.&lt;br /&gt;
&lt;br /&gt;
The initial setup consists of creating a manifest.jecs&amp;lt;ref&amp;gt;Formerly, &amp;lt;code&amp;gt;.jecs&amp;lt;/code&amp;gt; files used the &amp;lt;code&amp;gt;.succ&amp;lt;/code&amp;gt; file-extension.&amp;lt;/ref&amp;gt; file, along with any required folders. This initial structure could look like, as follows, though empty folders can be omitted:&lt;br /&gt;
 YourMod/ &amp;lt;-- This folder (&#039;&#039;&#039;not&#039;&#039;&#039; its contents) is supposed to be placed into the GameData folder when installing the mod&lt;br /&gt;
  manifest.jecs&lt;br /&gt;
  components/&lt;br /&gt;
   &amp;lt;.jecs component files&amp;gt; &amp;lt;-- these files define the actual component shapes, colors, peg counts and reference the C# code, if desired&lt;br /&gt;
  languages/&lt;br /&gt;
   English/&lt;br /&gt;
    English.jecs &amp;lt;-- Translation files simply map an internal name, e.g. author.modname.componentname to a human readable name, e.g. And Gate; See the MHG basemod for a complete list of supported languages.&lt;br /&gt;
   French/&lt;br /&gt;
    French.jecs&lt;br /&gt;
   &amp;lt;other language folders&amp;gt;&lt;br /&gt;
  src/ &amp;lt;-- (indirectly) contains all C# source files, which will be compiled when starting the game&lt;br /&gt;
   client/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
   server/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+Examples to base your mod off of&lt;br /&gt;
!Mod Name&lt;br /&gt;
!Description&lt;br /&gt;
!Link&lt;br /&gt;
!License&lt;br /&gt;
|-&lt;br /&gt;
|MHG (basemod)&lt;br /&gt;
|The Logic World base mod which contains most game content.&lt;br /&gt;
|Located in your &#039;Logic World/GameData&#039; folder&lt;br /&gt;
|All Rights Reserved&lt;br /&gt;
|-&lt;br /&gt;
|Tcp Bridge&lt;br /&gt;
|Adds a component supporting real-world tcp connections. Farily complex, but shows off using threads within components.&lt;br /&gt;
|https://github.com/GHXX/LogicWorld-TcpBridge&lt;br /&gt;
|MIT&lt;br /&gt;
|-&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
{{Todo|List more mods that perform various actions, e.g. adding a basic component; one that uses dynamic pegs, like the vanilla AND gate; one that adds custom UI; maybe one for adding chat commands or something; etc.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logic Script ==&lt;br /&gt;
This is an alternative way which requires less programming knowledge, but is much more limited.&lt;br /&gt;
{{Todo|describe logic script}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=37</id>
		<title>Mods:Introduction</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Mods:Introduction&amp;diff=37"/>
		<updated>2025-09-03T22:56:49Z</updated>

		<summary type="html">&lt;p&gt;GHXX: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{stub}}&lt;br /&gt;
&lt;br /&gt;
[[Logic World]] currently features &#039;&#039;&#039;unofficial&#039;&#039;&#039; first-party modification (mod) support, this means, the Logic World client / server will load &amp;amp; compile mods, and while this will most likely be maintained, it might be lacking some quality of life features, and the API may undergo heavy changes. Though, this does &#039;&#039;&#039;not&#039;&#039;&#039; mean that every game update will break the game.&lt;br /&gt;
&lt;br /&gt;
Of course the probability of a mod breaking depends on how deep you are interfacing with the game; if you are simply adding components it is likely that updating the mod will be very easy or not even necessary.&lt;br /&gt;
&lt;br /&gt;
There are currently two built-in ways of adding components to the game:&lt;br /&gt;
&lt;br /&gt;
== C# ==&lt;br /&gt;
This allows you to edit nearly all game code, and thus there is almost no limit to what can be achieved. Most mods are currently written this way, and thus you will find many preexisting that you could base your mod off of. If you are already familiar with programming, with C/C++/Java or with C# itself, it should be very easy to pick up the concepts. But even in case you are not, it should be fairly easy to just tweak an existing mod and pick up the language that way.&lt;br /&gt;
&lt;br /&gt;
The initial setup consists of creating a manifest.jecs&amp;lt;sub&amp;gt;(formerly manifest.succ)&amp;lt;/sub&amp;gt; file, along with any required folders. This initial structure could look like, as follows, though empty folders can be omitted:&lt;br /&gt;
 YourMod/ &amp;lt;-- This folder (&#039;&#039;&#039;not&#039;&#039;&#039; its contents) is supposed to be placed into the GameData folder when installing the mod&lt;br /&gt;
  manifest.jecs&lt;br /&gt;
  components/&lt;br /&gt;
   &amp;lt;.jecs component files&amp;gt; &amp;lt;-- these files define the actual component shapes, colors, peg counts and reference the C# code, if desired&lt;br /&gt;
  languages/&lt;br /&gt;
   English/&lt;br /&gt;
    English.jecs &amp;lt;-- Translation files simply map an internal name, e.g. author.modname.componentname to a human readable name, e.g. And Gate; See the MHG basemod for a complete list of supported languages.&lt;br /&gt;
   French/&lt;br /&gt;
    French.jecs&lt;br /&gt;
   &amp;lt;other language folders&amp;gt;&lt;br /&gt;
  src/ &amp;lt;-- (indirectly) contains all C# source files, which will be compiled when starting the game&lt;br /&gt;
   client/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
   server/&lt;br /&gt;
    &amp;lt;.cs source files&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+Examples to base your mod off of&lt;br /&gt;
!Mod Name&lt;br /&gt;
!Description&lt;br /&gt;
!Link&lt;br /&gt;
!License&lt;br /&gt;
|-&lt;br /&gt;
|MHG (basemod)&lt;br /&gt;
|The Logic World base mod which contains most game content.&lt;br /&gt;
|Located in your &#039;Logic World/GameData&#039; folder&lt;br /&gt;
|All Rights Reserved&lt;br /&gt;
|-&lt;br /&gt;
|Tcp Bridge&lt;br /&gt;
|Adds a component supporting real-world tcp connections. Farily complex, but shows off using threads within components.&lt;br /&gt;
|https://github.com/GHXX/LogicWorld-TcpBridge&lt;br /&gt;
|MIT&lt;br /&gt;
|-&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
{{Todo|List more mods that perform various actions, e.g. adding a basic component; one that uses dynamic pegs, like the vanilla AND gate; one that adds custom UI; maybe one for adding chat commands or something; etc.}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logic Script ==&lt;br /&gt;
This is an alternative way which requires less programming knowledge, but is much more limited.&lt;br /&gt;
{{Todo|describe logic script}}&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=36</id>
		<title>Template:Todo</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=36"/>
		<updated>2025-09-03T22:52:35Z</updated>

		<summary type="html">&lt;p&gt;GHXX: fix text padding&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;noinclude&amp;gt;&amp;lt;templatedata&amp;gt;&lt;br /&gt;
{&lt;br /&gt;
    &amp;quot;description&amp;quot;: &amp;quot;Places a TODO box, indicating something that needs to be done still&amp;quot;,&lt;br /&gt;
    &amp;quot;params&amp;quot;: {&lt;br /&gt;
        &amp;quot;1&amp;quot;: {&lt;br /&gt;
            &amp;quot;label&amp;quot;: &amp;quot;TODO message&amp;quot;,&lt;br /&gt;
            &amp;quot;description&amp;quot;: &amp;quot;Message describing what is left to be done&amp;quot;,&lt;br /&gt;
            &amp;quot;type&amp;quot;: &amp;quot;string&amp;quot;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/templatedata&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&amp;lt;noinclude&amp;gt;prefix text&amp;lt;/noinclude&amp;gt;&amp;lt;span class=&amp;quot;cdx-message2 cdx-message--block&amp;quot; style=&amp;quot;background-color: var(--background-color-base);border-color: var(--background-color-inverted);color: var(--color-base);border-style: solid;padding: 0px 2px;border-width: 1px;margin-left: 3px;margin-right: 3px;     display: inline-block;line-height: normal;&amp;quot;&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;TODO:&#039;&#039;&#039; {{{1|TODO MESSAGE}}}&amp;lt;/span&amp;gt;&amp;lt;noinclude&amp;gt;suffix text&amp;lt;/noinclude&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=35</id>
		<title>Template:Todo</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=35"/>
		<updated>2025-09-03T22:49:33Z</updated>

		<summary type="html">&lt;p&gt;GHXX: remove excess opening tag&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;noinclude&amp;gt;&amp;lt;templatedata&amp;gt;&lt;br /&gt;
{&lt;br /&gt;
    &amp;quot;description&amp;quot;: &amp;quot;Places a TODO box, indicating something that needs to be done still&amp;quot;,&lt;br /&gt;
    &amp;quot;params&amp;quot;: {&lt;br /&gt;
        &amp;quot;1&amp;quot;: {&lt;br /&gt;
            &amp;quot;label&amp;quot;: &amp;quot;TODO message&amp;quot;,&lt;br /&gt;
            &amp;quot;description&amp;quot;: &amp;quot;Message describing what is left to be done&amp;quot;,&lt;br /&gt;
            &amp;quot;type&amp;quot;: &amp;quot;string&amp;quot;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/templatedata&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&amp;lt;noinclude&amp;gt;prefix text&amp;lt;/noinclude&amp;gt;&amp;lt;span class=&amp;quot;cdx-message2 cdx-message--block&amp;quot; style=&amp;quot;background-color: var(--background-color-base);border-color: var(--background-color-inverted);color: var(--color-base);border-style: solid;padding: 0px 2px;border-width: 1px;margin-left: 3px;margin-right: 3px;&amp;quot;&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;TODO:&#039;&#039;&#039; {{{1|TODO MESSAGE}}}&amp;lt;/span&amp;gt;&amp;lt;noinclude&amp;gt;suffix text&amp;lt;/noinclude&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=34</id>
		<title>Template:Todo</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=34"/>
		<updated>2025-09-03T22:43:36Z</updated>

		<summary type="html">&lt;p&gt;GHXX: add noinclude for template data&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;noinclude&amp;gt;&amp;lt;templatedata&amp;gt;&lt;br /&gt;
{&lt;br /&gt;
    &amp;quot;description&amp;quot;: &amp;quot;Places a TODO box, indicating something that needs to be done still&amp;quot;,&lt;br /&gt;
    &amp;quot;params&amp;quot;: {&lt;br /&gt;
        &amp;quot;1&amp;quot;: {&lt;br /&gt;
            &amp;quot;label&amp;quot;: &amp;quot;TODO message&amp;quot;,&lt;br /&gt;
            &amp;quot;description&amp;quot;: &amp;quot;Message describing what is left to be done&amp;quot;,&lt;br /&gt;
            &amp;quot;type&amp;quot;: &amp;quot;string&amp;quot;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/templatedata&amp;gt;&amp;lt;/noinclude&amp;gt;&lt;br /&gt;
&amp;lt;noinclude&amp;gt;prefix text&amp;lt;/noinclude&amp;gt;&amp;lt;span class=&amp;quot;cdx-message2 cdx-message--block&amp;quot; style=&amp;quot;background-color: var(--background-color-base);border-color: var(--background-color-inverted);color: var(--color-base);border-style: solid;padding: 0px 2px;border-width: 1px;margin-left: 3px;margin-right: 3px;&amp;quot;&amp;gt;&#039;&#039;&#039;TODO:&#039;&#039;&#039; {{{1|TODO MESSAGE}}}&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;noinclude&amp;gt;suffix text&amp;lt;/noinclude&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
	<entry>
		<id>https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=33</id>
		<title>Template:Todo</title>
		<link rel="alternate" type="text/html" href="https://wiki.logic.world/index.php?title=Template:Todo&amp;diff=33"/>
		<updated>2025-09-03T22:41:01Z</updated>

		<summary type="html">&lt;p&gt;GHXX: uncomment template data&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;templatedata&amp;gt;&lt;br /&gt;
{&lt;br /&gt;
    &amp;quot;description&amp;quot;: &amp;quot;Places a TODO box, indicating something that needs to be done still&amp;quot;,&lt;br /&gt;
    &amp;quot;params&amp;quot;: {&lt;br /&gt;
        &amp;quot;1&amp;quot;: {&lt;br /&gt;
            &amp;quot;label&amp;quot;: &amp;quot;TODO message&amp;quot;,&lt;br /&gt;
            &amp;quot;description&amp;quot;: &amp;quot;Message describing what is left to be done&amp;quot;,&lt;br /&gt;
            &amp;quot;type&amp;quot;: &amp;quot;string&amp;quot;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/templatedata&amp;gt;&lt;br /&gt;
&amp;lt;noinclude&amp;gt;prefix text&amp;lt;/noinclude&amp;gt;&amp;lt;span class=&amp;quot;cdx-message2 cdx-message--block&amp;quot; style=&amp;quot;background-color: var(--background-color-base);border-color: var(--background-color-inverted);color: var(--color-base);border-style: solid;padding: 0px 2px;border-width: 1px;margin-left: 3px;margin-right: 3px;&amp;quot;&amp;gt;&#039;&#039;&#039;TODO:&#039;&#039;&#039; {{{1|TODO MESSAGE}}}&amp;lt;/span&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;noinclude&amp;gt;suffix text&amp;lt;/noinclude&amp;gt;&lt;/div&gt;</summary>
		<author><name>GHXX</name></author>
	</entry>
</feed>