I recommend asking this question on official TPT forum to get better answer, since it is hard to write anything useful here
i "kinda?" understand but wtf did you just say. I honestly think i need someone phyicaly to explain this sht to me because from what i understand. You make a full adder but you use the carry result of the same adder as an input and reapet that until there is no carry?
id:3093220 is same thing but does all that in a cycle, making it more compact but slower
SrSbecause: Only thing you really need to know to make an adder using FILT is half adder, which is just a XOR gate and an AND gate, which result in 1 output bit from XOR and 1 carry bit from AND, in my variation of FILT adder I use half adder on all bits of 2 input numbers, then half adder on carry number shifted left 1 bit and output number 26 times, then XOR on same thing
SrSbecause: then I need some more context. What do you use most in your computer: filt or inst or smth else?
resicuts: it didnt help at all D:<
Update: Made an instruction writer for it (id:3141378, link in the save)
SrSbecause: id:3093220. I think that could help
is there someone who would teach me how you make a FILT adder because thats all i need for a computer at this point
Update: NAND is now replaced with 28-bit addition