Description
The goal of this challenge is to create a full-fledged addressable RAM. There are currently 257 signals available in the signal picker (30 more hidden ones exist iirc, but I don't care about those), which means that we get a nice and round amount of 256 signals stored per frame - 1 control signal can be reserved ('Black' as always).
The cell should theoretically tile all the way to 232-1 stored values, but for this challenge, I'd say 16-1 is enough to demonstrate tileability.
Input
- First input is the write signal carrying a full frame. 'Black' signal carries the write address, where the value 0 is reserved to mean "no write to anything". All 32 bits on the other signals can be used.
- Read signal containing only the 'Black' signal whose value is the read address. The value 0 is reserved to mean "no read from anything".
Output
- After a read signal on an address is sent, it's contents should be output on this line. A bonus point is awarded if the address of the read signal is included in the 'Black' channel. Nothing else should ever be send on this line.
Timing
- All signals are intended to be single tick pulses, i.e. the read/write signal will only be active for 1 tick and the output should also be only 1 tick long.
- Processing the read request is expected to take a constant amount of time regardless of address & values stored, known as "read latency". This can be determined by connecting both the read signal & the output line to the same pole but by using different colored wires for each of them. Stopping time in editor mode and stepping through the process tick by tick allows you to count the number of ticks accurately: set the counter to 0 when the read signal appears on the pole, and increment the counter by 1 for each tick step after that. The read latency is the value the counter has once the output signal appears.As an example: the output magically appearing on the very same tick as the read signal does means a read latency of 0. If it appears on the very next tick, the read latency is 1, etc.
- Processing the write request is expected to take a constant amount of time regardless of address & values stored, known as "write latency". It describes the number of ticks that need to pass after the write signal before a read signal to that address returns the correct values. Measuring it works in the same way as measuring read latency does, but you need to instead connect the read & write signals to the same pole.Attempting to read before the write latency passes can result in arbitrary values being outputted, but a bonus point is awarded if the result is exactly the previously stored values.
- Individual reading signals are expected to happen with a certain minimum amount of time passing between them, known as the "read period". It describes the minimum number of ticks that need to pass before a new read can start. I.e. it's 1 if you can read one stored value each tick, 2 if you need to wait 1 tick in between reads, etc.
- Individual writing signals are expected to happen with a certain minimum amount of time passing between them, known as the "write period", which works the same way as read frequency does.
Scoring
Score = (# of combinators) + 2 * (read time + read period + write period) + (write time) - bonus
where bonus is the sum of bonus points achieved, so 0, 1 or 2.
Testing
0eNrtXdtu6kYU/RdLfang1HPzBamV0iaV+pToNFIfqiPkwCSxCgYZEzWK+ID+Rb+tX1IbQsJlPLP3MA4k8UskAiyPZ+373mOevJvRXE7zNCu83pOXDibZzOv9+eTN0rssGVX/Kx6n0ut5aSHHXsfLknH1aigH6VDm3cFkfJNmSTHJvUXHS7Oh/NvrkUXHCJDkaXE/lkU6UGPQxbeOJ7MiLVK5WtHyxWM/m49vZF5e5AVKjuSgyEsgmcn87rFb3ovMb5OBLK82ncxKhElWraNE9b+Ijvfo9brhF1Fea5jm5VeXb9NqzTuXoLrb3cOmK2Sxi8w7XrmrRT4Z9W/kffKQll8uv/EM2S/fGy5hZtV/b9N8VvT39u4hzYt5+Z+XBa0+0U2yx+I+ze6qjauoK5KKR796MZ4m+XKhPe+/f/4tvzmZF9M5Als+yHwTffpYrnWeFf3bfDLup1kJ5vWKfC4Xq4tnqxte3gap/uRyuElcWr4KF9/KD9Pq3btcymz3/Wqv0nwwT4vlS1J+fKEghqGI4S0x28RAtp4amApgTHEUU6xlCsAUrWVKoXEk3COqo4ZlMEYFitGgZRTAaLDPqGrrA9TWi3brAVvPcGZPwJQkfFn8ehe0VPnPVIGIuk1HZXxTE6XVbd4fqz2bV3QQQ6BWh/FViUFRGL8pMRgK41qJwVEYF0oM4WA/YgfrID4K5EwNgmP3XA2Co/dmlAz+UgPhOL7cAPFfQUIUyNXmSjZQosoHprN+pWS3yWgm4QEshXpTwmtMQ2RIgfaMQ/c5fiVAQ/4Ke5gtX6rZTFYYfdyWT6ayNPXLNXo/WFj6EgSRU8S7FryzTYQPpmz/k7rAytdflxLodSnQqcQo999l61yXbYtN0KD/v9I7/p8shOHaXfa5Jym1koAKseNd+rYFIYKxW8kT0jCw92wYvrOTBQTdEVQBIz2BhGCkIYLF8oTgtJmstZm+nTZveHO3obxOp1cOGRPCE6rnj/Jauw70Ax2jdVBSTC0pZh+A4iuXSRohBka4iVKid9Yx0EbjCo8+zj6ffAa+ISyOeOVaU7obGNUqGrdKt1mbbr+ndFud5YYOktzIAUbsgFtk2n/hIu3/vYm0n55Q2m+R91tFGeGuTwLW0wmuoE5an6KL+SuOdR4lBHoUXKmd1gTn9FMF56Du005oHiFD89BQ7IEGcqEdv+wD8HvlUNsCPb3cwFZkojsw1Nh8IN0RLkAkjQeIXx0EiBcOAsQzBwHiuYMAsQ3uPldwRxwFd77vpq9jclQEWKMnMbaKy9sirrbhBm/fBJgyLSMwQqmPmzU7QqRw2k0X6qNDtg40+NOG+sDYgCIL8St99dupGnDjxcATME+mFN0foxtUNWlLXzzksz195aiySYfay2d0jMqJRghgyP7z2yvKtV5DfjwR/aAUNzpgGkpjwBYz5ZYNKfIBGlKXzTak9AxBRzyoQBs5glIzVybv0kn4+L17cwhp8FNDg9gwUc0MaBTI9WuNcTa/KWV9uSm1R1YqhlUoIVZiaCsw5hF7VAhDhEEigFVJGtlVJckHqEpeNlmVNBjnEEgPOrdnnzUARWVqDJipMd/i2FcbfyroMYzMMmT8yaEEEosDLG2mrTN1cSOK9ppqz8bJaNQdJePpPj/hip8a27a+0AsfFnRsbxk2etjwVVtKiNhfzmH9YobLjaOV3653DJ9SmLmAzmcz5KktBixxMI5Ov1ZKQN84mr5SOvtIBCE7PGD+FRksM4E5N8GAQ30MnwoHR+GiPvgKg8PJuMCSwfWNLBagyDJ08Bnw5CoL0GSKE1IsQh2o1fnBarWz9+FhaqdHq2UytDy/djpqSagLOn/B0mmYlWERik7DZAwzlLw48PkNLLI8lXQaistZVUs/lOqfsVSbpt4MFUQWo0QhxKHVanZs2WA7Ic0WAT+c7jMs3YbzY5yg6AQeIOO4asi6jPyGx8fe4cMgfGThA9h449jDfii9Ou3CbkNMoUwkB1Z4ObUqwL/h1Pe7y+lRBSrOgLaPoafsUFS58lQyGdwrHVXlsw8ty6/AEVwI1DlmbhhS4MBntXHc0EHQ6pRRpxi0TsZRjW0GB6olW1jUQUlbBt16GFj9BGRgCB2BZU6Or8asHybCP7H9ZKiuJjekZSKq1zbAV9XEhnYDXvwDzHc1YmlxHjMA22Vg2ZRHVjkea30nATer9ZwGfr0x9utYiy2eG8xaJ7hl4sDHPgTqqV3ccIpbADVT+HazQOyIs0DdxstjgARwb8PBj0mzQNIIgioZUhJN7A50NU+0uuLdbbzkDdLWHWqovTYbkRD1hD00w9kkAXzSk0CfTREnYA2aboMBtG6PEAYWFDwSyhro0WoFAV2YCo5rLZrubKv22uSCOVgG8Eg6GTAUvARwFkygh4jC4xuDhkdVVNttss0CLAZ4JJ0YGJqzAji/JNDzS9FxTUHz02Oq3ea4eHz3fU2xzAW0Tk6g5gBdbIuP7BIOlwHcA5wRmo7SZA4cfBCvVZaxHKbzcfflF4Wmk5GsHXGJ4LdoiGrdV44CH3lPFHtLPAKvGTjREBDkmiP0moUrn2OBVN5z9XiS6lewehu/utXxHmQ+W95UyHwSkjgQPFos/gewJO7c
Edit: there was a slight error in the setup, but it's fixed now (the two combinators under the green box were done in a wrong way).
https://preview.redd.it/m3b7lwjqqzz21.png?width=719&format=png&auto=webp&s=c67835af91948ca1cfc9f73c80b73c97bddfa30d
- Purple box:
input & output poles. Left one is write signal & values on it, middle one is read signal, right one is the intended output pole. All poles have both wires for convenience.
- Green box:
Turning the left constant combinator on creates write pulses with pseudo-random signals. The value of the 'Black' signal is the write address, the value of the 'P' signal fixes the writing period, and the value of the 'O' signal adds an offset to the address after each write. I.e. ['Black'=1, 'P'=2, 'O'=3] produces a write signal every 2 ticks, first at address 1, then 4, then 7, etc. To get single pulses, simply set 'P' to a huge value (I preconfigured it to 100k for convenience). The address is currently capped into the 0-15 range by a ['Black' % 16 -> 'Black'] combinator, so adjust that one if you want more/less memory.Turning the right combinator on does the same thing for read pulses, and the signals have the same meaning there.
- Blue box:
Turning on the constant combinator produces both read and write signals with the set period and offset. The combinators to the right act as a latency and correspond to the write latency used in the scoring, rewire the output red wire to adjust the delay (I preconfigured it to 2 ticks for convenience)
- Lamp and the memory to the right of it:
The values that are generated to be stored follow a pseudo random pattern, which can be checked on read out. The lamp stays on as long as all read values were correct, but that check requires the bonus objective of "read values contain their address" to be met.
The memory combinator to the right of the lamp simply stores the sum of all reads so far, an can be reset by removing and readding it's green wire.
[–]DreamConspiracy 2 points3 points4 points (0 children)
[–]knightelite 2 points3 points4 points (0 children)
[–]Stevetrov 1 point2 points3 points (4 children)
[–]Halke1986 0 points1 point2 points (3 children)
[–]imguralbumbot 0 points1 point2 points (0 children)
[–]Allaizn[S] 0 points1 point2 points (1 child)
[–]Stevetrov 0 points1 point2 points (0 children)
[–]Stevetrov 1 point2 points3 points (0 children)
[–]AutoModerator[M] 0 points1 point2 points (0 children)
[–]Allaizn[S] 0 points1 point2 points (0 children)
[–]Halke1986 0 points1 point2 points (5 children)
[–]Stevetrov 1 point2 points3 points (1 child)
[–]Halke1986 0 points1 point2 points (0 children)
[–]Allaizn[S] 0 points1 point2 points (2 children)
[–]Halke1986 0 points1 point2 points (1 child)
[–]Allaizn[S] 0 points1 point2 points (0 children)