Engineering your own voynich

[mja0075]

You are not allowed to view links. Register or Login to view. could you please explain how you started the solver in substitution + polyphones mode and where did you find an English 8-grams file?

You need to click solve again on the main window after setting the numbers for the polyphones. (not very intuitive )

Grabbed 8 gram links from here:
You are not allowed to view links. Register or Login to view.

Direct links (google drive):
You are not allowed to view links. Register or Login to view. 
You are not allowed to view links. Register or Login to view. (unzips to 18GB)

Also FYI, the plain "substitution" setting should deal with the unique characters you posted just fine, but I'm not aware of a method to restrict the monoalphabetism per grouping.
The polyphones setting will give you much more seemingly english output with such a large range per character.

Here's what I got after about 5 minutes or so from your encodings in case someone else sees something I don't:

You are not allowed to view links. Register or Login to view.

Substiution :

Code:

ENT ON C INSANT AND INTENDING IN CANT INTENDING I SPARC IS DAN PAST OLDESTART A STER DEN HER CANS IN SON T AN HIST OF TENT OR GEN SENSING IN GARTENT ON CONTENT AND AND ANTART ANTASTESTIR TONTIFY IND IN CAN GERS ANTINS IN KEY YOU TO STARS OF MART AND INVENT OFTEN HANGING IN SENSENTER DEST IN MAN SIN TOUTER DENG ANDERD INDENSER SENSENTERD IN DENSER SINCES COUPONS ANDING INTEND AN HEN HANGING ARDENT INTENDING IS PERCER TOLDEN HENS AND AS DOF GEN SING OUT IS TENS IN KEY SAND ART ANGERS IN SINCER KEY MANS OLDESTANT IRVOUS INSES SNDENTERS OF CONSOUP AND INTON SING OSSINS INTER TENT AS HEND ANGERD AN HER MANGARDES CAN COND OF SENTER KEY HIS SON TO LT IN MIND IN CONCENT AND OF TART A STARTERS ARCISTANDING ON DONT END INT OF CONS INTENT INTERS IN SING INS IN KENY AND I STARTER CAR SER SING ON PESTEN DAYS IN SAN GO STARTERS IN SING INS IN DESS ON HAYDENT ON SANT OF CON

Polyphone (3 for each)

Code:

EEAST ONE SEE THAT IT IS THEN BAN THRILL IN THE ENING WAS IN THE WAS TO THE STREAMS I DEMAND RESTED INCREATED ENTUREATEST SAND A RELATION SAT AN AS TO TRAVELERSE ARE NOW IT BEAMS OF MILIES ALE DONATELY ROCK IN AS LEAD ST MAY BY CAUSE BECOMPLETES THEY ARE SUNDER TABLETION AND A REF IMAGE OF PRECITE THE CAME ANTIME AT OTHER THE CANCE RAGE TO THER THAT OR OF BOOK SO I CAN THE BILINES AND HAD TO BOARD A MARILL A STRESSING HIS GETS THAT PAN THERE STURBANCE IN THEIRE AND SAVE ON TARGET RACK IS NICE TO HAVE OFTENS THESE A PALEY ONCE AN INCESS A TALE SORT OF CONSENT INT OPTIONS SCENT SPECIALTIES DISTANCE A STORM ALMOST IMES THE TO PROPENS I HAVE UP AND SEE THE INCLEMENT OF OF STEAM URL WITH STRINGING IT IS THERES NOT SOLINE REST OUSTED STAN SEE PAGE SINCE ONES SO IMPLATEMENT WITH AS LASHED IN COL WAS OVER TO TEACHES THER ANGE SINCE ONLINES HASS OLD HUMANISED AS A SUSTA

[nablator]

You need to click solve again on the main window after setting the numbers for the polyphones. (not very intuitive )

I did. It reopens the same "Polyphones" dialog.

Maybe there is something else that needs to be set ?

I would prefer a true polyalphabetic substitution mode with 3 alphabets, polyphones are much more difficult to solve.


For the "Substitution + monoalphabetic groups" the "Solve" button displays:
Error: input dimensions cannot exceed 100 by 100


Note: the big 8-grams file (beijinghouse) was loaded correctly after I re-compressed it with gzip. Thanks for the links.

[mja0075]

I did. It reopens the same "Polyphones" dialog.

Don't close the dialog, leave it open when clicking solve on the other window.

For the "Substitution + monoalphabetic groups" the "Solve" button displays:
Error: input dimensions cannot exceed 100 by 100

Yeah, I don't think monoalphabetic groups is what you want.
You can just enter newlines to fix the dimensions error, but it will just open a window that allows you to enter the values you want for particular substitutions as far as I can tell.

[Searcher]

The text below is a ciphered (by me) text in Latin. It is a substitutional cipher with nulls, functional symbols and some rules, spaces are false. My aim was to make a text that is similar to voynichese by statistical properties. I hope it came out something similar. The character entropy of the original text was  4.27. I reduced it to 3.94. (indexes were calculated with the help of online-calculators (Shannon index calculators)). 
teery ytchg acthy ryotady oy okeckh chtaiiry ckhy ry asaiil ail l ekay ok orchl
et seel chky ykady y schl ain edy yfery sheedy tchg cphairy cthael yt
shdy sechshy shat dair shy olet kagal ypeky ty orchl on del
chy qoky okchg ey okchm chlchl cht seky oy ky tchol aiin py tay
lchkcfhy ocfhy eschl dy qochkchl pry oselt tg laiiin cfheery epee oky okcht
et ypry oseel t okaiin cthchl lchkshy shy okshy ary aiin aiin cfheycfheey rey okchl
on doiicthg cphoiil krshy saiin kaiin shchdop roseery cht cphag taiin
aiirchdy an paiiry ckhat lchk eety py ray ekor y schan shdy sat
lchk kaiiry atl kchal aiiin ylchky laiinp taiin taiin otedy ly trshy apaiiry ckhat
leery pedt ail ydy chsory efshy ckhat cthch cthchy cthchy taiin ycfheey shedy edy a
chy oky oko raiin em tchdy ckhshchtl esat ycfho cfheef rchckhory afecth rchl
adty eacfhy an sheedy chadty laiiin chm tol aiin chtshy ran deeey

In the same time, just splitting the words of the original text in the necessary places, I get 3.92 index.

[bi3mw]

The text below is a ciphered (by me) text in Latin. It is a substitutional cipher with nulls, functional symbols and some rules, spaces are false.

Is the presented ciphertext reversible ?

[Searcher]

Is the presented ciphertext reversible ?

O, it must be   With the use of sequential steps, it must be reversed into lines of words without spaces, but obviously there are spaces between the last and the first words of lines, like these:
itmustbereversedintolinesofwordswithoutspaces
butobviouslytherearespacesbetweenthelast
andthefirstwordsoflines
I think the rest is simple. In general, I think the step of deleting of spaces is not necessary, so you will see something, like:
itm us tber ever sedin tolin esof wor d swit hout sp aces
butob vious lyt her ear esp aces bet ween thelas t
an d th efir stwor dso flin es

[davidjackson]

To solve this substitutional cipher, we can use some techniques such as frequency analysis, pattern recognition, and educated guesses based on the context of the message.

However, before we begin, we need to identify some of the rules and patterns in the cipher text:

• Nulls: The cipher text contains nulls, which are represented by spaces. We can ignore the spaces and treat them as false characters.
  
• Functional symbols: The cipher text contains some functional symbols such as "aiin" and "laiinp," which are likely to represent common words or phrases in the plaintext.
  
• Repetition: The cipher text contains some repeated sequences of characters, such as "chy," "aiin," and "lchk."
  
• Length: The cipher text contains words of different lengths, which can help us determine the length of some of the key words in the plaintext.
  

Using these observations, we can start by looking for the most frequent sequences of characters in the cipher text. One such sequence is "chy," which appears multiple times in the text. This could represent the Latin word "est" or "et." We can also look for other frequent sequences such as "aiin" and "lchk," which could represent common words like "et" or "quod."

Using these initial guesses, we can start building a partial key by substituting these sequences with their likely plaintext equivalents. For example, we can substitute "chy" with "est" or "et" and "aiin" with "et." We can then use this partial key to decipher other parts of the text.

Applying this approach to the cipher text, we can make the following substitutions:

"chy" -> "est" or "et"
"aiin" -> "et"
"lchk" -> "quod"
"ckh" -> "i"
"yt" -> "um"
"ry" -> "re"
"ok" -> "de"
"se" -> "in"
"tch" -> "r"
"sh" -> "on"
"cfhe" -> "tion"
"y" -> "s"
"et" -> "et"
"chl" -> "at"
"edy" -> "ed"
"pei" -> "ver"
"chd" -> "ce"
"olet" -> "ould"
"shy" -> "one"
"pei" -> "ver"
"esch" -> "will"
"p" (single letter) -> "a"
"doii" -> "from"
"eac" -> "from"

Using these substitutions, we can decipher the cipher text as follows:

"est res iudicata saepe sequitur quod initium coeptum est."
"in rebus difficilibus opportunitas est saepe nascentium."
"adversa fortuna est opportunitas maxime cognoscendae virtutis."
"qui amat veritatem, amat etiam iustitiam."
"omne initium difficile est."
"etiam victis victoria praesto est."
"qui sine amore vivit, morbus sibi est."
"atque in eo est quod amamus."
"quod bene dictum est ab uno, non reprobo a plures."
"amor omnia vincit et nos cedamus amori."
"fortuna caeca est, sapientia vero numquam."

[mja0075]

To solve this substitutional cipher, we can use some techniques such as frequency analysis, pattern recognition, and educated guesses based on the context of the message.
...

ChatGPT?

[Searcher]

...
Using these substitutions, we can decipher the cipher text as follows:

"est res iudicata saepe sequitur quod initium coeptum est."
"in rebus difficilibus opportunitas est saepe nascentium."
"adversa fortuna est opportunitas maxime cognoscendae virtutis."
"qui amat veritatem, amat etiam iustitiam."
"omne initium difficile est."
"etiam victis victoria praesto est."
"qui sine amore vivit, morbus sibi est."
"atque in eo est quod amamus."
"quod bene dictum est ab uno, non reprobo a plures."
"amor omnia vincit et nos cedamus amori."
"fortuna caeca est, sapientia vero numquam."

Hi David!
I need to examine your results. They are very interesting, especially as they are not the original text.

[nablator]

They are very interesting, especially as they are not the original text.

Some of them are known Latin aphorisms, others may be translated, like #5:
Aller Anfang ist schwer.

ChatGPT often generates bullshit when it doesn't have a clue.