INSANE! Mind-Blowing Quad-Core Redstone PC in Minecraft

Hello everyone, my name is Sayanel and today I am going to present you my Minecraft computer. So let’s begin with some specifications. This computer is build fully pistonless and it is based on a 8-bits architecture. That means that we deal only with 8 bits of value.

Also it’s a Quad-core computer as you can see here and each core is individually based. That means that you can run differents algorithms on each core independently. Of course each core can exchange data with each other. Before testing the computer with some algorithm, I need to present you that control panel.

So that control panel is divided in four parts as you can see. Each part is for one core and contains a reset button that reset everything in the core except the algorithm. A button to activate the line 0 of code of the algorithm. Two buttons to chose the clock speed.

As you can see here you can choose 16 ticks per operation or 20 ticks per operation. You can also stop the clock. The last thing is that display that shows you which part is currently activated. So you follow the line of code that is activated in the algorithm.

It’s really important to debug your programs. A last thing is those buttons can help you to teleport through the computer. Let’s begin with a really simple algorithm that is adding two numbers. Here i have coded in the algorithm those two numbers.

But of course you can connect a keyboard to the computer to enter diffrents numbers. So here we add 11 and 14. So let’s start the clock of the core and initialize the algorithm. As you can see here we have the line 0 activated

Then the line 1, line 2, the line 3 and it’s done. Now we can see the result on the screen that is 25 (11+14). Let’s continue with another algorithm that is the calculation of the Fibonacci sequence.

So what is the Fibonacci sequence ? It’s you take 1 and 1 then you add those two numbers and the result is 2. Then you add the result, that is 2, and the previous number that is 1.

So you have 3, then 3 + 2 is 5 then 8 and so on and so on. I have coded in the core number 0 the algorithm to calculate the Fibonacci sequence. So let’s launch (start) it. You can see here the line that is activated.

So the line 1, the line 2, and so on. And here you can see each number of the Fibonacci sequence. That is 1, 1 again, then you have 2, then you have 3 and so on and so on. In this algorithm we can test for an overflow.

That mean that when an overflow appears, when we can’t calculate with only 8 bits of value, the algorithm displays the result and stop. So we have here 55, 89, 144, and the last one 233. Now it’s the biggest number of the Fibonacci sequence that we can code on 8 bits so the

Program is stoped. As you can see here no line is activated. Let’s continue with the last algorithm to show you the parallelism of cores. so let’s take for example the calculation 23*4+7*3 the result is 113. We can calculate it with two ways.

We can calculate it like that but rather than coding this calculation in one core, we will calculate 23*4 in the core number 1 and 7*3 in the core number 2. Then the core number 2 will add each result to have the 113. So let’s start with two differents clock speeds.

As you can see we choose 2 differents clock speeds then initialize each core. Now each core calculates its multiplication at the same time. You see both algorithm have start and proceed. Let’s accelerate a bite. Now the core number 2 finished its calculation and it is waiting for the core number 1.

The core number 1 finish now and send data to the core 2, now the core 2 read data… Then it adds these two results (the the result of the core 2 and the core 1) to finish with [displaying] the last result that is 113.

Now we will see very briefly differents parts of the computer. So as you can see here you have the instruction set. It’s a hard memory in which you can code with these torches an algorithm. Each core have 256 lines of code. Another part is here the ALU. This part is for all calculations.

For example as you can see here in white, you have the adder, this design is by Newomaster a great redstoner (see his channel in the description). And it [the ALU] provides us to have differents outputs : adding output, XOR gate output, shifting outputs and others.

You have also here some test, you can test for A=B or A>B and others. The last part of the ALU is the register. It’s a very important data storage that is build to store and read data really fast. This design is by Bennyscube an it’s a 7-Bytes memory.

Another important part is the main bus. This main bus is build with a writing part and a reading part. That way you can read and write independently and at the same time. The main bus link differents cores with differents peripherales. As you can see here we have the RAM and the display.

But, in fact, you can add a lot of peripherals (at least 7 but it can be more), The only thing you have to do is building it and connect it with the main bus. So first the RAM is very important and it needs to be very fast.

As you can see here, it’s a 32 bytes of memory and it’s a design in which we can read and write at the same time independently to be compatible with the main bus. Here you have the display.

You have the 8-bits to BCD decoder again a design by Newomaster and when you have 4 bits for a digit you can display it on the screen. This display design is 2 ticks long and synchronized. So that’s it for the differents parts. Finally, a great thank to Newomaster and Bennyscube for their designs.

Also a great thank to Legomasta99 that inspire me a lot with his computer 5.0, see their channel in the description. Also, if you want to know more about that computer, the world save is in the description

And with it you have a user manual and some examples with algorithm and binary code in it. I want to do more videos about that computer to explain you more deeply each parts or how we can code algorithms in the computer.

So let me know in comments what interest you and i will do it. I hope you have appreciated that video and see you soon, Bye !