As an amateur who's been fascinated by this puzzle himself, I will add some context that might be relevant in assessing the plausibility of this claim:
- The "Libation Formula", which the author used as the base for his translations, is the most studied piece of writing in Linear A, because it's the only recurring phrase (with grammatical variation) that we have. The corpus is extremely fragmentary, with just a handful of instances of longer text (and even then, the texts are the length of an average sentence in English). The majority of documents available to us are lists (of inventory, personnel, offerings or something of this sort). The longer texts make use of punctuation marks, likely put in between words. This gives us a non-trivial vocabulary, which still does not match that of any known language.
- With such fragmentary remaining material, we cannot be sure that a) all the texts we call "Linear A" are written in the same language, and b) the recognizable words are not abbreviations, for example.
- The author made an assumption that Linear A symbols which have counterparts in Linear B should have the same phonetic values. This gives us an already known glyph that represented "NA". "Duplicate" glyphs are only found in the P-series, and are assumed to represent syllables which were distinguished by the Linear A language, but not by Greek - such as aspirated/unaspirated P. There is a glyph that stands for "NWA" in Linear B, but instances of it have been found in Linear A as well.
- There are countless words with no known etymology in Ancient Greek, assumed to originate from a substrate language or languages spoken in the area at the time Greeks migrated to their present-day homeland. The language of Linear A would be a likely candidate for such substrate. If Linear A were a Semitic language, then we should already be able to establish Semitic etymologies for those words as they were in Greek. Of course it could also be the case that these words came from an another language which did not adopt writing or its writing did not survive to our times.
An in addition to that, a vast majority of documents are lists which consist of a "header" (1 to 3 words) and word-number pairs afterwards. An another common class are small clay seals with 1, 2 characters carved into them. It's likely that in both cases, we may be dealing with abbreviations.
Some of the lists end with "ku-ro" and a number that's the sum of all the previous numbers, oddly frequently off by one.
Surprisingly this comes up more then you'd think, for instance in Ancient Rome, tomorrow is two days away so all the dates are off by one from what you'd think it was. They mainly count down and it goes, 5, 4, 3, day before, day.
As observed by archaeologist John Younger, the entire Linear A corpus takes up only 1.84 pages of letter paper when typeset in 12 point font and 1-inch margins.
A lot of loonies make this claim, but Tom's work is credible enough that it's being reviewed by linguistics experts at Rutgers and Cambridge. Additional validation: his approach produces results. He's translated over 300 words, and that's never been done before, and his solution actually solves some problems in Linear B. Tom is an AI engineer, and Claude Code was key to his work. Disclosures: I know Tom socially, and I wrote the post at the link.
You're absolutely right! We've opened a ticket with the Linear A folks, hopefully they'll get back to us soon with an update as to whether we've got it correct or not. Hang tight!
I mean it's not like anyone could objectively go back in time and query ancient civilizations for what they meant, but presumably it means the verification heuristics, they have currently, pragmatic success, and expert solidarity means that it is "verified"
It seems this is still extremely early in the process. There is an apparent finding that was shared. Evidence which would be the basis for a paper is "being reviewed by linguistics experts at Rutgers and Cambridge". So they are trying to do the right thing by talking about what they believe they have done but holding off publication and serious claims until later. The general idea that written forms can be categorized by systems built with Claude could be applied to other as yet undecipherable languages could be used by other interested investigators just with what is discussed here.
> The general idea that written forms can be categorized by systems built with Claude could be applied to other as yet undecipherable languages could be used by other interested investigators just with what is discussed here.
Could you rephrase this or explain it more thoroughly? I don’t follow. What does it mean to categorize a written form by systems built with Claude?
The original prompts aren't provided, nor is the original context; even then, you can't really treat a stochastic system like an LLM as a major component in reproducibility.
Every day when you lower your butt onto your chair, you trust a stochastic system enough to assume you'll rest on the chair safely and not spontaneously phase through, which would lead to rather gory and painful terminal experience.
Physics at macro scale is stochastic, which is a good reminder that stochastic != uniformly random. Expected distributions matter.
Claude code was used to organize the material and to run simulations. The simulations were to determine the likelihood that the text was Semitic vs Tom got lucky. Tom has assigned probabilities to each of the syllables he has proposed sound values for.
> even then, you can't really treat a stochastic system like an LLM as a major component in reproducibility.
If you had the other things, being "stochastic" is not even remotely a show-stopper. Stochastic processes abound and are the reason the mathematics of statistics was developed in the first place, ultimately allowing us to create such things as LLMs.
When all the relevant steps gets published, I absolutely expect a lot of people to (attempt to) reproduce this work even though LLMs are stochastic.
My issue with this is that it's a form of "soft" reproducibility, where it'll work for many (maybe even most!) people, but that depends on the way the original prompt was formulated (read on) and the state of the random noise in the system.
On the prompt formulation; prompts with very similar formulations (in terms of both semantics, hamming distance, or both) can lead to _wildly divergent_ outputs in my experience. It's not rigourous, and when that divergence happens, it's extremely difficult (arguably impossible, by nature of the architecture of transformers) to identify why the divergence happened and where.
Sure it is. We're humans, not robots (well, I think I am, and I presume you are as well, but for all we know, we could be living in a simulation), so if the non-deterministic system decides to generate code that calls the variable foo one day and bar the next, as long as the code still does what's being asked of it, why do I care that the non deterministic system chose to call the variable something different when run on Tuesday? There's the computer science definition of determinism and the engineering result of "does it work", which are at odds. It's like the halting problem. We haven't solved the computer science definition of the halting problem, but give some C code with a loop that won't terminate to Claude, and it'll call that out as not halting.
All things aside, I think this misses the forest for the trees on the halting problem.
It's not about being able to throw claude or codex at a loop and having it evaluate it for halting, it's about being able to do this for arbitrary code. Computer science rigourously defines the halting problem as not computable and undecidable. within the framework of using something akin to static analysis using any deterministic Turing machine.
There's not really a question of "solving" the halting problem like there's some as-yet unknown way of generally figuring out if arbitraty code halts. Turing proposed a proof in 1937 in favour of undecidability of what we now know as the halting problem, building on ideas first articulated by Church a few years prior.
Frankly, if anything, it's reasonable to say that the halting problem's been solved, just in the direction of undecidability rather than decidability.
Anyway, back to LLMs; as code gets more complex, the robot will need a bigger context window, more hardware resources, and more time, all of which will be variable due to the noise inherent in the system. It'll be difficult to put a useful upper and lower bound on how much computing power and time it'll take to figure out if a program ever halts. Which is all a bit moot, frankly, in the context of halting, but useful to keep in mind in the more general context of using these things as analysis tools.
A little bit more. If you ask ChatGPT to "solve linear a" it thinks you mean linear algebra. If you specify that it's the Minoan translation problem, you get a table similar to the one that we get a glimpse of in the without access to the paper, we can't say how much more work the paper has than my gist.
Amazing work and refreshing to see a well written and cogent post to summarise it. Would love to hear more about how he used Claude to help solve the puzzle.
Claude helped, it did not do the work. It would have taken Tom more time to crack on his own, and it would have been harder, but the key insights were Tom's not Claude's.
The thunder is as per the headline. Assuming it passes review.
One of the things I find weird with AI is how the dismissals of work that involve AI splits into two camps: like yours, saying the AI did the work while the human played no role and deserves no credit; and those saying the AI rips off its training data while the human using it played no role and deserves no credit.
I exist in both camps. Claude can’t launder human achievement into a different person. Claude stole it, but it’s still in Claude’s possession and is not transferable in any durable sense.
> Claude stole it, but it’s still in Claude’s possession and is not transferable in any durable sense.
No human, individually or as a team, has been able to solve this to date.
To the extent this was Claude solving it itself and thus denying Di Mino any thunder, there was nobody to have stolen anything from. To the extent he has thunder to be stolen, it wasn't ever in Claude's possession.
This is very exciting. Congrats to Tom on the accomplishment.
To be clear, this is an attempt at a decipherment. This is not proven, and we shouldn't consider Linear A to be "solved" until experts in the field have reviewed the work. In fact, it probably shouldn't be considered "proof" unless some more Linear A writings are uncovered and these are congruent with the method proposed. All that can be said for certain at this point is that this is an interesting conjecture.
But this is a story worth following. This could be the real deal. More research and validation should follow and we should have a better idea in the next few weeks or months whether Linear A has really been solved. At the very least, this is an interesting attempt, and optimistically, it could yield real insight into Minoan culture. Kudos.
Isn't a big problem with Linear A that there are so few symbols you can "solve" it relatively straightforwardly with no way to tell if you it's correct or not?
If confirmed this is really cool and impressive work.
Honestly curious how many years before it can be one shotted in a coding harness with Fable.next by someone who’s not a linguistics expert.
Develop, test, and rank hypotheses about the phonetic values, morphology, grammar, and possible language family of Linear A using the full available corpus. Do not assume any decipherment is correct. Treat all candidate readings as hypotheses to be scored…”
I haven't talked to him extensively about how he learned his engineering skills, but he is I believe 100% self taught. His background is in copywriting.
Alot of the comments in this thread are disappointing. Rather that celebrating an achievement (whether or it is validated yet), many of you seem to want to put him down, or make it seem like claude did all the work.
Claiming that claude did all the work is patently ridiculous. Claude is a tool, like any other. The corpus of linear A is ~7500 characters across ~1500 inscriptions and claude, no matter how smart, doesn't just solve that on its own.
I think it is an open question: can an unknown language be cracked -- without any dictionary or grammar or understanding of the language? Just lots and lots of texts, maybe some of it bilingual.
It's a common misconception that is what happened with Ancient Egyptian with the Rosetta Stone. The Rosetta Stone was just one of the big pieces of the puzzle. The decoding came when people realized that Coptic (a language written alphabetically and still in use in the Coptic Church today) is actually descended from Ancient Egyptian; as Spanish is to Latin, Coptic is to Ancient Egyptian.
Similarly the attempts to decode classical Maya were all dead ends. Until Yuri Knorozov realized that it encoded the ancestor of the Maya languages which are still spoken to this day. (Knorozov's Wikipedia article is worth checking out just for his photo with his cat. [0] IMHO.)
I have written before about the La Mojarra 1 stele in Mexico [1]. It looks a lot like Maya. [2] But it isn't Maya. Maybe the difference like between Russian and Latin?
No one can read it. It's undecipherable. There are some attempts to identify it with a proposed ancient language that would have been related to the modern Mixe-Zoque languages: some of the glyphs that are shared with Maya, when read phonetically, start sounding like a Mixe-Zoque language. But no one has proposed a confident decipherment. There probably isn't enough text. La Mojarra 1 is the only long example of the Isthmian script.
Deciphering Akkadian was very difficult, at first. The process started with Persian; old Persian was written in a simplified adapted form of the Mesopotamian cuneiform (wedges on clay). It was a kind of alphabet. And Old Persian was already understood. And there was a bilingual text on a monument carved by Darius I. But even then -- decoding relies so heavily on the fact that Akkadian is a Semitic language distantly related to Hebrew, more distantly, also Ancient Egyptian. So again, we sort of knew what we were looking for.
That is all to say: even if the Voynich manuscript (for example) contains real text I'm not sure it is possible even theoretically to translate it.
Sorry but I don’t recognize this as being an achievement by an amateur. This dude had no chance in hell until we trained a model to use his time to suss it out.
I drilled down on this with Tom. He thinks that it might not have happened without Claude Code, but Claude was used to organize all of the symbols, and to run I think it was 100,000 simulations to assess whether or not he had an actual insight, or if he just randomly got lucky. Claude did NOT crack the code. Significant supporting role though.
Assuming this pans out, every other professional linguist in the world has had the option to use Claude or other LLMs, but has not solved this problem, despite the incentives for doing so. It stands to reason the human is adding crucial value.
As an amateur who's been fascinated by this puzzle himself, I will add some context that might be relevant in assessing the plausibility of this claim:
- The "Libation Formula", which the author used as the base for his translations, is the most studied piece of writing in Linear A, because it's the only recurring phrase (with grammatical variation) that we have. The corpus is extremely fragmentary, with just a handful of instances of longer text (and even then, the texts are the length of an average sentence in English). The majority of documents available to us are lists (of inventory, personnel, offerings or something of this sort). The longer texts make use of punctuation marks, likely put in between words. This gives us a non-trivial vocabulary, which still does not match that of any known language.
- With such fragmentary remaining material, we cannot be sure that a) all the texts we call "Linear A" are written in the same language, and b) the recognizable words are not abbreviations, for example.
- The author made an assumption that Linear A symbols which have counterparts in Linear B should have the same phonetic values. This gives us an already known glyph that represented "NA". "Duplicate" glyphs are only found in the P-series, and are assumed to represent syllables which were distinguished by the Linear A language, but not by Greek - such as aspirated/unaspirated P. There is a glyph that stands for "NWA" in Linear B, but instances of it have been found in Linear A as well.
- There are countless words with no known etymology in Ancient Greek, assumed to originate from a substrate language or languages spoken in the area at the time Greeks migrated to their present-day homeland. The language of Linear A would be a likely candidate for such substrate. If Linear A were a Semitic language, then we should already be able to establish Semitic etymologies for those words as they were in Greek. Of course it could also be the case that these words came from an another language which did not adopt writing or its writing did not survive to our times.
The reason linear A is so difficult is that the total remaining corpus of Linear A text is ~7500 characters, spread out over ~1500 inscriptions.
If you have a 4k screen, you can fit all remaining Linear A text on your screen at once, in 14pt high font.
An in addition to that, a vast majority of documents are lists which consist of a "header" (1 to 3 words) and word-number pairs afterwards. An another common class are small clay seals with 1, 2 characters carved into them. It's likely that in both cases, we may be dealing with abbreviations.
Some of the lists end with "ku-ro" and a number that's the sum of all the previous numbers, oddly frequently off by one.
It would be amusing if archaeologists in the future also end up spending countless hours trying to decipher my shopping lists and poor math skills
They hadn't yet decided whether to count from 0 or from 1.
Surprisingly this comes up more then you'd think, for instance in Ancient Rome, tomorrow is two days away so all the dates are off by one from what you'd think it was. They mainly count down and it goes, 5, 4, 3, day before, day.
Very vaguely, it makes it like a one-time pad where it can be anything you want it to be. Not quite, but so little text leaves a lot of options open.
As observed by archaeologist John Younger, the entire Linear A corpus takes up only 1.84 pages of letter paper when typeset in 12 point font and 1-inch margins.
when I first read the title thought he was talking about linear algebra and I was like damn it's not that hard
A lot of loonies make this claim, but Tom's work is credible enough that it's being reviewed by linguistics experts at Rutgers and Cambridge. Additional validation: his approach produces results. He's translated over 300 words, and that's never been done before, and his solution actually solves some problems in Linear B. Tom is an AI engineer, and Claude Code was key to his work. Disclosures: I know Tom socially, and I wrote the post at the link.
Let's wait until it's been verified.
You're absolutely right! We've opened a ticket with the Linear A folks, hopefully they'll get back to us soon with an update as to whether we've got it correct or not. Hang tight!
This comment sure is load bearing.
It's the veritable smoking gun
Regardless, we should stand ready, loaded for bear.
A Linear ticket, hopefully
How does an expert even verify something like this?
I mean it's not like anyone could objectively go back in time and query ancient civilizations for what they meant, but presumably it means the verification heuristics, they have currently, pragmatic success, and expert solidarity means that it is "verified"
Then why is there no link to the actual write-up?
The only write-up at the moment is my blog post, hopefully that changes in the coming weeks.
Presumably because it hasn’t yet been published?
It seems this is still extremely early in the process. There is an apparent finding that was shared. Evidence which would be the basis for a paper is "being reviewed by linguistics experts at Rutgers and Cambridge". So they are trying to do the right thing by talking about what they believe they have done but holding off publication and serious claims until later. The general idea that written forms can be categorized by systems built with Claude could be applied to other as yet undecipherable languages could be used by other interested investigators just with what is discussed here.
> The general idea that written forms can be categorized by systems built with Claude could be applied to other as yet undecipherable languages could be used by other interested investigators just with what is discussed here.
Could you rephrase this or explain it more thoroughly? I don’t follow. What does it mean to categorize a written form by systems built with Claude?
The same pattern/tech is generic enough that it might be able to solve other unrelated, and so-far undecipherable, written languages.
You can use Claude, like the author, to reproduce the result.
This isn't really a reasonable approach, is it?
The original prompts aren't provided, nor is the original context; even then, you can't really treat a stochastic system like an LLM as a major component in reproducibility.
> stochastic system
Every day when you lower your butt onto your chair, you trust a stochastic system enough to assume you'll rest on the chair safely and not spontaneously phase through, which would lead to rather gory and painful terminal experience.
Physics at macro scale is stochastic, which is a good reminder that stochastic != uniformly random. Expected distributions matter.
Claude code was used to organize the material and to run simulations. The simulations were to determine the likelihood that the text was Semitic vs Tom got lucky. Tom has assigned probabilities to each of the syllables he has proposed sound values for.
> even then, you can't really treat a stochastic system like an LLM as a major component in reproducibility.
If you had the other things, being "stochastic" is not even remotely a show-stopper. Stochastic processes abound and are the reason the mathematics of statistics was developed in the first place, ultimately allowing us to create such things as LLMs.
When all the relevant steps gets published, I absolutely expect a lot of people to (attempt to) reproduce this work even though LLMs are stochastic.
My issue with this is that it's a form of "soft" reproducibility, where it'll work for many (maybe even most!) people, but that depends on the way the original prompt was formulated (read on) and the state of the random noise in the system.
On the prompt formulation; prompts with very similar formulations (in terms of both semantics, hamming distance, or both) can lead to _wildly divergent_ outputs in my experience. It's not rigourous, and when that divergence happens, it's extremely difficult (arguably impossible, by nature of the architecture of transformers) to identify why the divergence happened and where.
Actually it is because Claude did the work and being a lay person isn’t really that high of a bar.
Claude helped, but did not do the work. This was a human dude who had a very helpful assist from Claude
Sure it is. We're humans, not robots (well, I think I am, and I presume you are as well, but for all we know, we could be living in a simulation), so if the non-deterministic system decides to generate code that calls the variable foo one day and bar the next, as long as the code still does what's being asked of it, why do I care that the non deterministic system chose to call the variable something different when run on Tuesday? There's the computer science definition of determinism and the engineering result of "does it work", which are at odds. It's like the halting problem. We haven't solved the computer science definition of the halting problem, but give some C code with a loop that won't terminate to Claude, and it'll call that out as not halting.
All things aside, I think this misses the forest for the trees on the halting problem.
It's not about being able to throw claude or codex at a loop and having it evaluate it for halting, it's about being able to do this for arbitrary code. Computer science rigourously defines the halting problem as not computable and undecidable. within the framework of using something akin to static analysis using any deterministic Turing machine.
There's not really a question of "solving" the halting problem like there's some as-yet unknown way of generally figuring out if arbitraty code halts. Turing proposed a proof in 1937 in favour of undecidability of what we now know as the halting problem, building on ideas first articulated by Church a few years prior.
Frankly, if anything, it's reasonable to say that the halting problem's been solved, just in the direction of undecidability rather than decidability.
Anyway, back to LLMs; as code gets more complex, the robot will need a bigger context window, more hardware resources, and more time, all of which will be variable due to the noise inherent in the system. It'll be difficult to put a useful upper and lower bound on how much computing power and time it'll take to figure out if a program ever halts. Which is all a bit moot, frankly, in the context of halting, but useful to keep in mind in the more general context of using these things as analysis tools.
somehow I suspect it was a bit more involved than: Claude, please solve Linear A.
You are correct!
A little bit more. If you ask ChatGPT to "solve linear a" it thinks you mean linear algebra. If you specify that it's the Minoan translation problem, you get a table similar to the one that we get a glimpse of in the without access to the paper, we can't say how much more work the paper has than my gist.
https://gist.github.com/fragmede/bbf277d36a2398065f109484f34...
You also have to add "make no mistakes"!
Unless if it was done by Fable!
The 'major insight' described in the article predates Fable's release by two week four days. It would be a complicated timeline.
Amazing work and refreshing to see a well written and cogent post to summarise it. Would love to hear more about how he used Claude to help solve the puzzle.
You know him socially but is there a reason you’re writing this rather than him? It looks like he has his own web presence.
Cynical read would be you’re stealing his thunder a bit by prematurely announcing this before it’s fully confirmed
Tom knows I'm a freelance writer and decided to give me the scoop. He's more interested in linguistics than he is in journalism.
Promoting your friends' work is hardly stealing their thunder. It's increasing their thunder!
Isn't it customary for the author of a post shared on HN to leave a comment on the thread?
I’m not referring to the parent comment: The post is not written by the author of the claimed breakthrough.
What thunder? Claude did the work and used a human to interface with experience and causality better.
Claude helped, it did not do the work. It would have taken Tom more time to crack on his own, and it would have been harder, but the key insights were Tom's not Claude's.
The thunder is as per the headline. Assuming it passes review.
One of the things I find weird with AI is how the dismissals of work that involve AI splits into two camps: like yours, saying the AI did the work while the human played no role and deserves no credit; and those saying the AI rips off its training data while the human using it played no role and deserves no credit.
I exist in both camps. Claude can’t launder human achievement into a different person. Claude stole it, but it’s still in Claude’s possession and is not transferable in any durable sense.
> Claude stole it, but it’s still in Claude’s possession and is not transferable in any durable sense.
No human, individually or as a team, has been able to solve this to date.
To the extent this was Claude solving it itself and thus denying Di Mino any thunder, there was nobody to have stolen anything from. To the extent he has thunder to be stolen, it wasn't ever in Claude's possession.
This is very exciting. Congrats to Tom on the accomplishment.
To be clear, this is an attempt at a decipherment. This is not proven, and we shouldn't consider Linear A to be "solved" until experts in the field have reviewed the work. In fact, it probably shouldn't be considered "proof" unless some more Linear A writings are uncovered and these are congruent with the method proposed. All that can be said for certain at this point is that this is an interesting conjecture.
But this is a story worth following. This could be the real deal. More research and validation should follow and we should have a better idea in the next few weeks or months whether Linear A has really been solved. At the very least, this is an interesting attempt, and optimistically, it could yield real insight into Minoan culture. Kudos.
Thanks, I hope Tom is right, but now it's in the hands of the pros.
Isn't a big problem with Linear A that there are so few symbols you can "solve" it relatively straightforwardly with no way to tell if you it's correct or not?
I wonder how you would even know if you have “cracked” it, given the corpus is so small?
Interesting writeup. Would be nice to have a couple images of Linear A/B scripts to visualize. Looking on google, they're very daunting!
lineara.xyz is your friend
I wonder if LLMs trained specifically for this purpose can perform well with "forgotten languages".
I know I'm simplifying a lot, but all this deciphering isn't it just some kind of pattern matching?
If confirmed this is really cool and impressive work.
Honestly curious how many years before it can be one shotted in a coding harness with Fable.next by someone who’s not a linguistics expert.
Develop, test, and rank hypotheses about the phonetic values, morphology, grammar, and possible language family of Linear A using the full available corpus. Do not assume any decipherment is correct. Treat all candidate readings as hypotheses to be scored…”
Can I get his decipher-forgotten-ancient-text skill? I want to try my hand at the Voynich Manuscript
crossing my fingers for this guy.
however, nawaya or what ever examples around it are not part of the Hebrew language.
would like to hear more about Tom's learning/education path in ML/AI.
I haven't talked to him extensively about how he learned his engineering skills, but he is I believe 100% self taught. His background is in copywriting.
Alot of the comments in this thread are disappointing. Rather that celebrating an achievement (whether or it is validated yet), many of you seem to want to put him down, or make it seem like claude did all the work.
Claiming that claude did all the work is patently ridiculous. Claude is a tool, like any other. The corpus of linear A is ~7500 characters across ~1500 inscriptions and claude, no matter how smart, doesn't just solve that on its own.
What a shame.
relevant xkcd: https://xkcd.com/2151/
Is this extendible to a generalizable approach to translate any language pair (without a translation map)?
Tom thinks he may be able to use his approach to crack more languages, but that's not confirmed.
I think it is an open question: can an unknown language be cracked -- without any dictionary or grammar or understanding of the language? Just lots and lots of texts, maybe some of it bilingual.
It's a common misconception that is what happened with Ancient Egyptian with the Rosetta Stone. The Rosetta Stone was just one of the big pieces of the puzzle. The decoding came when people realized that Coptic (a language written alphabetically and still in use in the Coptic Church today) is actually descended from Ancient Egyptian; as Spanish is to Latin, Coptic is to Ancient Egyptian.
Similarly the attempts to decode classical Maya were all dead ends. Until Yuri Knorozov realized that it encoded the ancestor of the Maya languages which are still spoken to this day. (Knorozov's Wikipedia article is worth checking out just for his photo with his cat. [0] IMHO.)
I have written before about the La Mojarra 1 stele in Mexico [1]. It looks a lot like Maya. [2] But it isn't Maya. Maybe the difference like between Russian and Latin?
No one can read it. It's undecipherable. There are some attempts to identify it with a proposed ancient language that would have been related to the modern Mixe-Zoque languages: some of the glyphs that are shared with Maya, when read phonetically, start sounding like a Mixe-Zoque language. But no one has proposed a confident decipherment. There probably isn't enough text. La Mojarra 1 is the only long example of the Isthmian script.
Deciphering Akkadian was very difficult, at first. The process started with Persian; old Persian was written in a simplified adapted form of the Mesopotamian cuneiform (wedges on clay). It was a kind of alphabet. And Old Persian was already understood. And there was a bilingual text on a monument carved by Darius I. But even then -- decoding relies so heavily on the fact that Akkadian is a Semitic language distantly related to Hebrew, more distantly, also Ancient Egyptian. So again, we sort of knew what we were looking for.
That is all to say: even if the Voynich manuscript (for example) contains real text I'm not sure it is possible even theoretically to translate it.
[0] https://en.wikipedia.org/wiki/Yuri_Knorozov
[1] https://en.wikipedia.org/wiki/La_Mojarra_Stela_1
[2] https://commons.wikimedia.org/wiki/File:La_Mojarra_Stela_1_S...
Towards the Star Trek universal translator.....
Sorry but I don’t recognize this as being an achievement by an amateur. This dude had no chance in hell until we trained a model to use his time to suss it out.
I drilled down on this with Tom. He thinks that it might not have happened without Claude Code, but Claude was used to organize all of the symbols, and to run I think it was 100,000 simulations to assess whether or not he had an actual insight, or if he just randomly got lucky. Claude did NOT crack the code. Significant supporting role though.
Assuming this pans out, every other professional linguist in the world has had the option to use Claude or other LLMs, but has not solved this problem, despite the incentives for doing so. It stands to reason the human is adding crucial value.