Code:
actMod1 | actMod2 | actMod3
notAM1 | notAM2 | notAM3
actMod# -> notAM#
notAM1 -> actMod2
notAM2 -> actMod1, actMod3
notAM3 -> actMod2
-- neighbours
=> Everything can toggle everything
------
Damage Control Grid:
- Clock:
- delay -> not
- not -> delay
- delay -> not
- Signal:
- delay -> equal[for gridN]
- not -> actStart[gridN] -> actNext[gridN] -> ... -> actEnd[gridN] -> equal[for gridN]
- for each gridN
- equal -> act : "One sec memory for on" + or
- act : "One sec memory for on" -> or
- or -> red light "This section is damaged!"
- Equal module:
- WIP
- Memory module:
- WIP
- Displaying damage:
- "holographic room" with a cockpit pointing on a holographic table/wall
- A miniature-ship (1 block per 32^3 or 64^3 blocks?) to display damage
- can be split into bot-top and top-bot view - or similar
- This miniature ship has red lights
- On = section damaged
Reliable Clock (WIP):
Maybe you know the default Clock: Delay1 -> Not1 -> Delay1
The problem that occurred in my Damage Control trial was, that both are active for a very short time.
This bugs my "blink->constant transformer" (act1 -> or1 <-> act2)
Ironically, with (act1 -> not1 -> act2 -> not2 -> act1) it works as expected.
------
Challenge: RSA with ingame logic
small = 32 bits
big = 64 bits
special = for big*big (%n)
Step1: encoder/decoder:
big n
small: e=(about 2^16+1) (used as inverse counter) or d (as counter if you want to hack it, else inverse)
(e>0; e--) or (d>0; d--) or (d++ and continue hack) => yes -> continue
The challenge is to create a circuit which can multiply huge numbers and optimize it for a lower result size by including modulo into the multiplication circuit.
The progress of this project depends on if I found a practicable solution for this challenge.
big = 64 bits
special = for big*big (%n)
Step1: encoder/decoder:
big: source
big: code
special: intermediate result -> intermediate resultbig: code
2 values in parallel
a switch should redirect access (read+write) to value 1 to value 2 in vice versa
a switch should redirect access (read+write) to value 1 to value 2 in vice versa
big n
needs to use modular on intermediate result.
small: e=(about 2^16+1) (used as inverse counter) or d (as counter if you want to hack it, else inverse)
needs increment and decrement.
(e>0; e--) or (d>0; d--) or (d++ and continue hack) => yes -> continue
The challenge is to create a circuit which can multiply huge numbers and optimize it for a lower result size by including modulo into the multiplication circuit.
The progress of this project depends on if I found a practicable solution for this challenge.
------
Feel free to continue this thread
Last edited: