Okay, let me reveal what's
#hidden and how it is hidden, because the odds are that this post will fall into Internet oblivion anyways.
First, the #RegExp is very clear: replace occurrences from both "VOID" and "ZERO" with a "0":
"Lovely fire, darkness hideout. Jester I am: 0 innocence. A beast fought, instinctively awakened...
Defiant hunger, jokingly irradiating another 0 iridescence. Darkness hugs: Lady Fatale, a beautiful and angry blasting force. A wrathful lust, for I endlessly await being found inside a deadly hug: lemme go!"
Now, for each line, take every #acrostic (a.k.a. the initial letter), ignoring both the case and the punctuation:
L F D H J I A 0 I A B F I A
D H J I A 0 I D H L F A B A A B F A W L F I E A B F I A D H L G
Take the position from each letter (A=1, B=2, up to Z=26), except if it's zero, as zero means zero:
12 6 4 8 10 9 1 0 9 1 2 6 9 1
4 8 10 9 1 0 9 4 8 12 6 1 2 1 1 2 6 1 23 12 6 9 5 1 2 6 9 1 4 8 12 7
Now, the part which depends on knowledge from both #electronicengineering and
#programming: from left to right, concatenating digits when needed, find which decimal (base-10) corresponds to a 7-segment display digit. For reference:
0=>126, 1=>48, 2=>109, 3=>121, 4=>51, 5=>91, 6=>95, 7=>112, 8=>127, 9=>123 (if you roughly feed one of these numbers from an #Arduino or
#Raspberry to a 7-segment display, it'll display the digit you're referring to)
Let me do the first line:
12 6 4 8 10 9 1 0 9 1 2 6 9 1
126 (0), then 48 (1), then 109 (2), then 109 again (2), then 126 (0), then 91 (5).
So the first line results in 012205.
Now, notice how it's an even amount of digits, and how every 2n'th digit ranges from 0 to 2. It's on purpose: they mean pairs which mean a numeric position within the alphabet:
01 = A, 22 = V, 05 = E. It's "AVE".
Now you know how to decode the second line.
I don't have a name for this #cipher: AFAIK, it's a novel cipher. My point is not to invent something, or to seem/feel superior: my point is that everything can be turned into a ciphering method
. For example, one can spell aircraft registration numbers that will map to their respective manufacturers (Cessna, Bombardier, Embraer, etc) and models, then to their acrostics to form a word. You can map letters to digits that, when read through a given numeric base (e.g. hexadecimal), will map back to other letters. Possibilities are infinite, literally infinite.
Check my other posts where there are other (fairly easier) ciphering methods, if you wish to see more like this...RE: https://calckey.world/notes/ab42zffp0z