Hex for-loop 2-wide version
Description
Outputs once for every signal strength inputted. So if a signal strength of 7 is inputted, the output will flash 7 times.
It has a few nice configuration options:
- You can change the pulse duration of the output by increasing the delay on the repeater going into the comparator. Keep in mind that the delay on the repeater next to it needs to be equal to the delay of the repeater going into the comparator.
- You can also change the delay between pulses by expanding the pulse extender
I also made a version that is one block longer and doesn't use a redstone lamp, but it is 3-wide instead of 2-wide. You can find that on my account page as well.
Related Schematics
Bin2Bcd by Xoliks, Flyingdean & Unnecessarymb
Awesome
Pi Monte Carlo Integration π
A monte carlo integration to compute a PI approximation
![Broken Circle drawer by Inno [InnocentOne933] (draws squares)](https://s3.us-east-005.backblazeb2.com/schemat-io/schemat-io/schematics/5388f8cc-0a7c-4d89-b420-679abf6aed67/5388f8cc-0a7c-4d89-b420-679abf6aed67.png)
Broken Circle drawer by Inno [InnocentOne933] (draws squares)
64x64 !!
Hex Ladner fisher adder
32-Digit Hexadecimal Vertical Ladner-Fischer Adder in Minecraft Overview This Minecraft implementation is a 32-digit hexadecimal Ladner-Fischer Adder (LFA), a type of Parallel Prefix Adder (PPA) that balances the speed of carry-lookahead adders with the simplicity of ripple-carry adders. It's designed for high-performance addition operations within the constraints of Minecraft's redstone system. Key Features Vertical design utilizing Minecraft's signal propagation Processes 128 binary bits (32 hexadecimal digits) in parallel Torchless implementation for Minecraft efficiency Synchronized operation at 5Hz regardless of input Pure Ladner-Fischer architecture optimized for Minecraft Understanding the Ladner-Fischer Structure The LFA consists of four main stages, labeled S1 through S4: S1 (Stage 1): This is the preprocessing stage. Each S1 block takes two input bits and computes initial propagate (P) and generate (G) signals. S2 (Stage 2): Combines results from pairs of S1 blocks, calculating group P and G signals for 4-bit groups. S3 (Stage 3): Further combines results from S2, handling 8-bit groups. S4 (Stage 4): The final stage, which calculates the carry for the entire 16-bit section. How to interpret the structure: Signals flow from top (inputs) to bottom (outputs). Each stage combines information from the previous stage, allowing parallel computation of carries. Lower-order bits are resolved earlier, while higher-order bits utilize more stages. Performance The implementation leverages the logarithmic depth of LFA (O(log n)): Consistent 5Hz operation for all inputs, regardless of complexity Significantly outperforms Ripple Carry Adders (RCA) for large numbers This graph illustrates the time complexity of different adder types: RCA (Ripple Carry Adder): Shows linear growth O(n/2), becoming increasingly slower as bit count increases. PPA (Parallel Prefix Adder, including LFA): Demonstrates logarithmic growth O(log n), more efficient for larger bit counts. CCA (Carry Cancel Adder): Shown for comparison, exhibits stepwise linear growth, very efficient for smaller bit counts. The vertical dashed line at 32 bits (8 hex digits) shows where this implementation operates, demonstrating its efficiency compared to RCA and its practical performance in the Minecraft environment. Visual Representation These diagrams illustrate the Ladner-Fischer structure: Pink boxes at the top represent inputs (0-15 for a 16-bit section) Gray boxes (S1, S2, S3, S4) show the four computation stages Bottom gray boxes represent outputs, aligned with their corresponding inputs The structure demonstrates how carry information propagates efficiently through the adder, allowing for fast, parallel computation even with large numbers.
Roman Aqueduct Section
Marwan • ID: cpw2Ap
Roman Bridge Section
Marwan • ID: 68rrRS
Blinky (Pacman)
Marwan • ID: 1LdXIm
Kirby (Pacman)
Marwan • ID: dCyKxc
Mario
Marwan • ID: LpCl9_