Sorry, how could it be correct? On that page there's no explanation on what they're measuring to begin with. No mention on the benchmark set up either. There are problems that can never scale linearly due to the reality of hardware.
The github blurb says the language is comparable to general purpose languages like python and haskell.
Perhaps unintentionally, this seems to imply that the language can speed up literally any algorithm linearly with core count, which is impossible.
If it can automatically accelerate a program that has parallel data dependencies, that would also be a huge claim, but one that is at least theoretically possible.
Is this a PR? The link is PR with no substance, praises itself without any details on benchmarking setup, and still I see some comments here being positive.