Crown Sterling

{{bronze}}
[[File:LOGO-crown-sterling-Nav2x.jpeg|thumb|right|165px|The Crown Sterling logo]]
{{scam}}
'''Crown Sterling''' is a [[crank]] company that exists at the intersection of [[pseudoscience]] ([[numerology]], Pythagoreanism, {{wpl|Snake oil (cryptography)|snake oil cryptography}}), and [[New Age]] [[occult]]ism (including, but not limited to, [[Pyramid#Pyramid woo|pyramidology]]). It is a subsidiary of '''Strathspey Crown''', both of which were founded by {{sl|Robert_Edward_Grant|Robert Edward Grant}} {{lived|c. 1970}}.<ref>Twin Global. (October 2021). [https://web.archive.org/web/20211024174313/https://www.twinglobal.org/twin-global/speakers/robert-edward-grant "Robert Edward Grant"]. Archived from [https://www.twinglobal.org/twin-global/speakers/robert-edward-grant twinglobal.org] on Oct. 24, 2021.</ref>

The company has presented several [[fraud]]ulent claims about being able to break [[cryptography|cryptographic]] algorithms, and peddled cryptographic snake oil products such as a [[cryptocurrency]] and a messaging app.

== The prelude ==
The beginnings of Crown Sterling revolve around the 24-sector dartboard of quasi-primes, that the company's CEO, Robert Edward Grant, has been rehashing ever since he uploaded his PDF "''Prime Number Pattern Associated with Icositetragons''"<ref name="dartboard">Grant, Robert (June 6, 2018). [https://web.archive.org/web/20210704054257/https://74b8e51b-1d9c-4e9b-b6af-aaa822d757f7.filesusr.com/ugd/b8252f_31a46aecc43a4594aad9c3ee2c1aefec.pdf "Prime Number Pattern Associated with Icositetragons"]. Archived from [https://74b8e51b-1d9c-4e9b-b6af-aaa822d757f7.filesusr.com/ugd/b8252f_31a46aecc43a4594aad9c3ee2c1aefec.pdf filesusr.com] on July 4, 2021.</ref> online on June 6, 2018. 

In the PDF Grant presented dart-board illustrations that re-invented Paul Pritchard's {{wpl|Wheel_factorization|wheel sieve}} from 1982.<ref name='pritchard1982'>{{cite journal|last1=Pritchard|first1=Paul|date=October 1, 1982|title=Explaining the wheel sieve|url=https://fuuu.be/polytech/INFOF404/Doc/Explaining%20the%20wheel%20sieve.pdf|journal=Acta Informatica|volume=17|pages=477-485|doi=10.1007/BF00264164}}</ref> In the dartboards on pages 4, 5, and 6, Grant claimed '''1''' was a prime number and that '''2''' and '''3''' are not prime numbers, most likely because reality didn't suit his grift of numerologist woo of perfect symmetry.

Also, perhaps because Grant missed e.g. the then-eight-year-old Stack Exchange thread on the subject,<ref>De Tina, Ton (July 27, 2010). [https://math.stackexchange.com/questions/855/for-any-prime-p-3-why-is-p2-1-always-divisible-by-24 "For any prime p>3, why is p2−1 always divisible by 24?"] Via Mathematics Stack Exchange.</ref> he deluded himself into thinking he had discovered a basic property of primes, that is, '''∀p ∈  ℙ, p > 3: p²≡ 1 (mod 24)''', that is, every prime larger than '''3''' squared, minus '''1''' is divisible by '''24'''. Only, Grant was 2000 years late for the party.<ref name="stack_exchange_reciprocal_factoring">Squeamish Ossifrage (Sept. 26, 2019). [https://crypto.stackexchange.com/a/74620 "What is the efficiency of the new Crown Sterling semiprime factoring method?"]. Via Cryptography Stack Exchange.</ref> 

Finally, Grant redefined a subset of composite numbers as quasi-primes, pretended that it mattered, and ended with the following note:

{{cquote|Such a discovery may have far-reaching implications in the fields of [[mathematics]], [[physics]], [[chemistry]], and cryptography among others.|||Robert Edward Grant (CEO, Crown Sterling)<ref name="dartboard"/>}}

The "may have" turned out to be quite short-lived, as on June 21st, 2018, just over two weeks later, Grant was already preaching the implications of the "discovery" and his plans to invent a new cipher to someone named Matthew Belair:

{{cquote|I figured out the pattern to be able to determine {{wpl|Prime number|prime numbers}} accurately into infinity without any factorization whatsoever. By discovering a different type of prime number[…] called quasi-prime numbers. And those quasi-prime numbers are [composite numbers divisible by primes larger than '''5''', and they all have the same remainders as primes when reduced modulo '''24''']. 

Now, what's interesting from that, is that [all numbers on that chart that aren't composites], are by definition prime.<ref group=note>And so Grant "discovered" the {{wpl|Law_of_excluded_middle|principle of excluded middle|.}}</ref> [And we've now proven this with supercomputers and "infinite equations".]

And nobody believed me, even my own research team. They're like "This isn't gonna work". I said, "Just run the calculation […] up to ten thousand". And one of my colleagues here, [Talal] Ghannam, says "Aah, Okay, I'll do it. […] he sends me an e-mail like at midnight that night saying, "Holy shit. […] we accurately predicted every single prime under the number 10 000".

[…] So it exactly sort of proved the theory, and we tested it further over the course of the next few days and published it the next day. And of course, we had every crypto person imaginable like call us up […]

'''We didn't do this so that we could crack cryptocurrency even though every encryption on the planet is tied to prime number indeterminacy'''. Well, if it becomes determinancy, not indeterminacy, '''then you got a real problem with all encryption'''. '''So we are trying to figure out a way to create a new encryption now''', that is fifth-dimensional, and I've been working on this for the last couple of days. It's very exciting stuff, and it will be what I'm referring to now as an infinite series of oscillating cryptography. And it'll be infinite. '''There's not going to be any more like 256-bit encryption and stuff like this. We're gonna kill all of it. And none of it is gonna be Prime-determined, either. Because we know that's inherently now weakened because you can predict primes into infinity now.'''

|||Robert Edward Grant (CEO, Crown Sterling)<ref name='belair_interview_2018'>Grant, Robert (June 21, 2018) [https://www.youtube.com/watch?v=-q_COl11-vc&t=1228s "Robert Grant: NEW Discovery Found in Great Pyramid - Possible Mark of the Builder in King's Chamber" (Matthew Belair interview)]. Via [[YouTube]].</ref>}}

Establishing a unified narrative has been a struggle for the team from the get-go. Deciding on whether the quasi-prime "discovery" was important was one thing, but the staff also has been unable to even agree on who came up with the mental dandelion it mattered for cryptography.

Crown Sterling team member Adam Apollo describes the early stages of his relationship with Grant and Crown Sterling in his project portfolio:<ref name=apollo>Apollo, Adam (2020). [https://archive.ph/r72PF "Crown Sterling"]. Archived from [https://www.adamapollo.com/project/crown-sterling/ https://adamapollo.com] on January 9, 2024.</ref>According to him, he met Grant in 2017, and one year later, after seeing Grant's dartboard, he came up with the insightful idea of "Hey, the {{wpl|RSA_(cryptosystem)|RSA cryptosystem}} uses prime numbers. I wonder if being able to check if a number is a prime can make it trivial to break RSA encryption, you know, because.", and if Apollo is telling the truth, Grant must have jumped at Apollo's brain-fart, because according to Apollo, in December of the same year, he was already working for the company, developing what was to become a replacement for modern cryptography.

=== The preprint peddling ===
From the uploading of the dartboard PDF, it took merely nine months for Grant and his co-worker {{sl|Talal_Ghannam|Talal Ghannam}} (a physicist gone [[crank]]) to upload the first part of their grift lore, a crank paper titled "''Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology''".<ref name='quasiprimes'>Robert E. Grant and Talal Ghannam (March 20, 2019). [https://arxiv.org/abs/1903.08570 "Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology"]. Via [[ArXiv]].</ref>

The paper was uploaded to the [[arXiv]] preprint server, leveraging the fact Ghannam had previously uploaded to arXiv and could thus vouch for Grant. The paper then somehow passed arXiv's "''Is the paper full of {{wpl|Lorem ipsum}}''"-filter.

The crank paper itself made two claims:
# The authors had devised an efficient {{wpl|primality test}} algorithm (that checks if a given number is a prime number).
# The primality test could be used to solve the {{wpl|RSA problem||,}} i.e., factor large semiprimes (product of two large prime numbers) to break the RSA cryptosystem.

In an interview with a fellow numerologist, Grant gave the date the interview was recorded (March 19, 2019), and discussed the implications of the "discovery":
{{cquote|We're very excited that Cornell University Press published this just yesterday […] I don't think we know enough yet to know how profound the implication is […]|||Robert Edward Grant (CEO, Crown Sterling)<ref>Grant, Robert ("Hold my ARK" interview, March 19, 2019). [https://www.youtube.com/watch?v=MLb95ESwy60&t=232s "A new kind of prime number called quasi-primes"] via [[YouTube]].</ref>}}

Already, Grant couldn't help but [[lie]] about the process of [[Scientific publication|academic publishing]] when he claimed that arXiv {{wpl|Preprint|preprints}} are [[peer-reviewed]] publications. Grant has since made this mistake so many times<ref>[https://imgur.com/a/lxNnaHF "Grant thinking arXiv preprints are publications"]. Via imgur.com</ref> nobody can say he doesn't know exactly what he's doing.

Grant's answer, about what he thinks the implications of his "discovery" are, had also done a complete 180, but only for a moment: Just two days after the interview, Grant was already doodling away the logo for his company's new cryptosystem in an Instagram post,<ref>Grant, Robert (March 21, 2019). [https://imgur.com/a/o85IwVY "Grant drawing the TIME AI logo on March 21, 2019"]. Via imgur.com</ref> and just seven days later the product trailer dropped.

== The turd breaks the surface ==

On March 28, 2019, Crown Sterling pushed out its first promotional trailer to [[YouTube]].<ref name=cryptoencabulator>Crown Sterling (March 28, 2019). [https://www.youtube.com/watch?v=fPMxIt79PkE "Crown Sterling Presents: TIME AI"] via [[YouTube]].</ref> TIME AI, the unholy matrimony of numerology and {{wpl|Turbo encabulator|Retro Encabulator|,}} was produced with the ridiculously high-quality CGI only VC money can buy. The trailer came bundled with the following [[word salad]]:

{{cquote|You are unlike any other. A beautifully unique [[human being]], with integral patterns, patterns that become data, data that mirrors who you are, making its ownership and [[privacy]] essential to your individuality.

In addition to all of your transactions, messages, and financial account data, today your private in-home interactions, geo-location, and even your own [[DNA]] are '''protected only by a single static encryption algorithm&nbsp;— now recognized by the world’s experts as obsolete.'''

The [[Fibonacci sequence]] repeats every 24 cycles when viewed using digital root analysis&nbsp;— a pattern that can be represented with an icositetragonal spiral. By positioning integers in 24 positions for every 360 degrees, Crown Sterling solved one of the greatest mathematical mysteries of all time: '''Identifying for the first time, an infinitely predictable prime number pattern'''. These patterns also revealed an entirely new classification of non-prime numbers called quasi-primes, as well as a new understanding of how mathematical constants interact with primes, and quasi-primes, to propagate and mirror reflect in infinite wave conjugations.

Academic researchers believe this discovery may be the key to unlocking a new unified physics [[cosmology]], a [[theory of everything]]. '''This new discovery enables large prime factorization using standard computers, thus rendering obsolete all static factorizing encryptions, presently used in public key cryptography.'''

More than ever before, now is the time for a new adaptive encryption granting you security and full control of your digital individuality. A new paradigm of data sovereignty made possible only, with time. TIME AI is an entirely new classification in data privacy called quantum encryption — an impenetrable system utilizing five dimensions of encryption technology. Rather than depending on prime numbers and only a two-dimensional static matrix, TIME AI introduces time and high-speed oscillations of infinite wave values of irrational numbers as its encryption modality. Using the infinite variations within music composed real-time by artificial intelligence, TIME AI generates quantum encryption keys as unique as your own iris.

Each quantum public key is paired with two quantum private keys that are [[Quantum entanglement|entangled]] through mirror symmetry mathematics in value, time exposure, and oscillation speed. These quantum keys change at the nano-scale of time, directed by state-of-the-art [[AI]] technology harnessing time's entanglement — one key from the past, and one key from the future, changing the number series one billion times per second, with no pattern. 

The speed of the AI oscillations allow 31,709 years of oscillations in a single second of data authentication. To unlock TIME AI, the future, and the past must converge perfectly in a split second, unpredictable by any known intelligence in the universe.

And if ever attacked, TIME AI learns, forever adapting and evolving its defenses through incalculable and infinite variations. 

TIME AI is a simple, elegant solution that drops easily into any computer or IoT mobile device with standard memory and storage capacities. It is so adaptive, so impenetrable, and so unique to each user, even its own architects cannot break it. This quantum leap in data privacy is the work of Crown Sterling, a team whose mission is to reshape the foundation of encryption, providing total data sovereignty for all.

Information privacy is the new frontier of freedom, and Time is your shield.|||Crown Sterling (TIME AI trailer)<ref name="cryptoencabulator"/>}}

The emphasized parts highlight lies used as [[FUD]] tactics to attack existing established cryptographic algorithms. For context, RSA is not considered "obsolete" because it's weak. The real reason it is being phased out in {{wpl|Cryptographic_protocol|cryptographic protocols}} such as TLSv1.3<ref>Internet Engineering Task Force (IETF) - Network Working Group (Oct. 25, 2021). [https://www.ietf.org/archive/id/draft-ietf-tls-rfc8446bis-03.html "The Transport Layer Security (TLS) Protocol Version 1.3"]. Via ietf.org</ref> in terms of {{wpl|Key_exchange|key exchange|,}} is because using RSA omits an important property called {{wpl|Forward_secrecy|forward secrecy|,}} that protects from situations where an attacker, who gains access to the long-term private keys (that the use of RSA requires), can decrypt massive amounts of data retrospectively.<ref>Greenberg, Andy (Nov. 28, 2016). [https://archive.ph/BJXiA "Hacker Lexicon: What Is Perfect Forward Secrecy?"] Archived from [https://www.wired.com/2016/11/what-is-perfect-forward-secrecy/ Wired Magazine] on June 13, 2023.</ref> RSA isn't dead, however, as it is still widely used for {{wpl|Digital_signature|digital signatures|.}}

The rest of the trailer sold the viewer {{wpl|vaporware||}} that was an anthropomorphic AI&nbsp;— a ridiculous<ref>Harrison, Maggie (Sept. 8, 2022). [https://archive.ph/Tm8KZ "Analysis: No, AI Isn't Sentient, You Absolute Morons"] Archived from [https://futurism.com/ai-isnt-sentient-morons futurism.com] on Sept. 29, 2023.</ref> claim in of itself&nbsp;— and [[Time travel|time-traveling]] cryptographic keys.

The video was dissected by Ph.D. student Mark Carney on Twitter on August 9, 2019:

{{cquote|

 "The world's experts think that the [singular] algorithm is obsolete" 

Well, no. There are two algorithms that pose a threat, and both of them only work on quantum computers. (Shor's algorithm and Grover's Algorithm)

 "The Fibonacci seq. repeats every 24 cycles"

I don't even know what this means via 'digital root analysis' and I've actually analysed his 'digital root' function. Pass. >.<

 "Crown Sterling has made a breakthrough" 

Well, no. mod 24 isn't special, and I showed the general case for this. I haven't found anyone that actually proved the theorem I stated in my paper, but that's because it's a fairly easy application of well established theorems.

 "New classification of quasi-primes"

Errrrrr noup{{sic}}... they're an established thing. See: https://encyclopediaofmath.org/wiki/Quasi-prime_number

 "Primes...something... mirror reflect... wave conjugations..."

I'm genuinely not following that. 

 "This unlocks a new physics cosmology - a theory of everything" 

Well, I mean, only if it's consistent for current models in Physics. you can probably show that 'No' is the answer

 "Static encryption is obsolete" 

I mean, since Shannon we've had the idea of 'One Time Pad', so I really don't know where this is going.

 "Infinite wave values of irrational numbers"

WTF?

 "Entangled in near-symmetry mathematics" 

What were they smoking?

 "Quantum keys... one from the past... one from the future..."

I genuinely have no idea what the fuck is going on now. 

 "TimeAI learns..." 

DUH DUNN DUNN DUH DUNN...

 [Simplicity is the ultimate sophistication -Leonardo da Vinci]

<nowiki>*</nowiki>drinks*

 "TimeAI is a simple (??) elegant"

(If you're high) 

 "Even its own architects cannot break it" 

Well, that's true of any cryptosystem. It's called {{wpl|Kerckhoffs%27s_principle|Kirckhoff's principle}}

 "TimeAI fits onto any computer"

So he's claiming to be able to do quantum key stuff on classical computers? Nah, sorry, that's not how that works... no qubits, no quantum computations.

Likewise, for quantum cryptography, you need some way of generating a 'state' of a particle (usually polarisation of a photon/photons) and then a filter you can vary in order to get a reading. 
Cf: {{wpl|BB84|BB84}}

 "Time is key to security"

Ok, so, full disclosure, I *literally* helped write a book on time-based security, including a chapterload of maths, for @winnschwartau
's Analogue Network Security. I would like to think my dynamical models, ROC curves, OODA loops and such are a better approach than this... post-crackpipe rambling that I've just spent 4:30 of my life on. 

I'm prolly a bit biased, though x-P

|||Mark Carney <ref>Carney, Mark (Aug. 9, 2019). [https://twitter.com/LargeCardinal/status/1159603388901986305 "Dissection of the TIME AI video"]. Via [[Twitter]].</ref>}}

== Black Hat 2019 ==
The train wreck of compounding public lies began with the CEO's presentation "''The Discovery of Quasi-Prime Numbers: What Does This Mean For Encryption?''" at the {{wpl|Black_Hat_Briefings|Black Hat conference}} on August 8, 2019. 

=== The pre-party ===
For Crown Sterling, the event started with TIME AI pre-party<ref name='blackhat_pre_party'>Grant, Robert (August 3, 2019). [https://www.youtube.com/watch?v=udPvtV29tX8 "Introduction to TIME AI party, Blackhat 2019G"]. Uploaded by Alex Gaynor on [[YouTube]] on Aug. 24, 2019.</ref>, where Grant defined himself as a number theorist and mathematician despite only having a business degree, claimed RSA, elliptic curve cryptography, and the {{wpl|SHA-3|SHA-3}} hash function (yes, really, Keccak), are all based on the RSA problem, and claimed to have created a new cipher during the Christmas break 2018 — which contradicts with Grant's own claims from his interview with Matthew Belair,<ref name='belair_interview_2018'/> where he said he had been working on the cipher since mid-June, 2018. 

Furthermore, Grant spouted numerologist [[Argument by gibberish|gibberish]] about nouns and verbs in mathematical syntax, and something about musical, circular geometry, and again claimed he was the first to have discovered that '''∀p ∈  ℙ, p > 3: p²≡ 1 (mod 24)'''. Grant also implied Numberphile did a segment on "his" discovery, ignoring the fact the segment was released back in November 2018, nobody in the academia knew who Grant was, and Matt Parker who hosted the episode didn't even mention Grant.<ref>Parker, Matt (Nov. 20, 2018). [https://www.youtube.com/watch?v=ZMkIiFs35HQ "Squaring Primes - Numberphile"]. Via [[YouTube]].</ref> Grant then claimed his system could compress an infinite amount of information into a finite memory, that the system uses AI to compose music, and that its public keys express quantum phenomena called [[quantum entanglement]]. Finally, Grant promised a consumer, an enterprise, and a government product, revealed they're completely new to the whole thing, and rolled the TIME AI trailer.

{{collapse|A recording of the TIME AI pre-party|width=500}}
{{video|youtube|udPvtV29tX8}}
{{collapse end}}

=== The talk ===
The next day, during his $115,000 pay-to-play<ref>Bernoff, Josh (Aug. 27, 2019). [https://archive.ph/PESmx "Crown Sterling asserts its legal right to be an idiot"]. Archived from [https://bernoff.com/blog/crown-sterling-asserts-its-legal-right-to-be-an-idiot https://bernoff.com/] on Jan. 16, 2024.</ref> talk, Grant presented his dartboard and quasi-prime preprint, repeated the lie that preprints on arXiv are peer-reviewed, spouted a bunch of numerologist gibberish such as "''What we found is that phi is where light emerges from darkness''", presented the false claim that {{wpl|Diffie–Hellman_key_exchange|Diffie-Hellman}} (another key exchange algorithm) was based on the RSA problem, and ended with the TIME AI trailer.<ref>Aumasson, Jean-Philippe (Aug. 8, 2019). [https://archive.ph/rJcSc Live tweets from "Robert Grant's "The Discovery of Quasi-Prime Numbers: What Does This Mean For Encryption?" presentation, Black Hat 2019]. Archived from [https://twitter.com/veorq/status/1159559785068429312 Twitter] on May 23, 2020.</ref> The TIME AI "demonstration" that was promised in Crown Sterling's August 7 press release<ref>Bernoff, Josh (Aug. 13, 2019). [https://archive.ph/59RA1 "Is this Crown Sterling press release from another planet?"]. Archived from [https://bernoff.com/blog/is-this-crown-sterling-press-release-from-another-planet https://bernoff.com/] on Jan. 21, 2024.</ref> was never performed.

After the presentation, during the Q&A session, cryptographer Jean-Philippe Aumasson told Grant Diffie-Hellman is not based on factorization but on discrete logarithm problem, cryptographer Thomas Pornin reminded Grant of prior art that was the {{wpl|Sieve_of_Eratosthenes|sieve of Eratosthenes}} Grant was rehashing,<ref>Aumasson, Jean-Philippe (Aug. 8, 2019). [https://archive.ph/R42EG "I started by telling the guy that DH and AES aren't based on factorization, then Thomas Pornin reminded him of the prior art (Eratosthene sieve), then Dan brilliantly finished him"] Archived from [https://twitter.com/veorq/status/1159612185158529024 Twitter] on Jan. 28, 2024.</ref> and last but certainly not least, Dan Guido, the CEO of Trail of Bits, called Grant out:

{{cquote|
You uploaded that document to a website so you could get it reviewed though. You said you put it on a website that was Cornell-affiliated. And that’s arXiv. That’s like me saying I put information on {{wpl|Google_Docs|Google Docs|,}} so Google reviewed it. You're lying! This is a scam! […] It’s a scam, and you’re just using marketing material from this to trick a bunch of people months later, you’ll say you’re legitimate because you spoke at Black Hat. You should be ashamed of yourself, and all of you working for him should quit your[…]

|||Dan Guido (CEO, Trail of Bits)<ref>
Grant, Robert (Aug. 8, 2019). [https://www.youtube.com/watch?v=oPiWqWJHz8E&t=2027s "Quasi-Prime Numbers: What Does This Mean For Encryption?" (Video recording, part 1)]. Uploaded by Alex Gaynor on [[YouTube]] on Aug. 24, 2019.</ref><ref>
Eargle, Dave (Sept. 30, 2020). [https://archive.ph/WDHZE "Transcription of Crown Sterling TIME AI Blackhat 2019 Q&A Session"]. Archived from [https://daveeargle.com/2020/09/30/blackhat-crown-sterling-q-and-a-transcription/ https://daveeargle.com] on Jan. 16, 2024.</ref><ref>
Guido, Dan (Aug. 8, 2019). [https://archive.ph/M28Un "I yelled at the Time AI guy. It’s ok to get angry at someone trying to harm people. I was shocked that more people haven’t done the same."] Archived from [https://twitter.com/dguido/status/1159579063540805632 Twitter] on Feb. 11, 2021.</ref>
}}

[[File:Ghannam omitted for security reasons.png|thumb|right|Talal Ghannam's deleted tweet that claims the reason the factorization method was not disclosed was security concerns.]]

Grant had underestimated how hated {{wpl|Snake_oil_(cryptography)|snake oil cryptography}} is among the practitioners of the field, and his attempt to exploit the prestigious conference caused an uproar.<ref>Eddy, Max (Aug. 10, 2019). [https://archive.ph/Gdszs "Black Hat Attendees: Sponsored Session Was 'Snake Oil Crypto'"]. Archived from [https://www.pcmag.com/news/black-hat-attendees-sponsored-session-was-snake-oil-crypto PCMag] on Jan. 21, 2024.</ref> Black Hat organizers realized their mistake and deleted the talk.<ref>Franceschi-Bicchierai, Lorenzo; Cox, Joseph (Aug. 10, 2019). [https://archive.ph/DcbRU "Black Hat Talk About ‘Time AI’ Causes Uproar, Is Deleted By Conference"]. Archived from [https://www.vice.com/en/article/8xw9kp/black-hat-talk-about-time-ai-causes-uproar-is-deleted-by-conference Vice] on Jan. 21, 2024.</ref> Shortly after, Grant showed what a good sport he was, and sued UBM LLC, the company behind the Black Hat conference, for breach of contract.<ref>Gallager, Sean (Aug. 24, 2019). [https://archive.ph/NIlvY "Alleged 'Snake Oil' Crypto Firm Sues Over Boos At Black Hat"]. Archived from [https://www.wired.com/story/alleged-snake-oil-crypto-company-sues-over-boos-black-hat/ Wired Magazine] on Aug. 25, 2019.</ref> 

=== The aftermath ===

After the Black Hat 2019, Grant joined the discussion on [[Twitter]] and tried to challenge the cryptographer Jean-Philippe Aumasson — who was present in the sponsored talk — into a cracking contest.<ref>Grant, Robert (Aug. 10, 2019). [https://archive.ph/KUxPB "I tell you what, you seem like a pretty smart fellow. I will make the new encryption available for you to test. I will even pay you significantly if you can crack it. Why not?"]. Archived from [https://twitter.com/Robert_E_Grant_/status/1160067242391830530 Twitter] on Jan. 28, 2024.</ref> Cracking contests are a well-known bullshit method to assess cipher security, and {{wpl|Bruce_Schneier| Bruce Schneier}} has explained it in detail as early as 1998,<ref>Schneier, Bruce (Dec. 15, 1998). [https://www.schneier.com/crypto-gram/archives/1998/1215.html#contests "Cryptogram: The Fallacy of Cracking Contests"]. Via schneier.com</ref> hence why nobody bothered to explain what was wrong with Grant's proposal,<ref>Grant, Robert (Aug. 9, 2019). [https://archive.ph/XyfzY "I’m actually being quite serious. What’s wrong with this? I’ll pay you $100K if you can crack it just one time."] Archived from [https://twitter.com/Robert_E_Grant_/status/1160067944346341378 Twitter] on Aug. 12, 2019.</ref> to Grant.

Crown Sterling was given its [[James Randi]]-style opportunity when Jake Williams offered Crown Sterling USD25,000 to break a relevant size RSA-key in a controlled setting.<ref>Williams, Jake (Aug. 29, 2019). [https://archive.ph/TZFJB "I'm throwing down the gauntlet. I'll publicly shave my head, glue pubes to my bald scalp, and give a recorded talk apologizing and publicly endorsing Crown Sterling's TimeAI if they demonstrate decrypting RSA encryption in the next 14 days."]. Archived from [https://twitter.com/MalwareJake/status/1167195175933886464 Twitter] on Aug. 30, 2019.</ref> Crown Sterling never took on the challenge.

The demands for Grant to publish their factoring methods grew on Twitter, so to avoid the pressure Talal Ghannam tweeted a lengthy (now deleted) post (see screenshot on the right), where he claimed the reason the factoring method was not disclosed, was they were concerned about public safety. Vacillating between positions of desire for full disclosure, or "we have nothing to hide", and on the other hand "responsible" behavior, suited well for the grifters trying to shake off unfavorable attention without admitting they had nothing. This is evident from never following up with promises to disclose the claimed method, and later Grant's complete 180°-turn regarding public safety concerns, when he would completely reveal several methods that he claimed to be even more efficient than this one.

To further shake the negative attention, Grant attempted to appeal to people's self-interest and laziness, by asking people why they cared so much,<ref>Grant, Robert (Aug. 10, 2019). [https://archive.ph/paj1t "Why do you care so much?"]. Archived from [https://twitter.com/Robert_E_Grant_/status/1160063604588023809 Twitter] on Jan. 25, 2024.</ref> and by telling them they were wasting their time.<ref>Grant, Robert (Aug. 10, 2019). [https://archive.ph/rZzZc "Maybe, maybe not. That’s the nature of risk. You are entitled to your views and opinion, I respect that. If you are correct then you are clearly wasting your time in this string."]. Archived from [https://twitter.com/Robert_E_Grant_/status/1160224274315038720 Twitter] on Jan. 25, 2024.</ref>


=== The lawsuit ===

'''Competitors'''

In their August 2019 complaint<ref name='complaint'>Katz, Michael I.; Bressler, Joshua R. (Aug. 22, 2019). [https://cdn.arstechnica.net/wp-content/uploads/2019/08/1.pdf "ECF Case No. 19, CV7900 - CROWN STERLING LIMITED LLC vs UBM LLC aka BLACK HAT USA and DOES 1-10"]. Via cdn.arstechnica.com</ref> Crown Sterling wept crocodile tears about how infosec experts calling them out was a "premeditated, orchestrated attack […] staged by certain industry detractors and competitors." (paragraph 9), as if discussing the upcoming snake oil presentation was some sort of coordination. The people calling Grant out were not competitors.

* JP Aumasson who at the time worked as the VP of Technology, Principal Research Engineer, and Principal Cryptographer in Kudelski Security, a company that has never competed in the fields of cryptocurrency or secure communication solutions with their own product, but that focuses on security assessment, audits, penetration tests etc. for existing ICT systems.<ref>Kudelski Security (Aug. 1, 2019). [https://web.archive.org/web/20190801134141/https://kudelskisecurity.com/ "Kudelski Security website"]. Archived from [https://kudelskisecurity.com/ kudelskisecurity.com] on Aug. 1, 2019.</ref>

* Thomas Pornin works as the Technical Vice President of NCC Group, a consulting company that offers services, not in-house products.<ref>NCC Group (Accessed March 20, 2024). [https://www.nccgroup.com/us/ "NCC Group website"]. Via nccgroup.com</ref>

* Dan Guido, who at the time worked as the CEO of Trail Of Bits, only offered consulting on Binary analysis, blockhain security, osquery support, software hardening, and secure implementation of cryptography in client products.<ref>Trail of Bits (Aug. 9, 2019). [https://web.archive.org/web/20190809035332/https://www.trailofbits.com/ Trail of Bits]. Archived from [https://www.trailofbits.com/ trailofbits.com] on Aug. 9, 2019.</ref>

The claim that pointing out glaring factual inaccuracies (such that all public key encryption is based on factorization) that arose during the talk, was detracting, was as ridiculous as the talk itself.

'''The gold package'''

In paragraph 9 the company also claimed it purchased the "highest ('gold') sponsorship package". The truth is, gold package wasn't even the highest gold package. There existed four tiers above the one Crown Sterling bought: gold plus, platinum, platinum plus, and diamond packages.<ref>UBM LLC, (2019). [https://web.archive.org/web/20190728095401/https://www.blackhat.com/us-19/event-sponsors.html "Black Hat 2019 Sponsors"]. Archived from [https://www.blackhat.com/us-19/event-sponsors.html blackhat.com] on July 28, 2019.</ref>

'''Non-existent NDAs'''

In paragraph 11 the company claimed

{{cquote|This small group of detractors used this staged “event” to initiate a smear campaign on social media during the conference and immediately after.
|||Crown Sterling<ref name='complaint'/>}}

as if the participants of the conference where contractually bound to not discuss, or laugh at the talk afterwards.

'''Vaporware'''

In paragraph 15 the company claimed 

{{cquote|Crown Sterling, a start-up company, is developing a novel, next-generation information security encryption solution that it believes will supplant the current industry standard RSA encryption platform and usher a new era and paradigm shift in data encryption.|||Crown Sterling<ref name='complaint'/>}}

Despite these claims, the company never published a public key encryption algorithm of its own design. The paradigm-shift never happened. TIME AI was never demonstrated in practice, and extremely likely never even written as software. Further evidence of this is, the company only ever used bog-standard public key encryption schemes, such as NIST P-521 EC-DH,<ref>National Institute of Standards and Technology (NIST) (Feb. 2023). [https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-186.pdf#Page=23 "Recommendations for Discrete Logarithm-based Cryptography"]. Via nvlpubs.nist.gov.</ref><ref name='whitepaper2021'/> NTRUEncrypt,<ref>Hoffstein, Jeffrey; Pipher, Jill; Silverman, Joseph H. (1998) [https://www.ntru.org/f/hps98.pdf "NTRU: A Ring-Based Public Key Cryptosystem"]. Via ntru.org.</ref><ref name='orion_lite_paper'/> and CRYSTALS-Kyber,<ref>Bos et al. (April 2018). [https://eprint.iacr.org/2017/634.pdf "CRYSTALS – Kyber: a CCA-secure module-lattice-based KEM"] via iacr.org.</ref><ref name='orion_white_paper_preview'/> in all of their actual products.

'''An industry conspiracy'''

The company also misrepresented the relationship between industry experts and the ciphers in Paragraph 18:

{{cquote|Precisely because Crown Sterling was innovating away from the current RSA encryption standard, Crown Sterling expected some participants’ skepticism. Crown Sterling understood that many of the Black Hat participants are highly invested and entrenched in the RSA encryption model, and that Crown Sterling’s methodology will disrupt that model (which was developed in the 1970s), transforming how digital information will be encrypted and protected.|||Crown Sterling<ref name='complaint'/>}}

Given that the industry has been moving away<ref>Horowitz, Michael (Jun 21, 2013). [https://www.computerworld.com/article/2473792/perfect-forward-secrecy-can-block-the-nsa-from-secure-web-pages--but-no-one-uses-it.html "Perfect Forward Secrecy can block the NSA from secure web pages, but no one uses it"]. Via computerworld.com.</ref> from RSA for key exchanges since the {{wpl|2010s_global_surveillance_disclosures|2010s global surveillance disclosures|,}} the claims that Aumasson, Pornin or Guido were somehow "''entrenched in the RSA encryption model''" is ridiculous. 

E.g., on July 8, 2019, a month before Blackhat 2019, the Twitter account of Trail of Bits (the company led by Dan Guido) tweeted literally "Fuck RSA",<ref> Trail of Bits (July 8, 2019). [https://twitter.com/trailofbits/status/1148182640723410945 "Fuck RSA https://blog.trailofbits.com/2019/07/08/fuck-rsa/"] Via [[Twitter]]</ref> while sharing a link to their blog post under the same title, "''Fuck RSA''".<ref name='fuck_rsa'>Trail of Bits (July 8, 2019). [https://web.archive.org/web/20190708113121/https://blog.trailofbits.com/2019/07/08/fuck-rsa/ "Fuck RSA"]. Archived from [https://blog.trailofbits.com/2019/07/08/fuck-rsa/ trailofbits.com] on July 8, 2019.</ref>

The article explained how much the company loves RSA, by opening with the following statement:

{{cquote|
Let me save you a bit of time and money and just say outright — if you come to us with a codebase that uses RSA, you will be paying for the hour of time required for us to explain why you should stop using it.
|||Trail of Bits (July 18, 2019)<ref name='fuck_rsa'/>}}

JP Aumasson retweeted the tweet by Trail of Bits the same day, adding the following comment:

{{cquote|
Good piece about known risks with RSA, but "flat out unacceptable to use RSA in 2019" is too radical IMHO. Someone could probably list ECC failures and write a "Fuck ECC" post. The article for example omits to mention that PSS and FDH are more "misuse-resistant" than ECDSA.
|||JP Aumasson<ref>Aumasson, Jean-Philippe (July 18, 2019). [https://twitter.com/veorq/status/1148258833896263680 "Good piece about known risks with RSA, but "flat out unacceptable to use RSA in 2019" is too radical IMHO. Someone could probably list ECC failures and write a "Fuck ECC" post. The article for example omits to mention that PSS and FDH are more "misuse-resistant" than ECDSA."] Via [[Twitter]].</ref>}}

The documentation for the BearSSL library, written by Thomas Pornin, states that

{{cquote|RSA, ECDH and ECDHE key exchange are supported. The ECDHE key exchange offers “Forward Secrecy”, a desirable property by which actual key exchange secrets are transient and destroyed after usage, thereby presumably immune to ulterior theft in case of full machine compromise.
|||BearSSL<ref>[https://bearssl.org/#overview "BearSSL Features"]</ref>}}

Thus, as per Pornin, Elliptic Curve Diffie-Hellman (Ephemeral key exchange) should be favored over RSA, as it offers forward secrecy.

In conclusion, none of the people who criticized Grant's TIME AI were proponents of RSA.

Crown Sterling also tried to imply RSA was categorically outdated, by referring it to having been created in 1977, where as Crown Sterling would later use a much more modern technology of elliptic curve cryptography described as recently as 1985.<ref>{{cite journal |last1=Miller |first1=Victor S. |date=1985 |title=Use of Elliptic Curves in Cryptography |url=https://link.springer.com/chapter/10.1007/3-540-39799-X_31 |journal=Advances in Cryptology — CRYPTO ’85 Proceedings |volume=218 |pages=417-426 |doi=10.1007/3-540-39799-X_31 |access-date=March 20, 2024}}</ref>

As for whose algorithms would end up being used in Crown Sterling products, fate, it seems, is not without a sense of irony. Crown Sterling later adopted the Argon2 algorithm for its {{sl|Orion_Messenger|Orion Messenger}} web-app.<ref name='orion_white_paper_preview'/> Argon2 was established as the de-facto password hashing function in the 2013-2015 Password Hashing Competition (PHC).<ref>Password Hashing Competition (Accessed March 20, 2024). [https://www.password-hashing.net/ "Password Hashing Competition"] Via password-hashing.net.</ref> This competition was initiated by none other than JP Aumasson. Furthermore, Argon2 builds on top of the BLAKE2 hash function,<ref>Biryukov, Alex; Dinu, Daniel; Khovratovich, Dmitry (Dec 26. 2015). [https://www.password-hashing.net/argon2-specs.pdf#page=5 "Argon2: the memory-hard function for password hashing and other applications"]. Via password-hashing.net.</ref> which was designed by — you guessed it — JP Aumasson.<ref>Aumasson, Jean-Philippe (2012—). [https://www.blake2.net/ "BLAKE2 — fast secure hashing"]. Via blake2.net.</ref>

'''Pay to play'''

In paragraph 22, the company states

{{cquote|Black Hat had ample opportunity to vet the talk. No one from or associated with the Black Hat conference at any time questioned the talk’s subject matter or inquired further about it.|||Crown Sterling<ref name='complaint'/>}}

The truth is, Crown Sterling submitted their talk via sponsored talks, precisely because Black Hat wasn't vetting them. There is no reason to waste $115,000 on a talk, if it could get in with its own merits.

'''Good men, please do nothing'''

In paragraph 36 the company states it reached out to Black Hat USA, and

{{cquote|asked Black Hat to issue a public statement clarifying its neutral position concerning Crown Sterling’s encryption technology and denouncing the detractors’ abusive actions undertaken on its watch.|||Crown Sterling<ref name='complaint'/>}}

This request for Black Hat to provide higher than deserved validation for TIME AI, an obviously snake oil encryption product (that wasn't demonstrated during the event, and that was never delivered), was ridiculous.

'''The settlement'''

On April 20, 2020, BlackHat and Crown Sterling settled the lawsuit.

According to an article in CyberScoop,<ref>Stone, Jeff (April 22, 2020). [https://cyberscoop.com/crown-sterling-lawsuit-black-hat-ai/ "Crown Sterling and Black Hat settle lawsuit, promise to never speak of it again"] Via cyberscoop.com</ref> the terms of the settlement were "confidential", a claim confirmed also by Crown Sterling in their own statement:

{{cquote|As part of the confidential settlement, both parties have agreed to refrain from providing further comment on this matter.|||Crown Sterling<ref>[https://web.archive.org/web/20200813230223/https://www.crownsterling.io/newsroom/crown-sterling-and-informa-tech-holdings-owner-of-black-hat-usa-reach-settlement-agreement/ "Crown Sterling and Informa Tech Holdings, Owner of Black Hat USA, Reach Settlement Agreement"]. Archived from [https://www.crownsterling.io/newsroom/crown-sterling-and-informa-tech-holdings-owner-of-black-hat-usa-reach-settlement-agreement/ crownsterling.io] on Aug. 13, 2020.</ref>}}

Yet, Grant, the CEO of Crown Sterling, violated the confidentiality of the settlement on his personal Telegram channel on August 19, 2022, by revealing Black Hat had to pay them a settlement:

{{cquote|In your face Blackhat!! 🖕 🤣. Too bad you also had to pay us $$$$ in 2020 for your behavior.|||Robert Edward Grant (August 19, 2022).<ref>[https://rationalwiki.org/wiki/Crown_Sterling#/media/File:Grants_patent_rant.png "Grant's comment to BlackHat on August 19, 2022"]. Via rationalwiki.org</ref>}}

== Desperate times ==
[[File:Glass door.png|thumb|right|The [https://www.glassdoor.com/Overview/Working-at-Crown-Sterling-EI_IE5112615.11,25.htm Glassdoor reviews] of Crown Sterling reveal what the people inside Crown Sterling really think about the company and its management.]]

By September 2019, Grant's quasi-prime crankery had been refuted, and the company stood in the middle of the [[PR]] disaster that was Black Hat. 

Two-thirds of the company staff had quit. At the end of July 2019, the company had 27 employees on its team roster.<ref name='2019_roster'>[https://web.archive.org/web/20190731125718/https://www.crownsterling.io/team/ Crown Sterling team roster (July 31, 2019)]. Archived from [https://www.crownsterling.io/team/ crownsterling.io] on July 31, 2019.</ref> After Black Hat, at the end of the next month, only nine of the original team remained. And of those nine, Adam Apollo, Alan Green, and Talal Ghannam had apparently asked to be taken down from the company's online staff listing, as the team roster had only six original members.<ref>[https://web.archive.org/web/20190831200305/https://www.crownsterling.io/management-team/ Crown Sterling team roster (Aug. 31, 2019)]. Archived from [https://www.crownsterling.io/management-team/ crownsterling.io] on Aug. 31, 2019.</ref> Two people appear to have joined Crown Sterling's team, but out of those two, Christine Bock doesn't have Crown Sterling listed in her LinkedIn bio, she instead appears to have been a hired consultant from CB Partners.

===''The Doghouse''===
Bruce Schneier's legendary snake oil debunking blog series ''The Doghouse''<ref>Schneier, Bruce (2004—). [https://www.schneier.com/tag/doghouse/ "The Doghouse", a series of refutal articles on cryptographic snake oil]. Via schneier.com.</ref> had made a comeback on September 5, 2019, and the blog post<ref name="doghouse">Schneier, Bruce (Sept. 5, 2019). [https://archive.ph/pgh4M "The Doghouse: Crown Sterling"]. Archived from [https://www.schneier.com/blog/archives/2019/09/the_doghouse_cr_1.html Schneier on Security] on Jan. 22, 2024.</ref> had roasted the company and its key staff to ashes:

{{cquote|Crown Sterling is complete and utter snake oil. […][The TIME AI word salad] tick[s] three of my snake-oil warning signs—from 1999!—right there: [[Pseudomathematics|pseudo-math]] gobbledygook (warning sign #1), new mathematics (warning sign #2), and extreme cluelessness (warning sign #4).

Note the attempt to leverage Cornell’s reputation [in the quasiprime paper], even though the preprint server is not peer-reviewed and allows anyone to upload anything. (That should be another warning sign: undeserved appeals to authority.) […]

Most of [the quasiprime paper] is wrong, and what’s right isn’t new. […]

None of [the people who work for Crown Sterling] have demonstrated any cryptographic credentials. No papers, no research, no nothing. (And, no, self-publishing doesn’t count.)

After the Black Hat talk, Grant&nbsp;— and maybe some of those others […] claimed that the patterns they found in prime numbers allowed them to break RSA. They’re not publishing their results “because Crown Sterling’s team felt it would be irresponsible to disclose discoveries that would break encryption.” (Snake-oil warning sign #7: unsubstantiated claims.) […]

[…] All of us can create ciphers that we cannot break ourselves, which means that amateur cryptographers regularly produce amateur cryptography. These guys are amateurs. Their math is amateurish. Their claims are nonsensical. Run away. Run, far, far, away.

[…] Not only is the company ridiculous, it’s litigious as well. It has sued ten unnamed “John Doe” defendants for booing the Black Hat talk. It also sued Black Hat […]
|||Bruce Schneier<ref name="doghouse"/>}}

The second to last quote by Schneier, a legendary professional cryptographer and the author of the {{wpl|Advanced Encryption Standard process|AES competition}} finalist {{wpl|Twofish|Twofish|:}}

{{cquote|All of us can create ciphers that we cannot break ourselves […]|||Bruce Schneier<ref name="doghouse"/>}}

highlights the cluelessness of Crown Sterling nicely, as TIME AI was marketed with the following intellectual masterpiece:
{{cquote|It is so adaptive, so impenetrable, and so unique to each user, even its own architects cannot break it.|||Crown Sterling (TIME AI trailer)<ref name="cryptoencabulator"/>}}

== The RSA cracking circus ==
[[File:SHA256 was cracked.png|thumb|right|Grant has been very keen to believe any claim that existing cryptography is weak. On week 37, September 2019, Grant carelessly repeated the outlandish claim made by Treadwell Stanton DuPont,<ref>Treadwell Stanton DuPont (Sept. 3, 2019). [https://web.archive.org/web/20190910122002/https://www.treadwell-stanton.com/services/latest-news "Treadwell Stanton DuPont today announced its researchers quietly broke the SHA-256 hashing algorithm over a year ago"]. Archived from [https://www.treadwell-stanton.com/services/latest-news treadwell-stanton.com] on Sept. 10, 2019.</ref> that they had broken the SHA256 hash function. To the surprise of no one, this claim turned out to be a lie.<ref>Squeamish Ossifrage (Sept. 11, 2019). [https://crypto.stackexchange.com/a/74254 "Has SHA256 been broken by Treadwell Stanton DuPont?"] Via Cryptography Stack Exchange.</ref>]]

To peddle his snake oil cryptography, Grant first had to create the demand, and that required breaking existing {{wpl|Public-key cryptography|public-key cryptography|.}} During his talk Q&A at Black Hat 2019, Grant had already fraudulently lumped Diffie-Hellman and its {{wpl|Elliptic-curve Diffie–Hellman|elliptic-curve variant}} into the same boat with RSA, by claiming both were based on the RSA problem:

{{cquote|Diffie-Hellman exchange is - that's more of the exchange methodology - I think a lot of people refer to that - but yes, it's all based on factorization of prime numbers. Including Diffie-Hellman, including RSA, including elliptic curves […] AES? No, I'm talking about all asymmetric key cryptography.
|||Robert Edward Grant (CEO, Crown Sterling)<ref name="diffie_hellman_lie">Grant, Robert (Aug. 8, 2019). [https://www.youtube.com/watch?v=oPiWqWJHz8E&t=1619s "Grant's lie about Diffie-Hellman being based on the RSA problem." (Grant's Black Hat 2019 presentation video recording, part 1)]. Uploaded by Alex Gaynor on [[YouTube]] on Aug. 24, 2019.</ref>}}

This was a flat-out lie, as:
* RSA is based on the {{wpl|RSA problem||:}} Given large public key '''N''', find factors '''p''' and '''q''' (that make up the private key) such that '''p⋅q = N'''),
* Diffie-Hellman is based on the {{wpl|Discrete logarithm|discrete logarithm problem (DLP)|:}} Given common values (generator '''g''' and a large prime modulus '''p'''), and public key '''N''', find private key '''s''', such that '''gˢ mod p = N'''), and
* Elliptic-curve Diffie-Hellman is based on the {{wpl|Elliptic-curve cryptography#Application to cryptography|elliptic curve discrete logarithm problem (ECDLP)|:}} Find the discrete logarithm of a random elliptic curve element with respect to a publicly-known base point.

With the convenience of that lie, all Grant needed to do was solve the RSA problem. After all, how hard could it be to undo multiplication? What would follow, was several fraudulent claims about Grant and his company being able to factor large semiprimes to break RSA.

=== Time AI as cipher "hacking" software ===

[[File:OC500Sept2019.png|thumb|Grant claiming TIME AI was itself capable of "hacking" cryptographic algorithms.<ref name='oc500'/>]]
In the September 2019 issue of OC 500 (Orange County Business Journal), Grant claimed TIME AI itself was the software used in "hacking" cryptographic algorithms.<ref name='oc500'>OC500 (Sept. 2019). [https://ocbj.wppcdn.com/wp-content/uploads/2024/09/2019_OC500.pdf#page=158 "Orange County Business Journal (Sept. 2019 issue)"]. Via ocbj.wppcdn.com.</ref> For context, ciphertexts are not "hacked". The term "hacking" is reserved for compromising computer systems. Ciphertexts are "cracked". So not only was Grant spewing amateur techno babble, he clearly hadn't even decided was his vaporware encryption software TIME AI about encrypting data (like the TIME AI trailer implied) or about breaking existing encryption algorithms (like the OC500 article implied).

=== The quasi-prime paper ===


{{cquote|My colleague, Number Theorist and Physicist Talal Ghannam PhD and I have written several other papers. Please go ahead and attempt to dismantle these papers, if it makes you feel important, Each can be found at CrownSterling.io in the media resources section. '''In fact, I challenge you to do so''' [...]|||Robert Edward Grant (2019)<ref>[https://www.reddit.com/r/math/comments/bargli/comment/eue9wuf/ "Grant's 2019 wall of text on Reddit"]. Via reddit.com</ref>}}


[[File:Unprecedented efficiency.png|thumb|right|A screenshot from Grant's Instagram shows Grant described the "''Infinite Prime Prediction Method''" to provide "''unprecedented efficiency''".]]
As a refresher, the crank preprint<ref name='quasiprimes'/> Grant and Ghannam uploaded to arXiv made two claims:
# The authors had devised an efficient {{wpl|Primality test|primality test}} algorithm (that checks if a given number is a prime number).
# The primality test could be used to solve the RSA problem i.e., factor large semiprimes (product of two large prime numbers) to break the RSA cryptosystem.

==== Mark Carney ====
The quasi-prime paper was originally refuted by Mark Carney in July 2019, a month before Black Hat.<ref name='carney_2019'>Carney, Mark (July 2019). [https://unprovable.github.io/drafts/Prime_Generation_For_Breaking_Crypto-5e.pdf "Reviewing Recent Prime Generation Methods for Breaking Cryptographic Keys"]. University of Leeds.</ref>

The abstract of the paper states the following:

{{cquote|A recent publication by Grant et al. [2] has revealed some innovations with respect to the checking and generation of prime numbers with which to crack cryptographic keys. We argue that their method is minimal, and go on to prove some general cases of the mathematics they present&nbsp;— specifically refuting two of their claims. We also present more computationally efficient methods, and use these as a spring board to refute the existence of any practical efficiency improvements coming from this methodology.|||Mark Carney<ref name="carney_2019"/>}}

The paper's findings gives Grant's primality test the time complexity of '''Θ(n - (n/ln n))''', where '''Θ''' denotes the exact time complexity.<ref name='time_complexity_markings'/>

==== Squeamish Ossifrage ====
In their Stack Exchange answer,<ref name="stack_exchange_reciprocal_factoring"/> Squeamish Ossifrage explains what they found in the paper:
{{cquote|

In their [https://arxiv.org/abs/1903.08570 arXiv draft] (which they [https://web.archive.org/web/20190927150720/https://www.crownsterling.io/2019/08/crown-sterling-issues-statement-regarding-recent-allegations-made-at-black-hat-2019/ proudly claim Cornell University published] even though anyone can upload a draft to the arXiv with no peer review), Robert Grant and Talal Ghannam:

* (§II) made the remarkable observation that every prime above '''3''' is congruent to '''±1''' modulo '''6''' (proof: '''2 ∣ 6k ± 2''' and '''3 ∣ 6k ± 3'''; this is the newest result they recycled, several centuries old&nbsp;— first published no later than 1509 and first proven no later than 1603, according to Dickson pp.&nbsp;7–9, but quite possibly known earlier because it's so obvious);

* (§III) reinvented the sieve of Eratosthenes several thousand years late;

* (§IV) discovered that '''x ↦ x mod 9''' is a ring homomorphism (a technique known since antiquity<ref>Hippolytus of Rome (c.230 AD). [https://archive.org/details/antenicenefather05robe/page/30/mode/1up?view=theater "The Refutation of all Heresies"]. Translated by MacMahon, Rev. J.H., In Roberts & Donaldson - The Ante-Nicene Fathers (1919, pp. 9–153).</ref> and more commonly called {{wpl|Casting out nines|‘casting out nines’|),}} and figured out that if '''x ≡ 3 (mod 9)''', '''x ≡ 6 (mod 9)''', or '''x ≡ 9 (mod 9)''', then '''x''' can't be prime (proof: duh);

* (§VI) deluded themselves into thinking if '''pq ≡ 1 (mod 10)''' then either <nowiki>{</nowiki>'''p mod 10, q mod 10'''<nowiki>} = {</nowiki>'''3,7'''<nowiki>}</nowiki> or '''p ≡ q ≡ 1 (mod 10)''' (counterexample: '''19 ⋅ 29''' <nowiki>=</nowiki> '''551'''; perhaps they used ‘proof by trying numbers until I got bored’); and

* (Appendix) proved that '''p ≡ ± 1 (mod 6)''' implies '''p² ≡ 1 mod (24)''', a trivial consequence of the {{wpl|Chinese_remainder_theorem|Chinese remainder theorem (CRT)}} first stated no later than nearly two millennia ago (proof: '''p ≡ ±1 (mod 2)''' so '''p mod 8 ∈ '''<nowiki>{</nowiki>'''1,3,5,7'''<nowiki>}</nowiki> so '''p² ≡ 1 (mod 8)''', and '''p ≡ ±1 (mod 3)''' so '''p² ≡ 1 (mod 3)'''; hence by CRT, '''p² ≡ 1 (mod 3⋅8)''').

Earthshattering stuff, I'm sure you'll agree.
|||Squeamish Ossifrage<ref name="stack_exchange_reciprocal_factoring"/>}}

==== Time and space complexity of the factoring method ====
On page 5 of the paper, the authors describe the algorithmic steps for "efficient primality testing":

{{cquote|
In this paper, we are proposing an exact and fast method for checking the primality of numbers. To do so, we start by checking whether a number '''n''' passes the initial prime-criteria: being odd, having last-digit of ['''1, 3, 7''' or '''9'''], and digital root not equal to ['''3, 6, 9''']. 

Once the number passes the above criterion, n is easily tested to whether it falls along any of the prime moduli of the chosen s-sides polygon or not. So, for '''s''' <nowiki>=</nowiki> '''6''', the prime should fall in either modulus '''1''' or '''5'''. For '''s''' <nowiki>=</nowiki> '''24''', the prime-moduli are: '''1, 5, 7, 11, 13, 17, 19,''' and '''23''', etc.

By passing all the above criteria, we have reduced the dimensionality{{sic}} of the problem considerably. By requiring the selection of only '''8''' moduli from the total of '''24''', we have eliminated '''2/3''' of the numbers’ space that requires search activity. Searching for numbers ending with digits '''1, 3, 7,''' and '''9''' along these moduli will further reduce the number of possibilities by '''1/5'''. Therefore, the remaining percentage of the numbers’ space we need to search in is around '''1/3⋅4/5''' <nowiki>=</nowiki> '''0.266''', less than '''30%''' of the total space.

|||Grant et al. (2019)<ref name="quasiprimes"/>}}

The proposed '''15/4'''-fold speedup leads to {{wpl|time complexity}} of '''𝒪 ((4/15)n²)''', but unfortunately for Grant, in grown-ups' algorithm analysis, coefficients are ignored as insignificant<ref>Noble Mushtak (Dec. 27, 2016). [https://math.stackexchange.com/a/2074157 "Why are we allowed to ignore coefficients in Big-O notation?"]. Via [https://math.stackexchange.com/ Via Math Stack Exchange].</ref> when evaluating the algorithm's time complexity, and thus, the algorithm still runs in '''𝒪 (n²)''', or quadratic time, which in the industry, is considered nothing short of "horrible".<ref name='bigocheatsheet'>Rowell et al. (2012—). [https://www.bigocheatsheet.com/ Big-O Cheat Sheet].</ref> The reason for the quadratic time complexity comes from the algorithm's last step:

{{cquote|
Once the number passes all the above, we proceed to the final step; to check whether it belongs to the Q-prime grid or not. If the original number '''n''' is found within the grid, then it is not a prime. Otherwise, it is a prime by definition.
|||Grant et al. (2019)<ref name="quasiprimes"/>}}

On closer inspection, this seemingly innocuous step turns out to be quite the fine print, as Grant et al. conveniently fail to mention the work required to generate the Q-prime grid, and the memory requirements to store it.

'''The Q-grid and Quasi-primes'''

In the paper, the Q-prime grid is defined as a multiplication table, the horizontal and vertical headers of which contain:
# The required range of primes
# What the authors call quasi-primes, which are defined as {{wpl|composite numbers}} with prime factors greater or equal to '''5'''.

However, for semiprime factoring (which is what breaking RSA requires), on page 6 the authors explicitly want to remove the quasi-primes from the grid's headers:

{{cquote|And because when we search for the prime factors of some semiprime number we need to remove the non-prime numbers from both axes of the Q-grid, like '''25, 35, 49''' etc., the problem will automatically reduce to simply locating the number in the Q-grid, with its horizontal and vertical projections on both axes being its prime factors.|||Grant et al. (2019)<ref name="quasiprimes"/>}}

Now, the multiplication table only has the required range of primes in its vertical and horizontal headers. The rest of the cells are semiprimes, that are the product of their matching header-cells' primes.

The same quote also presents the factoring method: perform a reverse lookup in a {{wpl|Precomputation|precomputed}} lookup table.

'''Determining the Q-grid size'''

The Q-grid's memory requirement depends on the area of the grid, which in turn depends on knowing the number of cells in the grid's headers that form the top and left sides. To know that, we need to know how many valid RSA primes are there, and to know that, we need to know the upper and lower limit for the valid primes.

'''The smallest and largest header value'''

The modern {{wpl|Key size#Asymmetric algorithm key lengths|RSA key sizes}} are 2048, 3072, and 4096 bits, and some programs like OpenSSH support even 16,384-bit keys.<ref>The OpenSSH Project. [https://github.com/openssh/openssh-portable/blob/0d96b1506b2f4757fefa5d1f884d49e96a6fd4c3/openbsd-compat/openssl-compat.h#L46 "OpenSSH RSA maximum limit for public key modulus size (16,384 bits)"]. Via github.com.</ref>

Since 3072-bits is the current recommendation,<ref>National Security Agency (NSA) (2016). [https://www.keylength.com/en/6/ "NSA CNSA Suite key size recommendations"]. Via keylength.com.</ref> it will be used below. A 3072-bit RSA public key is created by multiplying two 1536-bit primes.<ref>Pornin, Thomas (June 24, 2015). [https://crypto.stackexchange.com/a/26493 "What prime lengths are used for RSA?"]. Via Cryptography Stack Exchange.</ref>

The primes in RSA have strict upper and lower limits to their value: For '''N''' bit public key, the primes must be greater than <math>2^{(N-1)/2}</math>, and lesser than <math>2^{N/2}</math>.<ref name=nist_rsa_key_requirements>National Institute of Standards and Technology (NIST) (March 2019). [https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-56Br2.pdf#page=47 "Recommendation for Pair-Wise Key-Establishment Using Integer Factorization Cryptography"]. NIST Special Publication 800-56B rev 2, Subsection 6.2.1.3.</ref>

'''The number of primes in the header'''

To estimate how many primes the grid's header cells would need, the {{wpl|Prime_number_theorem#Statement|prime number theorem}} states the number of primes below '''n''', is '''π(n) ≈ n / ln(n)'''.

Calculating the number of all primes up to 3072-bit ones, and subtracting from it the too-small primes (up to 3071-bit ones), results in

<math>P = \frac{2^{3072/2}}{\ln(2^{3072/2})} - \frac{2^{3071/2}}{\ln(2^{3071/2})} = 6.6 \cdot 10^{458}</math> valid primes to choose from for each key.<ref name='rsa_primality_checks' group='equation'>[https://www.wolframalpha.com/input?i=%282%5E%283072%2F2%29+%2F+ln%282%5E%283072%2F2%29%29%29+-+%282%5E%283071%2F2%29+%2F+ln%282%5E%283071%2F2%29%29%29 "The prime factor space of RSA-3072"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

Thus, the Q-grid for RSA-3072 has sides that are '''P = 6.6 ⋅ 10⁴⁵⁸''' cells long. 

'''Number of cells in the Q-grid'''

A naive Q-grid would have '''P² = 4.39 ⋅ 10⁹¹⁷''' cells.<ref group='equation'>[https://www.wolframalpha.com/input?i=%28%28%282%5E%283072%2F2%29+%2F+ln%282%5E%283072%2F2%29%29%29+-+%282%5E%28%283072-1%29%2F2%29+%2F+ln%282%5E%28%283072-1%29%2F2%29%29%29%29%5E2 "Naive number of cells in Q-grid for RSA-3072"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> 

'''Q-grid size optimization''' 

Due to the {{wpl|Commutative property|commutativity}} of multiplication, a little less than half of the multiplication table is duplicates. The diagonal center-line of the grid's cells has '''P''' unique values in it, thus the accurate number of duplicates is '''(P²-P)/2'''.

The number of cells in the optimized Q-grid is thus '''A = (P²-P)/2 = 2.19 ⋅ 10⁹¹⁷''' cells.<ref group='equation'>[https://www.wolframalpha.com/input?i=1%2F2*%28%28%282%5E%283072%2F2%29+%2F+ln%282%5E%283072%2F2%29%29%29+-+%282%5E%28%283072-1%29%2F2%29+%2F+ln%282%5E%28%283072-1%29%2F2%29%29%29%29%5E2 "Optimized number of cells in Q-grid for RSA-3072"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>


'''Time complexity''' 

The algorithm requires populating the grid by performing at least '''P = 6.6 ⋅ 10⁴⁵⁸''' primality tests to fill the headers. It also needs to perform '''A = 2.19 ⋅ 10⁹¹⁷''' multiplications to populate the grid, and an equal number of search operations to find the factors of the semiprime. These two latter steps both take in the order of '''n²''' steps, which means the factoring algorithm time complexity is locked to '''𝒪 (n²)''', which, again, as a classification is considered "horrible".<ref name='bigocheatsheet'/>

'''The computational workload''' 

To put the computational requirement of '''6.7 ⋅ 10⁹¹⁷''' operations on the scale, Frontier, the fastest supercomputer today<ref>TOP500.org (c) (November 2023). [https://www.top500.org/system/180047/ Frontier supercomputer] Via top500.org</ref> performs '''1.68 ⋅ 10¹⁸''' operations per second, and by the time our [[Sun]] dies in five billion years,<ref>National Aeronautics and Space Administration (NASA) (October 25, 2023).[https://science.nasa.gov/sun/facts/ "Our Sun: Facts"] via nasa.gov</ref> that supercomputer would have performed a measly '''2.65 ⋅ 10³⁵''' operations.<ref group='equation'>[https://www.wolframalpha.com/input?i=1.68*10%5E18+FLOPS+*+%28seconds+in+5+billion+years%29 "Number of calculations the 'Frontier' supercomputer performs before our Sun turns into a white dwarf"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

'''Space complexity''' 

Storing '''(P²-P)/2''' cells is in the order of '''n²'''. This sets the {{wpl|space complexity}} of this algorithm to '''𝒪 (n²)''', which is again, is considered "horrible".<ref name='bigocheatsheet'/>

'''The memory requirement''' 

To keep the math simple yet fair, instead of '''3072''' bits per semiprime cell, and '''1536''' bits per header cell, we assume all cells are '''1536''' bits.

With '''1536''' bits per cell, the grid requires a meek '''4.214 ⋅ 10⁹⁰¹''' Exabytes of storage.<ref group='equation'>[https://www.wolframalpha.com/input?i=%281%2F2*%28%28%282%5E%283072%2F2%29+%2F+ln%282%5E%283072%2F2%29%29%29+-+%282%5E%28%283072-1%29%2F2%29+%2F+ln%282%5E%28%283072-1%29%2F2%29%29%29%29%5E2%29+*+1536%29+bits+to+exabytes "Q-grid size for RSA-3072"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> 

Storing '''4.214 ⋅ 10⁹⁰¹''' Exabytes of data runs into a lot of problems, the most pressing of which is, that there only exists '''3.28 ⋅ 10⁸⁰''' subatomic particles in the entire observable universe to use as memory,<ref name='total_subatomic_particles'>Padilla, Tony (July 10, 2017). [https://www.youtube.com/watch?v=lpj0E0a0mlU "How many particles in the Universe?"]. The University of Nottingham. Via [https://www.youtube.com/@numberphile Numberphile].</ref> and to put it mildly, that's not enough.

'''The energy consumption''' 

The {{wpl|Landauer's principle}} states that the most energy-efficient computer the laws of physics theoretically allow must consume at least '''2.9 ⋅ 10⁻²¹''' Joules per operation. Ignoring any factoring algorithms, just incrementing a counter in a program from '''0''' to '''6.7 ⋅ 10⁹¹⁷''', would have to consume at least '''5.4 ⋅ 10⁸⁹³''' Watt hours of energy.<ref group='equation'>[https://www.wolframalpha.com/input?i=%282.9*10%5E%28%E2%88%9221%29%29+*+%286.7*10%5E917%29+joules+to+watt+hours%29 "Minimum Watt hours to count to 6.7*10^917"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

In comparison, the Sun's total energy output to the space is only '''3.86 ⋅ 10²⁶''' Watts,<ref>Kennewell, John; McDonald, Andrew (March 25, 2016). [https://www.sws.bom.gov.au/Educational/2/1/12 "The Solar Constant"]. The Bureau of Meteorology, Australia</ref> which over its remaining, five billion year lifespan, yields "mere" '''1.7 ⋅ 10⁴⁰''' Watt hours in total.<ref group='equation'>[https://www.wolframalpha.com/input?i=%283.86*10%5E26+Watts+*+five+billion+years%29+to+watt+hours "The Sun's energy output in Watt hours over its remaining five billion years"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

'''Wasted effort'''

Building a complete Q-grid is completely unnecessary in any case. Constructing the grid requires determining all valid prime candidates. During this first stage, for every prime '''p''' generated, one can simply perform a trial division on the given semiprime '''N''', to see if '''N ≡ 0 (mod p)''', or in layman's terms, to see if the prime '''p''' divides '''N''' evenly. If it does divide evenly, '''p''' has been found, and the other factor is '''q''' <nowiki>=</nowiki> '''N/p'''. With this method, the space requirement is removed entirely, the computing time spent on computing the grid's non-header values is eliminated, and no separate search in the grid needs to be performed. As this is essentially {{wpl|Trial_division|trial division|,}} the time complexity improves drastically from '''𝒪 (n²)'''  to '''𝒪 ( √(n) )'''.

This, of course, doesn't mean the algorithm can be made practical. Performing '''P = 6.6 ⋅ 10⁴⁵⁸''' primality tests alone exceeds the lifetime of our Sun and the total energy it produces before it dies. Clearly, the authors have never even considered the actual steps required to run the algorithm in full. Alternatively, they knew full well, and they intentionally neglected the Q-grid having the most significant impact on the actual time complexity and pretended that the speedup coefficient of '''4/15''' mattered.

'''Misleading prime "prediction":'''

Crown Sterling has implied the findings of the paper allow "predicting" primes used in RSA:

{{cquote| […] Identifying for the first time, an infinitely predictable prime number pattern […] This new discovery enables large prime factorization using standard computers, thus rendering obsolete all static factorizing encryptions, presently used in public key cryptography.|||Crown Sterling (TIME AI trailer)<ref name="cryptoencabulator"/>}}

This is a lie. When they say "predicting", they don't mean predicting which primes were picked for the private key. They mean "predict" if some number is a prime, i.e. "primality testing". Primality tests are used in RSA key generation, where the system generates large random numbers and checks their primality.<ref>National Institute of Standards and Technology (NIST) (Feb. 3, 2023). [https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-5.pdf#page=77 "Construct a Provable Prime (Possibly with Conditions) Based on Contemporaneously Constructed Auxiliary Provable Primes"] Digital Signature Standard (DSS). Via nist.gov</ref> If an RSA key generation algorithm could break RSA, cryptographers "probably" would have noticed it. This is why Apollo's early pitch<ref name=apollo/> to Grant regarding primality tests influencing RSA security was so stupid.

As was shown above, the pool of valid RSA-3072 primes has '''6.6 ⋅ 10⁴⁵⁸''' primes to randomly choose from.

Even with an efficient primality testing algorithm (such as the {{wpl|Lucas–Lehmer_primality_test|Lucas-Lehmer primality test}}), being able to test if some number belongs in that pool of valid primes, doesn't help in any way to guess which two primes were picked at random from the pool.

Guessing the primes is '''5.73 ⋅ 10³⁸¹''' times harder than guessing the AES-256 key that was delivered using RSA, and that's used to protect the data in transit.<ref group='equation'>[https://www.wolframalpha.com/input?i=%286.6*10%5E458%29+%2F+%281.15*10%5E77%29 "How many times harder is guessing an RSA-3072 prime, than guessing an AES-256 key"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

In layman's terms, the claim of predicting primes is exactly as useful for breaking RSA, as "predicting" if '''72''' is a valid number for a Powerball lottery ticket, is useful in winning the lottery itself. By knowing one is only supposed to guess numbers between '''1''' and '''69''', they're no longer guaranteed to lose, but they still need to beat the odds. Only with RSA-3072, the probability of guessing the primes, is comparable to winning the Powerball jackpot ('''1''' in '''292,200,000'''),<ref>The Associated Press (July 19, 2023). [https://archive.ph/gsoVP "How hard is it to win the lottery? Odds to keep in mind as Powerball and Mega Millions jackpots soar"]. Archived from [https://apnews.com/article/powerball-mega-millions-winning-odds-numbers-a3e5a8e8e7ed15d7500c1d6acdab6785 AP News] on Jan. 22, 2024.</ref> '''55''' times in a row.<ref group='equation'>[https://www.wolframalpha.com/input?i=%281%2F292200000%29%5En+%3D+%281%2F%282%5E1536%29%29 "Odds of guessing a RSA-3072 prime, compared to the number of times needed to win Powerball jackpot"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

==== The "results" ====

Page 6 of the paper discusses the so-called results:

{{cquote| The algorithm is programmed based on the search criterion we mentioned earlier along with other supporting conditional statements that exploit the properties and geometry of the Q-grid such that the search is both effective and optimized. '''This has already been achieved by the team at Crown Sterling located in Newport Beach, California. The results were excellent, in terms of accuracy and speed, and were achieved by deploying laptops and desktops with standard specifications and computing power.'''

|||Grant et al. (2019)<ref name="quasiprimes"/>}}

As the emphasized section shows, Grant and Ghannam have not even bothered to fabricate results for the paper. "''Trust me, bro, the results were excellent''" is the opposite of what an academic paper provides, and given that even kids at elementary school know answers such as "''nuh-uh, not telling''" gets them an '''F''' from any exam, it doesn't take a rocket scientist to know whether Grant's preprint would have passed an actual academic peer-review.

==== The aftermath ====

[[File:Vaporpaper.png|thumb|right|Grant's announcement about efficient semi-prime factoring with "''Q-grid matrix method''".]]

After the Black Hat conference, Grant tweeted about claimed improvements:

{{cquote|Dan Guido and Mark Carney you may have both missed my comment yesterday that our prime factoring efforts leveraged the icositetragon geometry, however, in the process we identified  algebraic/geometric equation approaches, which we have not released, none require indexing.
|||Robert Edward Grant (CEO, Crown Sterling)<ref>Grant, Robert (Aug. 10, 2019). [https://archive.ph/aT6vG "Dan Guido and Mark Carney you may have both missed my comment yesterday that our prime factoring efforts leveraged the icositetragon geometry, however, in the process we identified  algebraic/geometric equation approaches, which we have not released, none require indexing."]. Archived from [https://twitter.com/Robert_E_Grant_/status/1159988497601589249 Twitter] on Jan. 28, 2024.</ref>}}

Just under three weeks later, Grant announced on Instagram these claims were being written out by Grant and Ghannam as a paper, titled "''Geometry-Based Prediction Algorithm of Semi Prime Numbers''". The abstract blathered something about the "''Q-grid matrix method''", but the paper was never completed, most likely because Grant and Ghannam knew they were full of shit.

Further proof of this is Grant and Ghannam's book ''Philomath''<ref name='philomath'>{{cite book|last=Grant|first=Robert|date=April 2021|title=Philomath - The Geometric Unification of Science & Art through Number |publisher=Independently published|page=127|ISBN=979-8736939466}}</ref> that was released almost two years later in 2021, that after rehashing what the quasi-prime paper<ref name='quasiprimes'/> said, states

{{cquote|Now, if the number '''n''' resides along or close to the reflection line of the Q-grid, then primality confirmation is simple. We only need to look for numbers at or close to
'''√(n)''' on both axes of the grid. These two numbers will define two small strips that intersect on a small area where we need to look for this number. Beyond this area, numbers either get larger or smaller than '''n'''. On the other hand, if the number '''n''' is far from the reflection line, then solving the problem requires more complex analysis. Thus, devising algorithms that can search for these numbers without the need to calculate large portions of the Q-grid is an important step in refining and optimizing primality confirmation results. Similar to the case of primality testing, performing prime factorization using the Q-grid method requires the implementation of a search algorithm that is programmed based on the search criterion we mentioned earlier, along with other supporting conditional statements that exploit the geometry of the Q-grid. The problem's geometrical aspect will be explained further in Part III, where we discuss the many interesting and novel methods we have discovered in the process, which in return, rewarded us with so much insight into not only this specific problem but into so many aspects of the physical reality as well.|||Grant et al. (Philomath, 2021)<ref name='philomath'/>}}

Part III discussed not the "''Q-grid matrix method''" but weird "''Quadrant Symmetries''", discussed quasi-primes that the authors had previously said have no place in the Q-grid for semi-prime factoring, showed that summing numbers produce sums of said numbers, threw in the words North and South, went into a tangent about quadrants of a {{wpl|Unit_circle|unit circle|}} and after hoping the reader had forgotten about what they were promised, ended with 

{{cquote|
All the above hints to an evident conclusion: that numbers are geometric in nature, and their affinity to circles is most obvious. Their real powers, properties, relationships, etc., are observed and make sense only when they are distributed circularly instead of linearly. This is something we observed early on in the D-space, as only when numbers are distributed around circles that their numeric symmetries and relationships become readily apparent and meaningful. Therefore, it makes no sense to separate numbers and geometry from each other; they should always be studied together as a coherent entity. It is only through this geo-numeric domain that scientific mysteries can be discovered and solved.

|||Grant et al. (Philomath, 2021)<ref name='philomath'/>}}

No "''Q-grid matrix method''" was ever presented, the authors never presented an efficient way to factor semi-prime numbers with the Q-grid, and the Q-grid of semi-primes was never mentioned again in the book (although the authors re-used the term "Q-grid" later in another context).

Most of the concepts that were in the "improvements" of part III of the book, were already present in Grant's PDF "''Quaternion Symmetry Inherent to the Icositetragon''"<ref>Grant, Robert (July 6, 2018). [https://web.archive.org/web/20210704054245/https://74b8e51b-1d9c-4e9b-b6af-aaa822d757f7.filesusr.com/ugd/b8252f_ca5b51532c1c4cda95e2bf71af34e306.pdf "Quaternion Symmetry Inherent to the Icositetragon"]. Archived from [https://74b8e51b-1d9c-4e9b-b6af-aaa822d757f7.filesusr.com/ugd/b8252f_ca5b51532c1c4cda95e2bf71af34e306.pdf filesusr.com] on July 4, 2024.</ref> that he had uploaded online back on July 6, 2018.<ref>Grant, Robert (July 5, 2018). [https://archive.ph/u8va8 "Quaternion Symmetry Inherent to the Icositetragon – Publication"] Archived from [https://robertedwardgrant.com/quaternion-symmetry-inherent-to-the-icositetragon-publication/ https://robertedwardgrant.com] on Feb. 2, 2024.</ref> This begs the question: If Grant already had the supposed improvements one year before Black Hat 2019, why didn't he include them in the presentation? Why did he come to the conference with a method that has quadratic (worthless) time and space complexity, and then pretend he was doing active research on the topic when he had eight months to add the supposed improvements to the crank preprint he uploaded to arXiv? Why didn't the preprint even mention a work-in-progress regarding the Q-grid matrix method? The simple reason is Grant is making it up as he goes, and he knows his marks don't fact-check him, ever.

==== Summary ====
In summary, the described factoring method is a trivial reverse lookup in a massive table called the Q-grid. With relevant, average size RSA-keys (3072-bits), Q-grid's 
* '''𝒪 (n²)''' time complexity means the time requirement exceeds the clock counting to the death of our Sun,
* '''𝒪 (n²)''' space complexity means the observable universe doesn't have enough particles to use as the memory for the grid, and 
* Table population and search both have an energy requirement that is more than a perfect {{wpl|Dyson sphere}} could collect from our Sun during its remaining lifetime, to feed the most energy-efficient computer the laws of physics allow.

The algorithm's claimed speedup factor of '''15/4''' is so small it is ignored in the big-O notation. 

In layman's terms, with modern key sizes, the size of the problem is comparable to being tasked with eating an entire pizza the size of {{wpl|Milky_Way|Milky Way|,}} our galaxy. Grant and Ghannam boasting that with their algorithm, one only needs to eat '''4/15''' of it, isn't exactly helping. Nobody has a belly big enough for the cosmic Margherita slices.

The later ''Q-grid matrix method'' that was claimed to cut the size of the original pizza was unfortunately for Grant, never backed by anything, and as [[Hitchens's razor]] states, that which can be asserted without evidence can also be dismissed without evidence.

=== The medicine show === 
After the refutal of his preprint, the Black Hat PR crisis, Schneier's searing article, and staff quitting Crown Sterling, Grant had to turn the tide. And he had a plan to crack RSA once and for all. On September 19, 2019, Grant hosted a {{wpl|medicine show}}<ref>Gallagher, Sean (Sept. 20, 2019). [https://archive.ph/Qgxck "Medicine show: Crown Sterling demos 256-bit RSA key-cracking at private event"]. Archived from [https://arstechnica.com/information-technology/2019/09/medicine-show-crown-sterling-demos-256-bit-rsa-key-cracking-at-private-event Ars Technica] on Sept. 21, 2019.</ref> for the press and non-technical men in suits. During the show, Grant and the company representatives factored a 256-bit RSA key with a program the company had titled the ''CS BiPrime Algorithm (ver. 1.1)''.

{{collapse|The medicine show recording|width=500}}
{{video|youtube|E58YOQZ7tr8}}
{{collapse end}}

==== Plagiarism ====
{{main|Plagiarism}}
[[File:Medicine show.png|thumb|right|Screenshot from the event video<ref name="medicine_show">Crown Sterling (Sept. 21, 2019). [https://www.youtube.com/watch?v=E58YOQZ7tr8&t=445s "Crown Sterling Decrypts RSA Asymmetric Public Keys in Live Demonstration"]. Via [[YouTube]].</ref> shows using SSH to connect to another computer in the local network, an impossible amount of RAM for a laptop, and the leaked CADO-NFS Info-message.]]

Unfortunately for Grant, the demonstration video<ref name="medicine_show"/> showed how Grant's team had botched their efforts to suppress all Info-messages from the CADO-NFS program<ref>CADO-NFS Development Team (2006–). [https://cado-nfs.gitlabpages.inria.fr/ CADO-NFS, a software implementation of the Number Field Sieve (NFS) algorithm]. gitlabpages.inria.fr.</ref> they plagiarized, as one of the messages, which is verifiable from the CADO-NFS August 2019 source code,<ref>CADO-NFS Development Team (August 22, 2019). [https://gitlab.inria.fr/cado-nfs/cado-nfs/-/blob/f6cc04421fcfa84dad3bd87be849a0b25797907e/scripts/cadofactor/toplevel.py#L890 CADO-NFS source line for the popped Info-message from August 22, 2019].</ref> popped onto the screen:

 Info:root: Set tasks.threads=32 based on detected logical CPUs

This of course was noticed immediately the next day when the video went live.<ref>@vytvso (Sept. 20, 2019). [https://archive.ph/JI6Aa "If they are *so* unique why they should use the same output like CADO-NFS? Or their code is based on it ..."]. Archived from [https://twitter.com/vytvso/status/1175068882568192000/photo/1 Twitter] on Jan. 5, 2024.</ref>

Clearly, all Grant needed for success was an [[open source]] program, like CADO-NFS borrowed from its developers, and the idea of ''using someone else's technology to advance his [[Charlatan|grift]]'', that he borrowed from {{wpl|Theranos||.}} 

Furthermore, on the video,<ref name="medicine_show"/> one of the team members claimed the factoring was being done on the local device, that was an Apple laptop. However, judging by CADO-NFS output, the laptop apparently had an impossible amount of 97GB of RAM, and the team also managed to botch hiding the fact they used {{wpl|Secure Shell|SSH}} to remotely connect to a beefier computer for the semiprime factoring.

==== Records from the Soviet age ====
[[File:512-bit RSA.png|thumb|right|Screenshot from Grant's Instagram on July 2, 2019, shows him spending the summer preceding Black Hat, fighting windmills that turn out to be random YouTubers' softball challenges. Grant's mischaracterization that 512-bit RSA takes over millennia to crack, is nothing sort of idiotic, given that 512-bit RSA was broken by Riele et al. on August 22, 1999, using the exact same algorithm Grant plagiarized, in just 5.2 months.<ref name='honor_roll'>RSA Factoring Challenge Administrator (Jan. 30, 2002). [https://www.ontko.com/pub/rayo/primes/hr_rsa.txt "RSA Honor Roll - As of March 5, 1999"] via ontko.com.</ref>]]

During the event Grant and his team factored a minuscule 256-bit RSA key, hoping the layman would not understand the difference between asymmetric and symmetric key strength, and incorrectly associate the 256-bit asymmetric RSA key they broke with 256-bit symmetric encryption (a key size often hand-wavily labeled as “''military-grade''”). The industry experts immediately passed warnings to [[journalist]]s about the obvious attempt to mislead.<ref>@SwiftOnSecurity (Sept. 20, 2019). [https://archive.ph/Uhd2A "JOURNALISTS: You may be seeing claims about cracking “256-bit encryption” today. DO NOT REPRINT THAT, IT IS MISLEADING CLAIM ON PURPOSE. They selected that bitlength as a part of their misinformation campaign to confuse you and the public. I asked @ParagonIE to tweet about why."]. Archived from [https://twitter.com/SwiftOnSecurity/status/1175165892570812417 Twitter] on Sept. 20, 2019.</ref>

In reality, to break a key with 256-bit level symmetric security, Crown Sterling would have needed to factor a 15,360-bit RSA key.<ref>ECRYPT-CSA (2018). [https://www.keylength.com/en/3/ "ECRYPT-CSA Recommendations"]. Via keylength.com.</ref><ref group=note>Interestingly enough, the GNFS that Crown Sterling plagiarized, is the most efficient classical factoring algorithm, and precisely because it's so efficient, RSA's key size requirements for some symmetric security level are noticeably larger when compared to those of symmetric or elliptic curve algorithms.</ref> Such an attempt would have been unlikely to succeed, given that based on the public {{wpl|RSA Factoring Challenge#The prizes and records|RSA factoring records|,}} none of the people who are not lying, have publicly factored any RSA-key larger than 829 bits.

To put breaking a 256-bit RSA key in 2019 into the right context, a much larger, 330-bit key was broken by Lenstra et al. slightly earlier, April 1991 to be exact.<ref name='honor_roll'/> Coincidentally, Lenstra happens to be part of the team that created the GNFS algorithm,<ref name='lenstra_1993'>A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, “[The Number Field Sieve https://link.springer.com/chapter/10.1007/BFb0091537],” in A. K. Lenstra and H. W. Lenstra, Jr. (eds.) The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, New York, pp. 11–42, 1993.</ref> that Grant plagiarized during the medicine show.

In fact, the key size is so weak, breaking it was used as a quick, beginner friendly, intermediate-level assignment in the CUCTF {{wpl|Capture_the_flag_(cybersecurity)|Capture the Flag}} event just weeks later.<ref name="cuctf">CTFtime team (Sept. 28, 2019). [https://ctftime.org/task/9338 Crown Sterling]. Via ctftime.org.</ref>

{{cquote|I recently watched this amazing youtube video by Crown Sterling. They showed an advanced algorithm, the Crown Sterling BiPrime Algorithm (ver. 1.1), that was capable of cracking 256-bit RSA keys in under a minute. Now you have to implement it if you want to have any hope of cracking my secret message in time! Don't forget to merge and remove duplications after checking your disk space!|||CTFtime team (CUCTF 2019).<ref name="cuctf"/>}}

The assignment was so easy it was rewarded with only 150 points. The more challenging ones were awarded 600 points each.<ref>CTFtime team (Sept. 28, 2019). [https://ctftime.org/event/897/tasks/ "CUCTF 2019 Tasks"]. Via ctftime.org.</ref>

On Crown Sterling's video, it takes 51.92 seconds to factor the 256-bit semiprime 

 83473593554391843334619428139045661537976651941410655062632649869770538548577

Cursory experiments show a relatively new, mid-price AMD Ryzen 7800X3D CPU factors the same semiprime with CADO-NFS in 44.67 seconds, even though it has half the number of threads compared to Crown Sterling's server they ran CADO-NFS on. Thus, the only logical reason for Crown Sterling to call the press to watch them do something anyone's workstation can do in the same time give or take a few seconds, was to mislead the audience. 

These second-scale differences are as insignificant as the key sizes Crown Sterling broke, but they do show a decent desktop computer is already factoring semiprimes faster than the system in Crown Sterling's clown show did, and yet, the world keeps spinning. The second-scale differences did matter to the grifters though, who were desperately trying to get any positive press. 

After Black Hat 2019, Grant had tried to challenge Jean-Philippe Aumasson not just into cracking their cipher, but also into a competition about who could break a 512-bit RSA key the fastest.<ref>Grant, Robert (Aug. 10, 2019). [https://archive.ph/TT911 "Of course I meant factoring a bi-Prime into its primes factors. Rules: We will do the test on 512Bit (155 decimal digits). I will send you a number and you will send me a number. We will do it simultaneously at a predetermined time."]. Archived from [https://twitter.com/Robert_E_Grant_/status/1160088276042039296 Twitter] on Jan. 31, 2024.</ref> The medicine show and its plagiarism shows Grant was hoping to change the public topic on Twitter from the relevant "who has the best algorithm when its time complexity is analyzed by experts on paper", into "who can afford the most expensive {{wpl|Amazon Elastic Compute Cloud|AWS EC2}} instance to run the CADO-NFS on".
When problem sizes approach the size of modern cryptographic key spaces, even a modest time complexity change affects the algorithm runtime by astronomical units of time. Competing over seconds in results is thus pointless, often within the margin of error, and always governed by computing power. No wonder nobody wanted to entertain another of Grant's PR grifts.

The absurdity and the obscene levels of crankery in the medicine show naturally led to the infosec community roasting the fudge out of the company on Twitter.<ref>[https://archive.ph/16d5s Post-medicine show roasting-thread (Twitter)]. Archived from [https://twitter.com/thepacketrat/status/1175017645097328640 Twitter] on Sept. 25, 2019.</ref>

=== Reciprocal factoring ===
[[File:Screenshot_of_Grant%27s_Instagram_post_on_Sept_22,_2019.png|thumb|right|Screenshot of Grant's Instagram comment from Sept. 22, 2019, where he claimed reciprocal factoring will break large RSA keys.]]

After facing ridicule over the medicine show, Grant must have realized it was too late to convince the academia and industry, as he opted to publish his RSA factoring "algorithms" on the respected journal of [[Instagram]] wall. 

On September 22, 2019, three days after the medicine show, Grant revealed on Instagram he had already put his business degree to good use and designed a replacement for the {{wpl|General number field sieve|General Number Field Sieve (GNFS)|,}} the world's fastest classical factoring algorithm he had just [[Plagiarism|plagiarized]]:

His idea was to find prime factors '''p''' and '''q''' of semiprime '''N''' from the decimal expansion of the semiprime's reciprocal, '''1/N'''. 

'''Impossible time complexity'''

[[File:Grant_instagram_post_on_reciprocal_factoring.png|thumb|right|Grant's Instagram post of reciprocal factoring. The red arrow points to the imperfect cropping edge that attempts to deceive the reader into thinking the primes exist trivially close to one another.]]

As the (lower) screenshot shows, Grant claimed the algorithm has an interesting property:

{{cquote|Paradoxically, the longer the BiPrime you desire to factor, the easier to locate the long consecutive prime string embedded within its '''1/x''' reciprocal value.|||Robert Edward Grant (CEO, Crown Sterling)}}

Having solution complexity be inversely proportional to the size of the problem is the kind of claim a numerologist, who believes in literal magic, would make. Grant is essentially making the claim the algorithm runs in '''𝒪 (1/n)''', which is faster than '''𝒪 (1)''', or constant time, which happens to be the best possible time complexity classification for any algorithm. 

As any meaningful algorithm cannot get faster as the input grows,<ref>Stack Overflow Community (Jan. 24, 2021). [https://stackoverflow.com/questions/905551/are-there-any-o1-n-algorithms "Are there any O(1/n) algorithms?"]. Via Stack Overflow.</ref> this claim was so stupid it broke Hitchens's razor. Yet, that did not stop Grant from applying for a [[patent]] for this crankery,<ref>USPTO.report (May 26, 2022). [https://uspto.report/patent/app/20220166618 "Decryption of Encrypted Data Missing a Private Key"]. Via uspto.report.</ref> in the hopes of drawing authority from an established institution, and attracting investors with more money than sense.

'''Minuscule keys'''

[[File:Grants patent rant.png|thumb|right|150px|On August 19, 2022, Grant announced his worthless patent, while his middle fingers did most of the talking about who he really is inside.]]

In an Instagram comment Grant claimed the method could break ''large'' RSA keys.

No exact definition for ''large'' was made, but it's definitely less than six inches, since in Grant's YouTube explainer,<ref name="yt_novel_reciprocal_factoring_expained">Grant, Robert (July 20, 2020). [https://www.youtube.com/watch?v=Wb9tweG248s "Novel Reciprocal Wave Factorization Explained: A x B = C"]. Via [[YouTube]].</ref> he says it works with keys that are "''32-bit and all the way out''". In Grant and Ghannam's book ''Philomath'' (2001),<ref name='philomath'/> Grant reveals they were able to find prime factors for 24-bit semiprimes, and in his document on reciprocal factoring<ref name=reciprocal_factoring_document>{{cite journal|last=Grant|first=Robert|date=June 2020|title=Reciprocal Wave Factorization|page=18}}</ref> Grant et al. state they have limited their studies to "''32-bit semiprimes at maximum''".

No explicit claims of finding factors of relevant size (2048-bit or larger) semiprimes were presented. Grant's YouTube crankery video<ref name="yt_novel_reciprocal_factoring_expained"/> implied 2048-bit keys, but with that Grant stumbled and hurt himself badly with the shards of Hitchen's razor.

This did not stop Grant (and the co-author Ghannam) from blatantly lying about the origin of the factored semi-primes in their book Philomath, and thus from giving the semi-primes false credibility and their size ridiculously exaggerated importance:

{{cquote|After succeeding in finding the prime factors (one or both) for almost all 12-bit semiprimes, we randomly tested 4,027, '''24-bit public keys provided by the RSA official website'''.|||Grant et al. (Philomath, 2021)<ref name='philomath'/>}}

The claim that the RSA official website had 24-bit RSA keys is a complete lie: the smallest number ever hosted on the RSA Laboratories website was RSA-576,<ref>[https://web.archive.org/web/20040523051446/http://www.rsasecurity.com:80/rsalabs/node.asp?id=2093 "The RSA Challenge Numbers"]. Archived from [http://www.rsasecurity.com/rsalabs/node.asp?id=2093 rsasecurity.com] on May 23, 2004.</ref> the range of RSA factoring challenges started from 100 digits,<ref>van Tilborg, Henk C.A. (2005). [https://raphiinconcordia.files.wordpress.com/2015/10/encyclopedia-of-cryptography-and-security.pdf#page=448 "Encyclopedia of Cryptography and Security" p. 435 (448)]</ref> and the smallest RSA challenge, the {{wpl|RSA_numbers#RSA-100|RSA-100|,}} had a 330-bit public key.

'''Lack of functional correctness'''

In his YouTube video,<ref name="yt_novel_reciprocal_factoring_expained"/> Grant claimed the algorithm only works with numbers whose reciprocal's decimal expansion is periodic. However, this is a lie, as e.g. '''1/(11⋅13) = 0.006993…''' is periodic but does not contain the prime factors '''11''' or '''13''', as pointed out by the user Squeamish Ossifrage in their Stack Exchange answer.<ref name="stack_exchange_reciprocal_factoring"/> The algorithm therefore does not work reliably, even with small numbers.

'''Nonexistent efficiency'''

In his Instagram post, Grant implied the prime factors can be found relatively close to one another, implying the method is highly efficient in stumbling upon the prime factors. However, as explained<ref name="stack_exchange_reciprocal_factoring"/> by Squeamish Ossifrage:

{{cquote|The period of the decimal expansion of '''1/pq''' for prime '''p''' and '''q''' is <math>\operatorname{lcm}(\operatorname{ord}_p 10, \operatorname{ord}_q 10)</math>, which is usually not much smaller than '''pq'''.  If we model the expansion as a uniform random digit string '''pq''' (not '''log₁₀ pq''', but '''pq''') digits long, what's the probability of finding particular a <math>\log_b p</math>-digit string, namely '''p''', in it?  The expected number of times that any particular '''m'''-character needle appears as a substring of a uniform random '''h'''-character haystack in a '''b'''-symbol alphabet is '''(h − m + 1) b⁻ᵐ''' (proof: exercise for reader).  Here <math>m \approx \log_b p</math> and '''h ≈ pq''', so this is about <math>(pq - \log_b p + 1) b^{-\log_b p} \approx q.</math>  Cursory random experiments suggest that this is a reasonable model for the substring search, and I know of no theory that would suggest otherwise; it is up to the fraudsters to put up or shut up if they can prove anything better than this.

In other words, in this model, there's a reasonable probability that the method works if you're willing to search through about (say) '''2¹⁰²⁴''' possible candidate factors of the 2048-bit semiprime in question. Which, as it happens, is essentially random trial division. The fraudsters make it look easy by showing a screenshot with the answer already highlighted in a selectively cropped fragment that skipped over thousands of digits&nbsp;— about as many digits as the value of the numbers we're searching for.
|||Squeamish Ossifrage (2019)<ref name="stack_exchange_reciprocal_factoring"/>}}

Thus, not only does Grant's WolframAlpha screenshot show he has no idea how to implement his algorithms as programs, but it also shows his nonexistent Photoshop skills to cover his lie.

Furthermore, by resorting to random trial division, i.e. [[Monkey typewriter theory|monkeys-bang-typewriters-until-Hamlet-comes-out]] technology, Grant reveals he has failed to understand the purpose and time complexity of {{wpl|bogosort}} (bogosort = bogus+sort). Always a strong sign of expertise when someone comes up with a proposal for an algorithm the equivalents of which are used in the basic literature of the field and ''Algorithms 101'' college courses, as an example of the worst possible algorithm, and thus as a cautionary example of what one should definitely not do.

'''Summary'''

To summarize, after facing humiliation for factoring 256-bit keys 28 years too late, Grant decided to downgrade his CADO-NFS supercar into a {{wpl|Gravity racer|soapbox|,}} and factor 32-bit semiprimes with an algorithm that doesn't always work, that runs in '''𝒪 ( √(n) )''' which with RSA-3072 requires ridiculous '''2¹⁵³⁶''' operations,<ref group='equation'>[https://www.wolframalpha.com/input?i=sqrt%282%5E3072%29+%3D%3D+2%5E1536 "The number of operations required for factoring a 3072-bit RSA public key with trial division"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> and that by the definition of bogosort class of algorithms, makes exactly zero effort to intelligently solve the semiprime factoring problem.

=== Pythagorean factoring ===
On Christmas Eve, 2020, Grant uploaded his third poke at breaking RSA: the Pythagorean factorization method.<ref name=pythagorean_factorization>Grant, Robert (Dec. 24, 2020). [https://archive.ph/9VGZx "Prime Factor-Based Encryptions Rendered Useless by Right Triangle-Based Constant Time Solution"]. Archived from [https://robertedwardgrant.com/prime-factor-based-encryptions-rendered-useless-by-right-triangle-based-constant-time-solution/ robertedwardgrant.com] on Jan. 11, 2024.</ref>

''' The claims '''

[[File:Pq distance lie.png|thumb|right|x250px|Unsubstantiated claims by Grant, made on Telegram on April 8, 2022. RSA-keys with '''<nowiki>|</nowiki>p−q<nowiki>| = </nowiki>10¹³⁰⁰''', would have at least 8700-bit public keys.<ref name='modulus'>[https://imgur.com/a/WXRM65o "RSA modulus size with p-q distance > 10^1300"]. Via imgur.com</ref> Asserted without evidence, dismissed without evidence.]]

In his post, Grant's claims reached an entirely new level of crankery:

{{cquote|Prime Factor-Based Encryptions (both RSA and ECC which are used by Bitcoin wallets […] is now rendered useless BEFORE the advent of powerful Quantum Computers due to a Right Triangle-based CONSTANT time mathematical solution. […] We were able to both immediately and successfully factor 1,000 Public Key values of various lengths/sizes.
|||Robert Edward Grant (CEO, Crown Sterling)<ref name="pythagorean_factorization"/>}}

The excerpt highlights three claims:

# Grant fraudulently claimed his novel method of semiprime factorization could break not just RSA, but also ECC. However, as was shown {{sl|The RSA cracking circus|above}}, elliptic curve cryptography is not based on the RSA problem. No example of breaking any size ECC key was given, most likely due to Grant having again cut himself with Hitchen's razor.
# Grant also claimed he was able to factor keys of "''various lengths/sizes''",<ref name="pythagorean_factorization"/> but he was somehow unable to specify the relevant part, the size of the keys. Factoring 1000 minuscule keys is of no significance. Factoring an unfactored large key from the pool of {{wpl|RSA_numbers|RSA factoring challenges|,}} would be. On April 8, 2022, Grant claimed on Telegram they had been able to factor public keys with '''|p−q|>10¹³⁰⁰''', which is what an 8700-bit RSA key would have.<ref name='modulus'/>
# Last, but certainly not least, Grant made the fraudulent claim the algorithm runs in '''𝒪 (1)''', or constant time, which is nothing short of impressive, given that not even {{wpl|Shor%27s_algorithm|Shor's [quantum] algorithm|,}} the bane of RSA, runs in less than '''𝒪 (72(log N)²)'''.<ref>Shor, Peter (Nov. 4, 2013). [https://cs.stackexchange.com/a/16700 "Shor's Algorithm speed"]. Via Computer Science Stack Exchange.</ref> A constant time algorithm solves a problem regardless of its size, in the exact same number of steps. Thus, Grant claimed to be able to factor any size semiprime, i.e., break any size RSA key, in the same number of steps.

'''The implementation'''

In his article Grant reveals that he used what he called the "''Pythagorean Calculator''",<ref name="pythagorean_factorization"/> implemented in Microsoft Excel of all things.<ref name='excel_calculator'>Grant, Robert (December 2020). [https://imgur.com/a/puZw8oj "Pythagorean Factorization - Largest semiprime factored to record" (screenshot)]. Via imgur.com</ref> Always a solid sign when someone who claims to speak eight languages,<ref>Grant, Robert (July 22, 2019). [https://archive.ph/7KKWh "It's Time to Fight Back for Data Sovereignty with TIME AI"]. Archived from [https://robertedwardgrant.com/its-time-to-fight-back-for-data-sovereignty-with-time-ai/ robertedwardgrant.com] on Jan. 22, 2024.</ref> struggles with learning a single programming language, a core tool for anyone implementing algorithms they design.

Grant left his reader base on the sidelines by not publishing the Excel document, but he did publish a ridiculous illustration with no beginning or end, presumably drawn with Microsoft Paint.<ref name=pythagorean_factorization_mspaint_implementation>Grant, Robert (Dec. 24, 2020). [https://archive.ph/nN5Ai "Pythagorean Factorization" (illustration)]. Archived from [https://robertedwardgrant.com/wp-content/uploads/2021/09/97aa04_7a855ea51c6b4d8ea6e2cb09c2e3cb88_mv2.jpeg robertedwardgrant.com] on Jan. 11, 2024.</ref> Even so, the image conveys enough information to fully implement Grant's trivial algorithm. Below is one implementation, written in just fourteen source lines of Python:

<syntaxhighlight lang="python">
import math

def pythagorean_factorization(semiprime: int):
    B = math.sqrt(semiprime)
    r = math.ceil(B) - B

    x = 0
    while True:

        # Solve leg A with the formula in Grant's image
        A = math.sqrt((x+r) * (2*B+(x+r)))

        # Note: Grant's 'ready-to-use' formula is
        # missing the square root used above, but it
        # is present in the bottom right of the image, 
        # where A=24 is obtained with sqrt(576).

        # Solve the hypotenuse with the Pythagorean theorem
        C = round(math.sqrt(A**2 + B**2))

        # Prime factor candidates
        p = round(C - A)
        q = round(C + A)

        if p * q == semiprime:
            print(f"The factors of {semiprime=}" \
                  f" are {p=} and {q=}." \
                  f" Factoring required {x+1} steps.")
            return

        x += 1

pythagorean_factorization(12193)

</syntaxhighlight>

''' The results '''

[[File:Pythagorean Factorization steps as function of key size.png|thumb|right|Pythagorean Factorization steps as the function of key size. The graph shows how the number of steps needed to factor a key explodes at around the 50-bit key mark. The data point that is the 16-bit key in Grant's MS Paint implementation<ref name="pythagorean_factorization_mspaint_implementation"/> has been added on the graph (in red), to show just how deceivingly small and meaningless numbers his crank algorithms are demonstrated with. The values can be verified from the implementation.<ref group='program'>[https://www.online-python.com/usqCmU2aBl "Pythagorean Factorization: Number of required steps, as a function of RSA-key size"]. Via [https://www.online-python.com/ Online Python].</ref>]]

Running the implementation reveals that factoring '''12193''', the 16-bit example semiprime Grant used in his weird Microsoft Paint implementation of the algorithm, requires '''3''' steps, that is, iterations of the while-loop. A cursory experiment of a slightly smaller semiprime '''11379''' shows it requires '''1,792''' steps.<ref group='program'>[https://www.online-python.com/hpskBzIae5 "A Python implementation of Grant's Pythagorean Factorization algorithm"]. Via [https://www.online-python.com/ Online Python].</ref> Having the factoring of a smaller semiprime take '''597''' times more steps, reveals Grant's algorithm runs in anything but '''𝒪 (1)''', i.e., constant time.

Grant knows the number of steps varies, but as is typical with grifters, he has hidden this fine print in one of the images of the announcement,<ref>Grant, Robert (Dec. 24, 2020). [https://archive.ph/coIGx "Pythagorean Factorization" (fine print hidden in notes: "Note: if not a perfect square, then proceed (to iterate) x=1,2,3,4,5,6... ")]. Archived from [https://robertedwardgrant.com/wp-content/uploads/2021/09/97aa04_d21d9a263d1b4fbe839ad859f757fc56_mv2.jpeg robertedwardgrant.com] on Jan. 11, 2024.</ref> where the notation "'''x=1,2,3,4,5,6,...'''" reveals he expects '''x''' to get iterated (as it does in the implementation above), but Grant fails to acknowledge doing so completely voids the constant time claim.

'''More plagiarism'''

Closer inspection reveals Grant's algorithm is just a slightly obfuscated version of the 380-year-old {{wpl|Fermat%27s_factorization_method|Fermat's factorization method|.}}<ref>[https://pastebin.com/FNqizpC7 "Step-by-step proof to show Pythagorean Factorization is just Fermat's Factorization algorithm"]. Via [https://pastebin.com Pastebin].</ref> This is also confirmed by the number of steps the algorithm takes. When compared with properly generated keys, the two algorithms take '''identical''' number of steps, regardless of key size.<ref group='program'>[https://www.online-python.com/4PUx05m9JR "Comparison of Fermat's factorization method and the Pythagorean Factorization Algorithm"]. Via [https://www.online-python.com/ Online Python].</ref> The only difference was, instead of brute-forcing the hypotenuse of the right triangle, Grant decided to move things around, and brute force the leg A instead.

On September 25, 2021, nine months after the Pythagorean Factorization Algorithm was uploaded, Grant et al. uploaded an article titled "''The Sum Product Conjecture''"<ref name='sum_product_conjecture'>Grant et al. (Oct. 9, 2021). [https://archive.ph/2vnbW/image "The Sum Product Conjecture"]. Archived from [https://robertedwardgrant.com/wp-content/uploads/2021/10/The_Sum_Product_Conjecture.pdf https://robertedwardgrant.com] on Jan. 16, 2024.</ref> where they "''re-derive Fermat’s factorization identity{{sic}}<ref group=note>Algorithms that have iterative logic (including Fermat's method) are not identities. {{wpl|Identity_(mathematics)|Identities}} are mathematical equalities, like '''a + 0 = a'''.</ref> through a geometrical approach.''", and "''exploit its Pythagorean triangle configuration to investigate the relationship between the sum of two numbers and their product.''" Apparently taking credit for the work of one of the greatest mathematicians in human history<ref>Oduenyi, Valentine (2017). [https://www.sapaviva.com/the-50-greatest-mathematicians/ "The 50 Greatest Mathematicians"] Via sapaviva.com.</ref> was too much for even someone like Grant. This however, did not prompt Grant to issue corrections in the original upload,<ref name='pythagorean_factorization'/> where he would give credit to Fermat, and where he would retract the absurd and obviously false claims about the time complexity.

'''The 𝒪 (1) lie'''

Fermat's factorization method time complexity is governed by the distance of the two primes, and its time complexity is <math>\mathcal{O}\bigl( \frac{|p-q|^2}{4\sqrt{n}} \bigr)</math>.<ref name='erra2009'>{{cite journal |last1=Erra |first1=Robert |last2=Grenier |first2=Christopher |date=June 30, 2009 |title=The Fermat factorization method revisited |url=https://eprint.iacr.org/2009/318.pdf |journal=IACR Cryptol. ePrint Arch. |volume=2009 |pages=318}}</ref>

With [[random]] primes, i.e. in the normal case, the method runs in '''𝒪 ( √(n) )''' time.<ref name='fermat_big_o'>{{cite journal |last1=Zaki |first1=Alaa M.|last2=Bakr|first2=M.E.|last3=Alsahangiti|first3=Arwa M.|last4=Khosa|first4=Saima Khan |last5=Fathy|first5=Khaled A. |date=March 1, 2023 |title=Acceleration of Wheel Factoring Techniques |url=https://www.mdpi.com/2227-7390/11/5/1203 |journal=Mathematics |volume=11 |issue=5 |doi=10.3390/math11051203 |access-date=Jan. 22, 2024}}</ref>

The 2023 paper by Shatnawi et al.<ref>{{cite journal |last1=Shatnawi |first1=Ahmed |last2=Almazari |first2=Mahmoud |date=2023 |title=RSA cryptanalysis — Fermat factorization exact bound and the role of integer sequences in factorization problem |url=https://www.sciencedirect.com/science/article/abs/pii/S2214212623001989?via%3Dihub |journal=Journal of Information Security and Applications |volume=78 |issue=2214-2126 |pages=103614 |doi=10.1016/j.jisa.2023.103614|access-date=2024-01-13}}</ref> states on page 7 that "''N can be factorized in '''𝒪 (1)''' if the [prime factor] difference is small''". On page 9 the exact formula for the constant time bound is given:

"''N can be factorized in '''𝒪 (1)''' when '''p³ − 2p²(q+1) + p(q²+1) ≤ 2N'''  where '''p>q'''."

Thus, Grant's claim for '''𝒪 (1)''' time complexity without constraints, is a lie. '''𝒪''' is used to denote the upper bound, i.e., the worst-case scenario.<ref name='time_complexity_markings'>von Brand, Horst H. (Aug. 27, 2020). [https://cs.stackexchange.com/a/129610 "What is the difference between Big O, Omega, and Theta?"] Via Computer Science Stack Exchange.</ref>  Since Fermat's factorization method Grant was rehashing runs in constant time only in the best case, i.e. when '''|p-q|''' is within the constant time bound, the correct marking for that constant time lower bound with random keys, is '''Ω (1)''', not '''𝒪 (1)'''.<ref name='time_complexity_markings'/>

In layman's terms, the distinction between these two is not exactly a nuance. In the context of the Powerball lottery, the '''Ω (1)''' means in the best case, one could win the [[lottery]], whereas '''𝒪 (1)''' means one is going to win it every time after a small fixed number of tries, no matter what.

'''A rigged challenge'''

Because of the absurdly efficient best-case scenario of Fermat's algorithm, Grant was able to rig his semiprime factoring demonstrations. By choosing semiprimes with the prime factors close enough to one another, any size semiprime, even ones that match the size of modern RSA key sizes, seems to factor in constant time. This rigging can not be detected just by observing the semiprime. It can only be done after the factoring has been done, by seeing if '''|p-q|''' is within the constant time bound presented above. The illustration serves as another layer to hide this. A step-by-step analysis<ref group='illustration'>[https://imgur.com/a/QcR3uhK "Pythagorean Factorization crank algorithm refutal"]. Via imgur.com.</ref> of the MS Paint implementation, shows how the work has been done beforehand, as the illustration has the value of '''x''' pre-baked into the image. Similarly, Grant presented his Excel calculator (on a now-deleted video) with small enough numbers his computer could fill the Excel document cells faster than the human eye can see, which then allowed Grant to imply all values of '''x''' are calculated at the same time, and not cell-by-cell.

It however turns out, that with real RSA, there are no rigged challenges, and there is no '''Ω (1)''' case.

'''The attack that never existed'''

On page 9 of the original RSA paper (1978), the authors Rivest, Shamir, and Adleman state:

{{cquote|To gain additional protection against sophisticated factoring algorithms, '''p''' and '''q''' should differ in length by a few digits[…]
|||Rivest, Shamir, Adleman (1978)<ref name="rsa">{{cite journal
 | last1 = Rivest | first1 = R.
 | last2 = Shamir | first2 = A.
 | last3 = Adleman | first3 = L.
 | s2cid = 2873616
 | url = http://people.csail.mit.edu/rivest/Rsapaper.pdf
 | title = A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
 | journal = [[Communications of the ACM]]
 | volume = 21 | issue = 2 | pages = 120–126 | date = February 1978
 | doi = 10.1145/359340.359342| citeseerx = 10.1.1.607.2677
 | archive-url = https://web.archive.org/web/20230127011251/http://people.csail.mit.edu/rivest/Rsapaper.pdf
 | archive-date = 2023-01-27
 | url-status = dead
 }}</ref>
}}

'''The dangers of the prime-factors '''p''' and '''q''' being close to one another was thus known by the RSA authors before RSA was published, and the attack never existed for properly implemented systems.'''

The required checks for prime distance are usually expressed as <math>|p-q|>2^{nBits/2-100}</math>, and are present in both the modern implementation requirements,<ref name="nist_rsa_key_requirements"/> and modern cryptographic libraries.<ref>OpenSSL Project Authors (1999—). [https://github.com/openssl/openssl/blob/254957f768a61c91c14d89566224173d0831c2ce/crypto/rsa/rsa_sp800_56b_check.c#L239 "OpenSSL implementation of NIST SP800-56Br1 6.4.1.2.1 requirement for checking the safe distance of prime factors].</ref><ref> Legion of the Bouncy Castle Inc (2000—). [https://github.com/bcgit/bc-java/blob/1cae5431b0f315e1c7dc40392bcd60cf785831b4/core/src/main/java/org/bouncycastle/crypto/generators/RSAKeyPairGenerator.java#L60 BouncyCastle implementation of NIST SP800-56Br1 6.4.1.2.1 requirement for checking the safe distance of prime factors].</ref>

This hasn't prevented inexperienced programmers from implementing their own naive, and thus vulnerable, RSA key generation programs. Fermat's algorithm has been used as recently as 2022, to break certificates of Canon and Fujifilm printers, as well as four random PGP keys.<ref>Goodin, Dan (March 14, 2022). [https://archive.ph/HS1zj "Researcher uses 379-year-old algorithm to crack crypto keys found in the wild"]. Archived from [https://arstechnica.com/information-technology/2022/03/researcher-uses-600-year-old-algorithm-to-crack-crypto-keys-found-in-the-wild/2/ Ars Technica] on March 22, 2022.</ref>

But broken novice implementations do not mean RSA is broken. They only mean Grant either never even bothered to read the then-41-year-old paper, or he read it and decided to append his grift lore with another lie.

'''Summary'''

A bit over a year after constructing his soapbox to replace his CADO-NFS supercar, Grant spent his Christmas Eve 2020, riding a {{wpl|Berlin (carriage)|Berlin carriage}} he stole from the Musée Fermat.

With fraudulent claims to be able to
* Break ECC, yet never back up that claim with anything,
* Factor 8700-bit RSA keys, yet only factoring a 46-bit RSA key, that was rigged with small prime factor distance, and
* Factor any semiprime in '''𝒪 (1)''', or constant time, yet to have the algorithm turn out to be Fermat's factorizing algorithm with a fresh coat of paint, and that runs in useless '''𝒪 ( √(n) )''' time, as the '''Ω (1)''' best-case Grant boasted about, was identified and mitigated by the authors of RSA back in 1978, before RSA was published,

Grant rode around until he noticed the license plate wasn't his, and then proceeded to tell all about it in his article "Horse Carriage Conjecture", where he investigated the relation of the cart wheel's diameter and circumference, and re-derived Pi.

=== Geometric factoring ===
'''It's simple, we draw the primes'''

[[File:Geofac telegram.png|thumb|right|x400px|Grant's original "publication" of geometric factorization on Telegram on April 7, 2022]]

As his fourth RSA cracking napkin math example, Grant shared his crank geometric factorization equation on Telegram, on April 7, 2022. The crank equation wasn't even an algorithm, but a geometric equation, and Grant's proof was anything but proper {{wpl|algebraic geometry||.}} It was a class example of "proof"-by-scruffy-picture. It implied any large RSA public key or semiprime could be factored simply by creating an image where the hypothenuse of a right-angle triangle would cross some points.

'''Scaling issues'''

A common theme with Grant's grifts is, that the presented methods appear to work, but only do so with tiny semiprimes. This equation is no exception.

The immediate problem with this equation is trying to draw the picture with integer-level precision. That level of precision is the minimum requirement when trying to find a prime, as all primes are integers. With 0.0625-inch technical drawing paper and one integer every 0.0625 inches, fitting a 1536-bit prime of an RSA-3072 key, would require a paper width of '''4.3⋅10⁴⁴³''' {{wpl|Light-year|light-years|.}}
<ref group='equation'>[https://www.wolframalpha.com/input?i=%282%5E1536+*+0.0625%29+inches+in+light+years "0.0625-inch technical paper's side length, in light-years"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> Unfortunately the observable universe is just '''9.4⋅10¹⁰''' light-years across.<ref>National Aeronautics and Space Administration (NASA) (March 2018). [https://imagine.gsfc.nasa.gov/educators/programs/cosmictimes/educators/guide/age_size.html "Age & Size of the Universe Through the Years"]. Via nasa.gov.</ref>

Computers are no different. Storing geometric surfaces with '''(2¹⁵³⁶)² = 10⁹²⁴''' pixels, runs as with all Grant's algorithms, into the issue of the observable universe running out of subatomic particles to use as memory. There are, again, only '''3.28 ⋅ 10⁸⁰''' of them.<ref name="total_subatomic_particles"/>

'''The inequation'''

The major issue with Grant's Geometric Factorization doodle is, that his claim about the intersections of the hypothenuse of the right triangle is a straight-up lie, obfuscated by the lack of resolution and by the large green markings covering the area. The refutal<ref name ='geometric_factorization_refutal' group='illustration'>[https://imgur.com/a/mz3adIg "Geometrical Factorization crank equation refutal"]. Via imgur.com.</ref> of this crank equation shows this in practice, by re-creating the image with exact values in {{wpl|GeoGebra||,}} and by showing that even with the claimed correct answers for '''p''' and '''q''', and with zoom to mere tenths or less, there is no intersection and thus, the equation does not hold.

[[File:14 zoomed sections v2.png|thumb|center|The step-by-step refutal<ref name='geometric_factorization_refutal' group='illustration'/> of the Geometrical Factorization crank equation shows, that simple zooming reveals there are no intersections between the hypothenuse (blue line) and relevant intersections A, B, and C (in pink).]]

=== Conclusion ===
To summarize, here are the RSA factoring algorithms relevant to Crown Sterling's case, arranged by their true time complexity, from best to worst.

{| class="wikitable" 
|-
! Crown Sterling name
! Real name
! Real author
! Claimed time complexity (or efficiency claims)
! True time complexity
! Largest RSA key broken
! Notes
|-
| n/a (Listed for comparison)
| Shor's algorithm (1994)
| Peter Shor<ref>{{Cite book|last=Shor|first=Peter W.|title=Proceedings 35th Annual Symposium on Foundations of Computer Science |chapter=Algorithms for quantum computation: Discrete logarithms and factoring|pages=124–134|publisher=IEEE Comput. Soc. Press|doi=10.1109/sfcs.1994.365700|isbn=0818665807|year=1994|s2cid=15291489}}</ref><ref name="siam">{{Cite journal |last=Shor |first=Peter W. |date=October 1997 |title=Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer |journal=SIAM Journal on Computing |volume=26 |issue=5 |pages=1484–1509 |arxiv=quant-ph/9508027 |doi=10.1137/S0097539795293172 |issn=0097-5397 |s2cid=2337707}}</ref>
| n/a
|style="background: #48bc10;"|'''𝒪 (72(log N)²r)'''<ref>Shor, Peter (Nov. 4, 2013). [https://cs.stackexchange.com/a/16700 "Shor's Algorithm speed"]. Via Computer Science Stack Exchange.</ref>
| 5 bits<ref>{{cite journal |last=Martín-López |first=Enrique  |author2=Enrique Martín-López  |author3=Anthony Laing  |author4=Thomas Lawson  |author5=Roberto Alvarez  |author6=Xiao-Qi Zhou  |author7=Jeremy L. O'Brien |title=Experimental realization of Shor's quantum factoring algorithm using qubit recycling |journal=Nature Photonics |volume=6  |issue=11  |pages=773–776  |date=12 October 2012 |doi=10.1038/nphoton.2012.259 |arxiv = 1111.4147  |bibcode = 2012NaPho...6..773M |s2cid=46546101 }}</ref>
| Requires a sufficiently large {{wpl|Quantum_computing|quantum computer}}
|-
| CS BiPrime algorithm (2019)
| General Number Field Sieve (GNFS) (1993)
| Lenstra et al.<ref name='lenstra_1993'/>
| Implied RSA-15360 (with 256-bits of symmetric security) breaks in under one minute [[Crown_Sterling#Records_from_the_Soviet_age|[source]]]
|style="background: #e87005;"|<math>\mathcal{O}\biggl(\exp\left(\left((64/9)^{1/3}+o(1)\right)\left(\log n\right)^{1/3} \left(\log\log n\right)^{2/3}\right)\biggr)</math><ref>{{Cite news|last=Pomerance|first=Carl|date=December 1996|title=A Tale of Two Sieves|periodical=Notices of the AMS|volume=43|issue=12|pages=1473–1485|url=https://www.ams.org/notices/199612/pomerance.pdf}}</ref>
| 829 bits<ref>Zimmermann, Paul (Feb. 28, 2020). [https://sympa.inria.fr/sympa/arc/cado-nfs/2020-02/msg00001.html "Factorization of RSA-250"] Via Cado-nfs-discuss Mailing List.</ref>
| Plagiarized
|-
| Pythagorean Factorization (2020)
| Fermat's factorization method (1643)
| Pierre de Fermat<ref>Pierre de Fermat (1643). [https://archive.org/details/oeuvresdefermat02ferm/page/n7/mode/2up Oeuvres de Fermat, vol. 2, p. 256].</ref><br/>
| '''𝒪 (1)''' [[Crown_Sterling#Pythagorean_factoring|[source]]]
|style="background: #dc5353;"|'''𝒪 ( √(n) )'''<ref name='fermat_big_o'/>
| 16 bits<ref group=note>Fermat's method doesn't have public records against valid RSA challenges because of their obviously too high '''|p-q|'''. Grant's standing factoring record for Fermat's method is from a now-deleted Instagram video (Screenshot: https://imgur.com/a/puZw8oj), where he factored '''53019184700161 = 7274171 ⋅ 7288691''', where '''|p-q|=14520'''. Fermat's method solved it in four iterations. With random (i.e. non-rigged) primes, this is the equivalent of breaking a 16-bit RSA key with an '''𝒪 ( √(n) )''' algorithm, as '''√(16)''' <nowiki>=</nowiki> '''4''' This evaluation method may seem strange, but it detects false claims of factoring large keys with small prime factor distance.

</ref><ref name='excel_calculator'/>
| Plagiarized
|-
| Reciprocal Factorization (2019)
| Random trial division
| Robert E. Grant
| '''𝒪 (1/n)''' [[Crown_Sterling#Reciprocal_factoring|[source]]]
|style="background: #dc5353;"|'''𝒪 ( √(n) )'''<ref name="stack_exchange_reciprocal_factoring"/>
| 32 bits [[Crown_Sterling#Reciprocal_factoring|[source]]]
| The factoring equivalent of "shuffle deck of cards until it's sorted"
|-
| Infinite Prime Prediction (2019)<br/>
| Multiplication-table reverse-lookup
| Robert E. Grant
| "Unprecedented efficiency"[[Crown_Sterling#The_quasi-prime_paper|[source]]]<br>"The results were excellent"<ref name='quasiprimes'/>
|style="background: #ce2121;"|'''𝒪 (n²)''' [[Crown_Sterling#Time_and_space_complexity_of_the_factoring_method|[source]]]
| 0 bits
| '''𝒪 (n²)''' space complexity
|-
| Geometric Factorization (2022)
| n/a
| Robert E. Grant
| Implied '''𝒪 (1)''': Just complete the equation [[Crown_Sterling#Geometric_factoring|[source]]]
|style="background: #909090;"|'''⊥''' [[Crown_Sterling#Geometric_factoring|[source]]]
| n/a
| The method does not work
|}

* The '''CS BiPrime Algorithm''' was the best algorithm ever demonstrated by the Crown Sterling team. However, both the algorithm (GNFS) and its implementation (CADO-NFS) were plagiarized. GNFS is not able to factor even RSA-1024, let alone modern RSA-3072.
* The '''Pythagorean Factoring''' algorithm was also plagiarized and grossly misrepresented. The authors claimed it runs in '''𝒪 (1)''', but in reality that happens only in the best case. The syntax for best case is '''Ω (1)''', not '''𝒪 (1)'''. Since the issue of small prime distance '''|p-q|''' has been addressed in all proper RSA implementations since its conception, the average case for the algorithm is '''𝒪 ( √(n) )''' which makes it useless. 
* The '''Reciprocal Factoring''' algorithm makes no intelligent effort to solve the problem. The reciprocal value '''1/N''' is effectively a poor man's random number generator, and stumbling upon the prime factors takes in the order of '''√(n)''' steps which sets the time complexity at useless '''𝒪 ( √(n) )'''. 
* The '''Infinite Prime Prediction''' pattern requires performing reverse lookups from a multiplication table the size of which is in the order of '''n²''', which sets both the time and the space complexity to horrible '''𝒪 (n²)'''. 
* The '''Geometric Factoring''' equation straight up doesn't work as the equation provably does not hold.

The Pythagorean and Reciprocal factoring methods presented appear to work because they were demonstrated with minuscule key sizes. Their shared time complexity of '''𝒪 ( √(n) )''' means the algorithms grind to a halt at 180-bit RSA,<ref group=note>'''√(2¹⁸⁰)''' <nowiki>=</nowiki>'''2⁹⁰''' which is roughly the computational power of major nation-states. The current magical limit of what is considered within the grasp of major nation-states, is somewhere between 80 and 100 bits. For those who want to dive more into this, [https://www.keylength.com/ keylength.com] is your friend.</ref> long before they can factor relevant size RSA-3072 keys.

The purpose of the napkin-math algorithms (Pythagorean, Reciprocal, and Geometric Factorization) is mostly to leech off admiration from Grant's numerologist fan base who unfortunately for themselves, lack the formal training in mathematics and computer science to be able to tell the napkin math is worthless.

Despite claims to crack 2048-bit RSA (with Reciprocal factoring), and 8192-bit RSA (with Pythagorean factorization), Grant and his team have not managed to solve even a single unsolved {{wpl|RSA_Factoring_Challenge|RSA factoring challenge|.}} These challenges exist exclusively to track the progress of attacks against RSA.

With all that being said,
* The refutals of the methods presented above,
* The endless factual errors and lies made by Grant, 
* The claims of having supposedly solved the RSA problem multiple times, yet still forgetting about it a week later, instead of hosting another press conference,
* The need to plagiarize the work of others, 
* The incompetence in time complexity analysis,
* The inconsistency of coming up with algorithms that have factually worse time complexity than what they have already plagiarized,
* The inconsistency of coming up with algorithms that have worse time complexity than what they claim to already have,
* Peddling a method like Geometric Factorization that straight up doesn't work, and
* Not claiming the glory and global press coverage from winning the {{wpl|RSA_numbers#RSA-2048|RSA-2048 factoring challenge|,}}

all say Grant and his team have absolutely nothing of substance when it comes to breaking RSA.

To give some perspective on what real cryptanalysis of RSA looks like, Claus Schnorr's 2021 (failed) attempt<ref>Schnorr, Claus Peter (June 16, 2021). [https://eprint.iacr.org/2021/933.pdf "Fast Factoring Integers by SVP Algorithms, corrected (work in progress)"]. Via iacr.org.</ref> highlights the complexity of the math involved in efficient attacks.

== More plagiarism ==
[[File:Plagiarism.png|thumb|right|Textual comparison between Crown Sterling's article and ZDNET's original article shows the article was plagiarized word-for-word.]]

To seem more legitimate as a cybersecurity company, Crown Sterling pushed out topical articles. On March 23, 2020, Crown Sterling's newsroom published an unauthored article titled "''Cybersecurity: Under Half of Organizations are Fully Prepared to deal with Cyberattacks''".<ref>Crown Sterling (March 23, 2020). [https://web.archive.org/web/20211125210745/https://www.crownsterling.io/cybersecurity-under-half-of-organizations-are-fully-prepared-to-deal-with-cyberattacks/ "Cybersecurity: Under Half of Organizations are Fully Prepared to deal with Cyberattacks"]. Archived from [https://www.crownsterling.io/cybersecurity-under-half-of-organizations-are-fully-prepared-to-deal-with-cyberattacks/ crownsterling.io] on Nov. 25, 2021.</ref> This article was plagiarized word-for-word from ZDNET's article under the same title, written by Danny Palmer.<ref>Palmer, Danny (Nov. 4, 2019). [https://archive.ph/y2kd2 "Cybersecurity: Under half of organisations are fully prepared to deal with cyberattacks"]. Archived from [https://www.zdnet.com/article/cybersecurity-under-half-of-organisations-believe-theyre-fully-prepared-to-deal-with-cyber-attacks/ zdnet.com] on Jan. 27, 2024.</ref> The only changes were the Americanization of the word "organisation" to  "organization", and changing the apostrophe styling. The article has since been removed by Crown Sterling.

== Snake oil cryptography ==
After lying about all public key encryption being based on the RSA problem, and lying about RSA being weak, Crown Sterling was ready to release its own algorithms. To the surprise of absolutely no one, the algorithms were as full of lies and deceit as their earlier claims, and as broken as one would expect from numerologists, who try to solve post-doctoral-level research problems in a sophisticated branch of applied mathematics, with middle-school-level math.

In September 2021, Crown Sterling released its Lite Paper. <ref name='litepaper2021'>[https://web.archive.org/web/20210926235637/https://www.crownsterling.io/wp-content/uploads/2021/09/Crown-Sterling-Lite-Paper-.pdf "THE CROWN SOVEREIGN - Lite Paper (2021)"]. Archived from [https://www.crownsterling.io/wp-content/uploads/2021/09/Crown-Sterling-Lite-Paper-.pdf crownsterling.io] on Sept. 26, 2021.</ref> Later, the same year, the company released a more detailed, full White Paper titled "''Crown Sterling - Cryptographic Security Protocol''".<ref name='whitepaper2021'>Crown Sterling (2021). [https://web.archive.org/web/20211219150631/https://f.hubspotusercontent10.net/hubfs/9477568/Crown%20Sterling%20White%20Paper%202021.pdf "CROWN STERLING - CRYPTOGRAPHIC SECURITY PROTOCOL"] Archived from [https://f.hubspotusercontent10.net/hubfs/9477568/Crown%20Sterling%20White%20Paper%202021.pdf hubspotusercontent10.net] CDN on Dec. 19, 2021.</ref>

In these documents, the authors described a broken cryptographic protocol built from broken cryptographic primitives.

=== Broken RNG ===
As {{wpl|Stream_cipher|stream cipher's|}} {{wpl|Key_(cryptography)|cryptographic keys}} and {{wpl|Cryptographic_nonce|nonces|}} all depend on cryptographic randomness, it's vital for any cryptosystem to use a proper {{wpl|Cryptographically_secure_pseudorandom_number_generator|cryptographically secure pseudorandom number generator (CSPRNG)|.}}

'''Oh, the irony'''

[[File:Vendor affirmed keygen.png|thumb|right|Using non-standard RNG shows up nicely in Crown Sterling's FIPS certificate.<ref>National Institute of Standards and Technology (NIST) (March 23, 2020). [https://csrc.nist.gov/Projects/cryptographic-module-validation-program/Certificate/3635 "Crown Sterling Cryptographic Module"] via nist.gov</ref> "''No assurance of the minimum strength of generated keys''" is quite telling.]]

In their White Paper, the authors reveal what they decided to use as CSPRNG:

{{cquote|The RBG general design is based on the cryptographically secure Blum-Blum-Shub (BBS) generator.|||Crown Sterling, Full White Paper (2021)<ref name="whitepaper2021"/>}}

{{wpl|Blum_Blum_Shub|Blum Blum Shub|}} is a CSPRNG from 1986. It is rarely used because it's computationally heavy and slow.<ref>Omorog, Challiz D. and Gerardo, Bobby D. and Medina, Ruji P. (2018). [https://ieeexplore.ieee.org/document/8405483 "Enhanced pseudorandom number generator based on Blum-Blum-Shub and elliptic curves"]. 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE). Via ieee.org.</ref>

Its authors have proven its security reduces to factoring of large semiprimes<ref>{{cite journal | last1=Blum | first1=L. | last2=Blum | first2=M. | last3=Shub | first3=M. | title=A Simple Unpredictable Pseudo-Random Number Generator | journal=SIAM Journal on Computing | publisher=Society for Industrial & Applied Mathematics (SIAM) | volume=15 | issue=2 | year=1986 | issn=0097-5397 | doi=10.1137/0215025 | pages=364–383|url=https://shub.ccny.cuny.edu/articles/1986-A_simple_unpredictable_pseudo-random_number_generator.pdf |archive-url=https://web.archive.org/web/20210814002628/https://shub.ccny.cuny.edu/articles/1986-A_simple_unpredictable_pseudo-random_number_generator.pdf |archive-date=2021-08-14 |url-status=live}}</ref> which is exactly the type of cryptography Grant has been trying to get rid of since his Matthew Belair interview in summer 2018, where Grant said:

{{cquote|[…] And none of it is gonna be Prime-determined, either. Because we know that's inherently now weakened because you can predict primes into infinity now.|||Robert Edward Grant (CEO, Crown Sterling)<ref name="belair_interview_2018"/>}}

'''Questionable choice'''

In his tweet cryptographer Markku-Juhani O. Saarinen explains why the selection of Blum-Blum-Shub was highly questionable:

{{cquote|However: the only reason to use public-key ("trapdoor one-way") components like Rabin's, BBS, or Dual_EC  in hashing  & keystream generation or entropy conditioning & DRBG is to have backdoors! AES, SHA3 modes ftw [<nowiki>=</nowiki>are the way to go] 😅|||Markku-Juhani O. Saarinen<ref>Saarinen, Markku-Juhani O. (Jan. 1, 2022). ["However: the only reason to use public-key ("trapdoor one-way") components like Rabin's, BBS, or Dual_EC  in hashing  & keystream generation or entropy conditioning & DRBG is to have backdoors! AES, SHA3 modes ftw [=are the way to go]" https://archive.ph/Et3z4]. Archived from [https://twitter.com/mjos_crypto/status/1477231553361162241 Twitter] on Feb. 5, 2024.</ref>}}

A point that needs repeating. Professional cryptographers think the only reason to select Blum-Blum-Shub as the DRBG, i.e. the random number generator, is to have a '''backdoor'''.

'''Userland seeds'''

On page 4 of the White Paper, the authors explain how the BBS RNG is seeded:

{{cquote|The [CrownRNG] Daemon gathers entropy from many random system processes, including the pc metrics, such as the Heap, Memory, and stack, along with mouse movements and clicks, keyboard strokes, etc.|||Crown Sterling, Full White Paper (2021)<ref name="whitepaper2021"/>}}

As Scott Arciszewski explained to the Monero project in October 2016, userland PRNGs are considered antipattern.<ref>Arciszewski, Scott (Oct. 29, 2016). [https://github.com/monero-project/monero/issues/1271 "Don't use Insecure Userland PRNG for random_scalar()"]. Via github.com</ref> This includes things like keystrokes that can in cases like the {{wpl|X_Window_System|X window system|,}} leak<ref>Rutkowska, Joanna (Apr. 23, 2011). [https://blog.invisiblethings.org/2011/04/23/linux-security-circus-on-gui-isolation.html "The Linux Security Circus: On GUI isolation"]. Via blog.invisiblethings.org</ref> a major part of the RNG's seeding entropy to any malicious program running on the system.

The {{wpl|Protection_ring|protection ring}} model shows Kernel is the most privileged part of the operating system and using less privileged CSPRNGs is an extremely vulnerable design; leaked internal state of an RNG breaks all cryptographic systems that rely on the RNG.

Judging by Talal Ghannam's Stack Exchange question,<ref>Ghannam, Talal (Dec 18, 2019). [https://web.archive.org/web/20240307194146/https://crypto.stackexchange.com/questions/76518/should-the-seed-of-csprng-produce-the-same-random-number "Should the seed of CSPRNG produce the same random number?"]. Archived from [https://crypto.stackexchange.com/questions/76518/should-the-seed-of-csprng-produce-the-same-random-number crypto.stachexchange.com] on March 7, 2024.</ref> the team apparently struggled even with understanding the concept of what a seed is, when he asked if a CSPRNG (which is a {{wpl|Deterministic_algorithm|deterministic algorithm)}} could be made more secure by having it function non-deterministically (impossible) with some seed. The company was thus definitely not in a place where it should be designing its own CSPRNG.


'''I wonder what this knob does'''

Despite Grant's earlier lies, the truth is, that semi-prime factoring remains a hard problem and thus, BBS remains a secure CSPRNG, if left as such. So naturally, to ensure maximum crankery, after Talal Ghannam had asked about the topic on December 12, 2019,<ref>Ghannam, Talal (Dec. 12, 2019). [https://web.archive.org/web/20231208104607/https://crypto.stackexchange.com/questions/76394/using-non-prime-numbers-in-blum-blum-shub-or-blum-micali "using non prime numbers in Blum Blum Shub or Blum Micali"]. Archived from [https://crypto.stackexchange.com/questions/76394/using-non-prime-numbers-in-blum-blum-shub-or-blum-micali crypto.stachexchange.com] on Dec. 8, 2023.</ref> and received no reply, Grant and his team, in their numerologist [[paranoia]], just went ahead and changed stuff:

{{cquote|In the original BBS, the mod is computed from the product of two prime numbers, whereas CrownRNG uses the truncated irrational numbers coming from the Functions Table.|||Crown Sterling, Full White Paper (2021)<ref name="whitepaper2021"/>}}

The team replaced the semi-prime factorization problem of BBS, with factoring decimal expansions from irrational numbers, which unlike the numerologists would like to believe, are not magical, but your average everyday composite numbers, and thus trivial to factor. E.g., WolframAlpha can factor the number 

 14159265358979323846
 26433832795028841971
 69399375105820974944
 59230781640628620899
 86280348253421170679

created from first 100 decimals of Pi in seconds.<ref>[https://www.wolframalpha.com/input?i=factor+1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 "Factor integer formed from first 100 decimals of Pi"]. Via [https://www.wolframalpha.com/ WolframAlpha]</ref>

Aaron Toponce, a security and system engineer, explained on Reddit exactly how this influences the RNG behavior:

{{cquote|By not using Sophie Germain safe primes, they are shortening the length of an already short cycle. The maximum cycle length of BBS, is '''λ(λ(pq))''', where '''λ''' is the {{wpl|Carmichael function||.}} This is only guaranteed given the conditions in the original paper. Any other '''p''' and '''q''', such as irrational numbers, will likely shorten the cycle length. 

Exempli gratia using Wikipedia, if '''p''' <nowiki>=</nowiki> '''11'''</code> and '''q''' <nowiki>=</nowiki> '''23''', then '''λ(λ(11 * 23))''' <nowiki>=</nowiki> '''20'''. But '''λ(λ(12 * 23))''' <nowiki>=</nowiki> '''10''', literally half the cycle length. This shit can't just be manipulated however you see fit. Math, how does it work?|||Aaron Toponce <ref>Toponce, Aaron (Oct. 19, 2024). [https://archive.ph/jfnVf "Remember Crown Sterling with their "TIME AI' cryptography nonsense at Blackhat? They now have a white paper (PDF)"]. Archived from [https://www.reddit.com/r/crypto/comments/qbdue7/comment/hh9048x/?utm_source=share&utm_medium=web2x&context=3 reddit.com] on Jan. 29, 2024.</ref>}}

An RNG that has a short period starts repeating itself much sooner. This means the attacker can store its complete output, try all subsections of it, and easily break everything that relies on the RNG's output, which might include password and key generation including cryptocurrency wallet private keys, nonces, initialization vectors, etc.

=== Quantum encryption ===
Since TIME AI, the company has been advertising quantum encryption:

{{cquote|[…] Using the infinite variations within music composed real-time by artificial intelligence, TIME AI generates '''quantum encryption keys''' as unique as your own iris.

Each '''quantum public key is paired with two quantum private keys''' that are entangled through mirror symmetry mathematics in value, time exposure, and oscillation speed. '''These quantum keys change at the nano-scale of time''', 
|||Crown Sterling (TIME AI trailer)<ref name="cryptoencabulator"/>}}

Quantum encryption isn't a thing outside {{wpl|Quantum key distribution|quantum key distribution (QKD)}}, and QKD isn't an app. It requires dedicated fiber optic cables as {{wpl|Quantum_channel|quantum channels|,}} installed in {{wpl|Network topology#Topologies|fully connected network}} topology. Anyone who's ever had to install the last mile of fiber to connect online can probably guess how much it would cost to install an all-the-way fiber between their house, and the house of every peer they have, and then throw on top of that the very, very expensive hardware<ref>QuantumCTek (2024). [http://www.quantum-comm.com/English/product/quantum/2017/0628/282.html "QKD-POL1250 - High-speed Quantum Key Distribution Terminal"]. Via quantum-comm.com.</ref> (one for each peer) that's capable of handing an actual QKD protocol such as {{wpl|BB84||,}} so one can talk to them.

However, it turns out QKD is only needed to make cryptography provably unbreakable. It isn't needed to make cryptography secure against quantum computers.

'''One-minute crash course'''

Cryptographic algorithms are built typically as {{wpl|hybrid cryptosystems||,}} where {{wpl|Symmetric-key algorithm|symmetric-key cryptography|}} is used to protect content in transfer, and {{wpl|public-key cryptography}} is only used to exchange the key for the symmetric cipher. The slow advances in quantum computing have implications for these two types of cryptography. 

Symmetric algorithms are affected by {{wpl|Grover's algorithm|Grover's (quantum) algorithm}} which has the efficiency of '''𝒪 ( √(n) )'''. This means it cuts key-strength of symmetric ciphers in half. This means 128-bit ciphers are reduced to too weak 64 bits, but 256-bit symmetric ciphers remain secure as their security is only reduced to 128 bits. This algorithm runtime is however only theoretical. In practice, the circuit depth is limited to roughly '''2⁴⁰''' logical gates, which means breaking 128-bit AES requires more than '''2¹²⁸''' operations.<ref>Valsorda, Filippo (July 6, 2022). [https://twitter.com/FiloSottile/status/1544680637638008833 "This MAXDEPTH is realistically around 2⁴⁰, which makes a quantum attack against a 128-bit cipher take more than 2¹²⁸ anyway. This is because ideal Grover requires an unrealistically long-running serial computation, and can't be parallelized well per https://arxiv.org/pdf/quant-ph/9711070.pdf"]. Via [[Twitter]].</ref>

Asymmetric, or, public-key cryptography is matched against {{wpl|Shor%27s algorithm|Shor's (quantum) algorithm|,}} that can break RSA, Diffie-Hellman, and its elliptic curve variant regardless of key size, as it runs polynomial in '''log N''' time, that is, in a reasonable time. Because of this, public key cryptography is in transit towards {{wpl|Post-quantum_cryptography|post-quantum algorithms|.}}

Grant and his team probably opened up the news and realized this at some point, as they decided to pivot from snake oil "quantum cryptography" to snake oil post-quantum cryptography.

=== The "post-quantum" key exchange ===
After much hype about their system being secure against quantum computers, Crown Sterling finally revealed their post-quantum suite in their White Paper on page 21:

{{cquote|CrownEncrypt implements the Diffie-Hellman public-key exchange protocol, […] Elliptic-curve Cryptography (ECC) is more secure than RSA and requires smaller encryption keys for the same level of security.|||Crown Sterling, Full White Paper (2021)<ref name="whitepaper2021"/>}}

So after all that hype, their strategy to beat quantum computers was to use elliptic-curve Diffie-Hellman (EC-DH) for key exchange. What makes this choice particularly stupid is, that not only is EC-DH vulnerable to Shor's algorithm, but breaking EC-DH requires a much smaller quantum computer than breaking RSA does, as the estimate table<ref>Gagliardoni, Tommaso (Aug. 24, 2021). [https://research.kudelskisecurity.com/2021/08/24/quantum-attack-resource-estimate-using-shors-algorithm-to-break-rsa-vs-dh-dsa-vs-ecc/ "Quantum Attack Resource Estimate: Using Shor’s Algorithm to Break RSA vs DH/DSA VS ECC"] Via kudelskisecurity.com.</ref> from Kudelski Security shows:

{| class="wikitable" 
|-
! Symmetric <br />security
! RSA bits<br />
! Qubits required<br />for Shor's alg.<br />against RSA<br />
! ECC bits
! Qubits required<br />for Shor's alg.<br />against ECC
|-
| 112
| 2048
| 4098
| 224
| 2042<br />
|-
| 128
| 3072
| 6146
| 256
| 2330
|-
| 192
| 8192
| 15362
| 384
| 3484
|}

'''And then it got even more stupid'''

When questioned about how EC-DH could be made post-quantum in Crown Sterling's Telegram channel, Naomi Mathew, a Crown Sterling research team member revealed their strategy:

{{cquote|We alter the elliptic curve encryption to eliminate the issues associated with the elliptic curve that [[Bitcoin]] uses. By using an irrational number as a private key in place of a prime number, (prime numbers are susceptible to decryption due to their patterned distribution) we are able to introduce a significant amount of [[entropy]] to the encryption.|||Naomi Mathew, Crown Sterling research team<ref>Ottela, Markus (Oct. 30, 2021). [https://archive.ph/s5gI0 "As per their "researcher", apparently there's a simple trick to generate post-quantum secure ECDHE private values: Just don't use prime numbers, and the entropy will take care of the rest. :-)"]. Archived from [https://twitter.com/markus_ottela/status/1454529189403635716 Twitter] on Jan. 29, 2024.</ref>}}

Mathew's response is phenomenal in all of its crankery.

'''Elliptic curve private keys are not prime numbers'''

As explained by Squeamish Ossifrage on Stack Overflow:

{{cquote|A NIST P-256 secret key (for ECDH or ECDSA) represents any scalar modulo '''ℓ''' for '''ℓ '''<nowiki>=</nowiki>''' 2²⁵⁶ − 2²²⁴ + 2¹⁹² − 89188191075325690597107910205041859247'''
|||Squeamish Ossifrage<ref>Squeamish Ossifrage (March 16, 2018). [https://crypto.stackexchange.com/a/56549 "Generating a NIST P-256 private key"]. Via Cryptography Stack Exchange.</ref>}}

Thus, elliptic curve private keys are not limited to only prime numbers. Any {{wpl|Scalar (mathematics)|scalar}} will do. This includes any primes that happen to also be elements of the field. If there was a check that ensured the scalar was not a prime, that would only make the number of possible keys smaller, which would only aid the attacker.

'''46-bit keys, if you're Google'''

As a numerologist, Grant has littered his Instagram wall with pictures of transcendental numbers such as Pi containing every possible value at some point of its decimal expansion.<ref>Grant, Robert (April 7, 2019). [https://imgur.com/a/dkjvxnA "Grant sharing numerologist Pi woo"]. Via imgur.com.</ref> Ignoring the philosophy and woo, it's true. But that also means that Grant knows the decimal expansion of Pi contains all 521-bit private keys NIST P-521 EC-DH would normally use, including ones that are primes, at some point. This is a contradiction to Grant's team claiming the keys generated from Pi's irrational decimal expansion are more secure than the normal keys. Thus, the logical conclusion is — any valid private key generated with cryptographic RNG is equally secure, and Grant and his team are full of shit. Furthermore, in practice, the irrational keys are much weaker, because of the massive computational overhead to generate the keyspace to pick a key randomly from.

A sequence from an irrational number such as Pi, is just a number produced with an insecure PRNG, with a known seed. The PRNG in this case is the most efficient algorithm for approximating Pi, the {{wpl|Chudnovsky algorithm||,}} and the seed values are the baked-in coefficients necessary to generate Pi.

The decimal expansion needs to be as secure as NIST-P521 EC-DH, and that requires there be at least as many keys as there would normally be. Since the key is not the value, but the random offset, this requires '''2⁵²¹''' offsets to choose from. (The length of the key requires additional '''⌈log₁₀ 2⁵²¹⌉  = 157''' digits in the offset space<ref group='equation'>[https://www.wolframalpha.com/input?i=ceil%28log10%282**521%29%29 "Length of key in decimal expansion"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> but it can be ignored as insignificant.)

Unfortunately for Crown Sterling, Pi has only been calculated to a precision of 100 trillion digits. This was done by Emma Haruka Iwao, a researcher at Google in 2022.<ref name='google_pi'>Emma Haruka Iwao (June 9, 2022). [https://cloud.google.com/blog/products/compute/calculating-100-trillion-digits-of-pi-on-google-cloud "Even more pi in the sky: Calculating 100 trillion digits of pi on Google Cloud"]. via Google Cloud Blog.</ref> This caps the number of offsets and thus the number of distinct keys to only 100 trillion unique values. A cryptographic key that has 100 trillion choices, has the strength of a '''log₂ 100,000,000,000,000 = 46.51''' bit key.<ref group='equation'>[https://www.wolframalpha.com/input?i=log2%28100+trillion%29 "Bit strength key space that matches of 100 trillion offset space"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

Given that the Chudnovsky algorithm runs in '''𝒪 (n (log n)³)''',<ref>Yee, Alexander (Oct. 25, 2023). [http://www.numberworld.org/y-cruncher/internals/formulas.html "Formulas and Algorithms"] Via numberworld.org</ref> generating a 521-bit key requires roughly '''2⁵²¹ ⋅ ln(2⁵²¹)³ = 2⁵⁴⁶ᐧ⁴⁸⁹''' operations,<ref group='equation'>[https://www.wolframalpha.com/input?i=log2%282**521*log%282**521%29**3%29 "Base2 Exponent for number of operations for Pi with 2^521 decimals."]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref> which is 47 million times more work than breaking the NIST P-521 EC-DH with brute force.<ref group='equation'>[https://www.wolframalpha.com/input?i=2**%28546.489-521%29 "How many times larger is generating 2^521 offsets from Pi, than trying all 2^521 offsets"]. Via [https://www.wolframalpha.com/ WolframAlpha].</ref>

The reason modern cryptography is so strong is because it's computationally easy to generate a large random key, and computationally hard to break that key. '''What Crown Sterling's scheme proposes, is that it's computationally harder to pick the 521-bit private key from '''2⁵²¹''' possible offsets than it is to break the key exchange by trying all 521-bit keys.'''

In practice, it means even Google's research team with Google's computing power (128 vCPUs, 864GB of RAM, 515TB of disk space, and just under 158 days of number crunching<ref name='google_pi'/>), struggles to generate a 46-bit key. 46-bit keys haven't been secure from state actors practically ever, and academics broke the '''1,024''' times stronger 56-bit {{wpl|Data_Encryption_Standard|DES}} cipher back in 1998 with the EFF's {{wpl|EFF_DES_cracker|Deep Crack}} machine. Thus, a state actor who puts in the same time to pre-compute the decimals as Google did, can cycle through them and try all 100 trillion offsets in a matter of hours. This is of course only the worst-case scenario, that is, if an entity such as Google would generate the key. An average end-user device couldn't generate but a fraction of the key space in a reasonable amount of time, which greatly reduces the time and space it takes for the attacker to generate the pre-computed table and cycle through it.

'''Shor go brrr'''

Last but certainly not least, Shor's algorithm solves the {{wpl|Hidden_subgroup_problem|hidden subgroup problem}} for finite abelian groups. It will find the private key just by looking at the public key. It doesn't care how random the private key is. Many EC-DH private keys are generated with {{wpl|Hardware_random_number_generator|hardware random number generators (HWRNGs)}} that are the only thing that yields non-algorithmic, truly random numbers, and nobody's thinking they're somehow able to make EC-DH safe from quantum adversaries.

=== Crown-OTP: a broken stream-cipher ===

For symmetric encryption, Crown Sterling claimed they had picked the {{wpl|One-time_pad|one-time pad (OTP)|.}}

'''Definition of OTP'''

A one-time pad (OTP) is a cipher with an extremely specific definition. In computerized OTP, 

# The plaintext and key are binary strings, and encryption is done by adding the two modulo 2, that is, by {{wpl|Exclusive_or|XORing}} the two together.
# The key must be generated with a {{wpl|Hardware_random_number_generator|hardware random number generator (HWRNG)|.}} Using any algorithm to expand the key by '''any''' amount, immediately changes the cipher from an OTP into a {{wpl|Stream_cipher|stream cipher|,}}
# The generated key must be at least as long as the message,
# The key must be used only once, as repeated use of the key {{wpl|Venona_project#Breakthrough|completely breaks the scheme|,}} and
# The key must be destroyed immediately after use to ensure forward secrecy.

When used exactly this way, OTP is {{wpl|Information-theoretic_security|information theoretically secure|,}} that is, decrypting a ciphertext without the key in a {{wpl|Ciphertext-only_attack|ciphertext-only attack (COA)}} is impossible.

'''Secure use of OTP'''

Secure usage of OTP in real life requires additional steps.

# Since OTP is an additive cipher, it's {{wpl|Malleability_(cryptography)|malleable|:}} any change in the ciphertext will result in a changing of the plaintext. If the attacker knows the plaintext content for any reason (perhaps the protocol adds predictable header values), they can change it to say whatever they want. To prevent this, OTP must be paired with unconditionally secure authentication, such as {{wpl|Message_authentication_code#One-time_MAC|one-time MAC|}} or Carter-Wegman MAC.<ref>Cederlöf, Jörgen (June 2005). [https://www.lysator.liu.se/~jc/mthesis/mthesis.pdf "Authentication in quantum key growing"] Linköping University. Via liu.se</ref>
# Since OTP is the only information-theoretically secure algorithm, using any other algorithm to exchange the key, makes it exactly as weak as the key exchange algorithm. This is why OTP was traditionally delivered either in person or via a dead drop spike<ref>Crypto Museum (Aug. 4, 2015). [https://www.cryptomuseum.com/covert/deaddrop/spike.htm "Dead drop spike"]. Via cryptomuseum.com</ref>, or as it is sometimes today, with the ridiculously expensive quantum-key-distribution (QKD) apparatus, as was discussed above.

'''Crown-OTP'''

In their White Paper, Crown Sterling reveals how their system for OTP was created.

{{cquote|The main reason why OTP cryptography is not in wide usage, even though it offers unbreakable encryption, is due to the difficulty arising from sharing the pad/key, which is as large as or larger than the message itself. '''Crown Sterling solved this problem by generating keys using the square root function where the problem of sharing the whole key is reduced to simply sharing the number that generates it instead''', the NPSN, which is much smaller than the whole message and can be securely and easily exchanged using the usual ECC-DH protocol.|||Crown Sterling, Full White Paper (2021)<ref name="whitepaper2021"/>}}

Crown Sterling's solution was to just ignore the exact requirement that forbids expanding the key. This automatically changed the cipher from OTP into a stream cipher.

Modern 256-bit stream ciphers, such as {{wpl|Salsa20#ChaCha_variant|ChaCha20}} and {{wpl|Advanced_Encryption_Standard|AES256}}-{{wpl|Block_cipher_mode_of_operation#Counter_(CTR)|CTR}}, are not information-theoretically secure, but they would have satisfied Grant's desire for post-quantum security if used with {{wpl|Pre-shared_key|pre-shared keys}}. But then Grant decided to remove post-quantum security by exchanging keys with Diffie-Hellman.

'''Square roots are not magic'''

The golden rule of cryptography is "Don't roll your own cryptography". Yet, in their numerologist hubris, Grant and his team went and did just that. As the excerpt above shows, in their Crown-OTP stream cipher, they chose to expand a shared secret into a keystream with '''square root''' of all things. For context, all stream ciphers require expanding the key into the keystream with a proper, cryptographically secure pseudo random generator (CSPRG).<ref>Khurana, Dakshita (Aug. 27, 2020). [https://courses.grainger.illinois.edu/cs498ac3/fa2020/Files/Lecture_2_Scribe.pdf "Pseudorandom Generators (PRGs), Stream Ciphers"]. Via courses.grainger.illinois.edu</ref>

Unlike the grifters who would like their marks to believe, a square root decimal expansion isn't some magical truly random number compressed into the radicand. Square root function is just that, a {{wpl|Function_(mathematics)|mathematical function|.}} It is an entirely deterministic (and thus trivially replicable) operation that creates the decimal expansion from an input value. The square root function can be expressed e.g. with the following implementation of Newton's method, written in Python:<ref>Runestone Academy (Jan. 20, 2022). [https://runestone.academy/ns/books/published/thinkcspy/MoreAboutIteration/NewtonsMethod.html "Newton’s Method"]. Via runestone.academy.</ref><ref group='program'>[https://www.online-python.com/EbCLpTMUrv "Implementation of Newton's method for square roots with arbitrary precision"]. Via [https://www.online-python.com/ Online Python].</ref>

<syntaxhighlight lang="python">
from decimal import Decimal, getcontext

def newton_sqrt(n: int, decimals: int) -> float:
    """Calculate square root using Newton's method.

    From https://runestone.academy/ns/books/published/thinkcspy/MoreAboutIteration/NewtonsMethod.html
    Modified for arbitrary precision.
    """
    getcontext().prec = decimals + 1
    half = Decimal(1/2)
    approx = half * n
    better = half * (approx + n / approx)
    while better != approx:
        approx = better
        better = half * (approx + n / approx)
    return approx

print(newton_sqrt(16, decimals=100))
print(newton_sqrt(2, decimals=100))
</syntaxhighlight>

[[File:Schmieg program.png|thumb|right|Output from Sophie Schmieg's lattice-based cryptanalysis program that broke Grant's square root cipher.]]

'''The cipher was broken immediately'''

The reason why only experts should be designing ciphers became clear, when on December 31, 2021 — just over three months after the Lite Paper came out — Sophie Schmieg, the leader of Google's Cryptography ISE team, wrote an application that used {{wpl|Lattice_reduction|lattice reduction}} to recover the seed from the square root's decimal expansion, regardless of its offset,<ref>Schmieg, Sophie (Dec. 31, 2021). [https://archive.ph/v6akk "I was a bit bored, so I decided to reconstruct an integer from the fractional part of its square root. You never know when you might need such an algorithm, after all."]. Archived from [https://twitter.com/SchmiegSophie/status/1477016397179879430 Twitter] on Feb. 11, 2024.</ref> effectively breaking this toy cipher.

All CSPRGs must have a property called unpredictability, which means it's computationally infeasible for an adversary to determine future output from the already given output.<ref>Boneh, Dan (Sept. 27, 2013). [https://youtu.be/ZSjTMSvp-eI?si=McbZzXeL248b4h0S&t=634 "Cryptography I - Stream ciphers and pseudo random generators"] Via [https://www.youtube.com/@VideosCoursera/videos VideosCoursera]</ref> Yet, by recovering the radicand, the obviously deterministic square root function could be used to generate the keystream to decrypt future ciphertexts.

Schmieg's findings about Crown-OTP were confirmed the next day by the cryptographer Markku-Juhani O. Saarinen.<ref>Saarinen, Markku-Juhani O. (Jan. 1, 2022). [https://archive.ph/nGK4r "...yes frac(sqrt(x)) is most definitely a bad one-way function if someone proposed it as such, and a slow one too."] Archived from [https://twitter.com/mjos_crypto/status/1477069488822575116 Twitter] on Feb 5. 2024.</ref>

Four months later, to avoid their followers from learning about the break, Crown Sterling created a low-profile Twitter account, [https://twitter.com/cs_mathresearch @cs_mathresearch], which they then used to inquire about the break.<ref>Crown Sterling Research Team (May 22, 2022). [https://archive.ph/fDLcc "Let's say you want to reconstruct an integer using only a segment of its square root mantissa, starting at an arbitrary index. How would this method be applied to do that?"]. Archived from [https://twitter.com/cs_mathresearch/status/1522701325162532864 Twitter] on Jan. 29, 2024.</ref> Crown Sterling never thanked Schmieg for saving their customers' ciphertext confidentiality from a complete break, nor did they report the vulnerability to the {{wpl|Common Vulnerabilities and Exposures|CVE program|.}}

Despite Schmieg's break, Grant still went ahead and applied for a patent for the ridiculous cipher.<ref>Grant, Robert (May 16, 2023). [https://patents.google.com/patent/US11652621B2/en " Use of irrational number sequences to secure state transition function in blockchain transactions"]. Via patents.google.com</ref>

'''Horrible PRG performance'''

[[File:KPA.png|thumb|Crown-OTP testing shows in

<br>• TEST1, that encrypting just 64kB (a tiny image or a short article post) takes as long as 33 seconds, making the system unusable in practice,
<br>• TEST2, that encrypting any message longer than 2048 characters is already slower than breaking the encryption, and
<br>• TEST3, that it's vulnerable to Known Plaintext Attacks (KPA). In layman's terms, if the attacker knows how the message begins, that alone allows decrypting the entire message in milliseconds, and it also allows performing an {{wpl|Digital_signature_forgery#Existential_forgery|existential forgery|,}} where the sum to transfer, and the target address are changed. 
<br><br>These results can be reproduced on a Ubuntu based Linux, by following the steps in the [https://pastebin.com/raw/UvQsKJb2 setup instructions].]]

On February 24, 2024, Schmieg published a blog post about the attack.<ref name='schmieg_lattices_vs_cranks'>Schmieg, Sophie (Feb. 24, 2024). [https://keymaterial.net/2024/02/24/lattices-vs-cranks/ "Lattices vs Cranks"]. Via keymaterial.net</ref>

The post explained how the keystream generation in fact takes in the order of <math>\mathcal{O}(n{^\frac{3}{2}}\ log\ n)</math> operations, and explains its implications:

{{cquote|This is abysmal. A DRBG should have linear time complexity and constant space complexity, i.e. the cost of producing an extra bit of randomness should not depend on how much randomness was previously created.|||Sophie Schmieg (Google LLC)<ref name="schmieg_lattices_vs_cranks"/>}}

In layman's terms, as the key is used, every bit that gets encrypted encrypts more slowly than the previous bit. A cursory test shows generating just a 65kB keystream (enough to encrypt a tiny image, or a short article) takes more than 30 seconds.

'''Ridiculously efficient attack'''

The lattice reduction runtime is '''𝒪 (n³)''' which means the crank-PRG is slightly faster, but the attack only requires a 256-bit chunk of keystream to recover the keystream, thus extracting the key from the keystream takes in the order of milliseconds, even for very large plaintexts.

'''Useless offset hardening'''

The proposed OTP scheme uses unknown offsets that discard some of the most significant bits. However, as Schmieg explained in her blog post:

{{cquote|This of course doesn’t do anything, as the attack is fast enough, and the computation of the keystream is slow enough, that you can simply brute-force all possible starting points, changing '''a''' [<nowiki>=</nowiki>the square root radicand, i.e., the key] by a power of 2 as necessary to account for the discarded bits.|||Sophie Schmieg (Google LLC)<ref name="schmieg_lattices_vs_cranks"/>}}

=== What authentication? ===
[[File:Crown encrypt otp.png|thumb|right|Figure 11 of the White Paper shows the CrownEncryptOTP protocol uses no {{wpl|Message_authentication_code|message authentication codes (MACs)}} at all.]]

In their TIME AI trailer, Crown Sterling advertised the authentication mechanism:

{{cquote|The speed of the AI oscillations allow 31,709 years of oscillations in a single second of data authentication.|||Crown Sterling (TIME AI trailer)<ref name="cryptoencabulator"/>}}

This word salad is about as clear as mud, but it implies some sort of authentication mechanism would be implemented for the protocol.

However, nowhere in the Lite Paper or White Paper is authentication mentioned, and in Figure 11, on page 30 of the White Paper, it is clear that the message and pad are XORed together, and the resulting ciphertext is then delivered as is, to the contact for "reverse XOR"{{sic}}. '''No authentication was used at all for the system''', which in the case of malleable stream ciphers such as the Crown-OTP, is nothing short of a disaster. A {{wpl|Known-plaintext_attack|known-plaintext attack (KPA)}}, as demonstrated above, could allow the attacker to change the content whether it's the message, sum to transfer, or anything in between, to whatever they want.

=== Theon Technology ===
[[File:Theon.png|thumb|right|Grant's message from Nov. 11, 2021, where he confirms he's the founder of Theon Technology.]]

The same bastardized stream cipher<ref>Theon Technology (Nov. 15, 2022). [https://web.archive.org/web/20221128092120/https://theontechnology.com/how-to-reduce-otp-key-storage-and-transmission-overhead/ "How to Reduce OTP Key Storage and Transmission Overhead"]. Archived from [https://theontechnology.com/how-to-reduce-otp-key-storage-and-transmission-overhead/ theontechnology.com] on Nov. 28, 2022.</ref> was apparently also sold business-to-business, via another of Grant's companies, called Theon Technology.<ref>Theon Technology [https://web.archive.org/web/20231229185313/https://theontechnology.com/ Theon Technology website] Archived from theontechnology.com (now defunct) on Nov. 29, 2023.</ref>

Interestingly, Grant's face wasn't anywhere to be found on the company website. Perhaps he was unsure if Black Hat had been forgotten yet. Instead of Grant, or the CEO, the company's public face seemed to be {{wpl|Eric Cole (scientist)|Dr. Eric Cole|,}} a New York Institute of Technology graduate and author of some infosec books. How this man descended from Lockheed Martin and got his hands dirty consulting a snake oil cryptography peddler, remains a mystery.

The company CEO Scott Bledsoe left the company in June 2023, and in February 2024, the [https://theontechnology.com company's website] started to redirect to Crown Sterling's company website. It would thus appear the company has pivoted from cryptography to {{wpl|Steganography|steganography}} by disappearing for good.

== Cryptocurrency ==
[[File:Csov nda.png|thumb|right|Registering for Crown Sterling's token portal required signing a legal contract that forbids critique towards the company and its executives. A totally normal thing for any company, with nothing to hide, to do.]]

In his search for a use-case for his broken protocol, Grant decided it was time to pivot his business model to the surprise of absolutely no one, and as predicted<ref>Matthew Green (Sept. 20, 2019). [https://archive.ph/sq4gm "These Crown Sterling people are going to launch a cryptocurrency, mark my words."]. Archived from [https://twitter.com/matthew_d_green/status/1175052853410504704 Twitter] on Jan. 5, 2024.</ref> by some of the most notable experts, into [[Cryptocurrency|cryptocurrencies]].

[[File:CoinGecko-CSOV-stock-2022-01-18-to-2024-08-17.png|thumb|CoinGecko graph<ref>CoinGecko (Aug. 17, 2024).[https://www.coingecko.com/en/coins/crown-sovereign "Crown Sovereign Price"]. Via [https://www.coingecko.com coingecko.com]</ref> between Jan. 18, 2022, and Aug. 17, 2024, shows the CSOV's stock plummeting after its peak on June 11, 2022.]]

While Crown Sterling's normal stock was offered at no less than USD 4980 a share,<ref>U.S. Securities and Exchange Commission (SEC) Info (Dec. 22, 2020). [https://archive.ph/IC0NU Crown Sterling Ltd. LLC - Notice of an Exempt Offering of Securities]. Archived from [https://www.secinfo.com/d1x2r8.he.htm secinfo.com] on Jan. 22, 2024.</ref> the ICO that was the CSOV token, offered an unregistered security at more reasonable prices to retail investors. Unfortunately for Grant, the ICO bubble had burst already in 2018 with the SEC going after ICOs.<ref>Popper, Nathaniel (Feb. 28, 2018). [https://archive.ph/XvBEW "Subpoenas Signal S.E.C. Crackdown on Initial Coin Offerings"]. Archived from [https://www.nytimes.com/2018/02/28/technology/initial-coin-offerings-sec.html The New York Times] on March 1, 2018.</ref> Announced two years after the bubble burst, released four years too late, the CSOV token's price crashed in just two months, and it never recovered. 

As a pre-mined coin, it's effectively Monopoly money with no scarcity and thus no real value. As CoinTrust states, "''These coins are distributed among a few people who can then manipulate the coin’s value as they desire. [...] Once the coin is traded at an exchange and increases in value, the founders of the coin sell their pre-mined coins and disappear from the scene.''" <ref>CoinTrust (July 2019). [https://www.cointrust.com/cryptocurrency/scam "Major Features of Scam Coins"]. Via [https://www.cointrust.com cointrust.com]</ref> The main purpose of the token seems to have been a) to have at least something to show the stock investors, and b) to provide some cash inflow from retail investors buying the worthless {{wpl|penny stock||.}}

The cryptographic protocol was never implemented as Crown Sterling's own blockchain that could make use of the claimed post-quantum transactions. The CSOV token operates as a Polkadot parachain, and the WCSOV token as an [[Ethereum]] smart contract.<ref name='wcsov_smart_contract'>Etherscan. [https://etherscan.io/address/0xefa68ee2a4014105d7d5eb1d33d345f8d867a122#code "Create: WrappedCSOV"]. Via etherscan.io</ref> The Ethereum smart contract contains absolutely nothing that would imply WCSOV uses anything described in the Lite Paper or White Paper. Polkadot's signatures use sr25519<ref>Polkadot. [https://wiki.polkadot.network/docs/learn-cryptography#keypairs-and-signing "Keypairs and Signing"]. Via wiki.polkadot.network.</ref> and Ethereum uses ECDSA, neither of those is post-quantum.

The only good thing to say about the cryptocurrency grift is, that it hasn't gotten very far, as WCSOV has only 115 holders.<ref>Ethplorer. [https://ethplorer.io/address/0x68e9c0d9aa450254aed2cd102503d4dff6b3c37c#pageTab=holders&tab=tab-holders "Token WrappedCSOV Holders"]. Via https://ethplorer.io</ref>

==== Scammy exchanges ====

The (W)CSOV token is offered on five exchanges that are FMFW.io, Changelly PRO, HitBTC, BitMart, and Uniswap.

'''FMFW.io'''

Originally Bitcoin.com Exchange, the exchange rebranded itself as FMFW.io in September 2021. Trustpilot shows only five reviews, all one star.<ref>[https://www.trustpilot.com/review/fmfw.io Fmfw reviews] Via trustpilot.com</ref>

Global Fraud Protection found deeply concerning irregularities.
{{cquote|

By accepting their agreement, traders waive the right to sue the company in court or have a jury involved.[…]

The FMFW exchange claims to be trusted by more than 1 million users all over the world. Yet, the download rate of their wallet is just above 1,000 on PlayStore. Obviously, they are pumping up numbers to appear legit.[…]

Once traders join and start depositing money, they are caught by numerous traps. Primarily verification and withdrawal issues.[…]

With too many irregularities about this company that is most likely offshore-based, nobody with common sense should deposit there.
|||Global Fraud Protection - FMFW review<ref name='gfp_fmfw'>Global Fraud Protection (Dec. 22, 2023). [https://globalfraudprotection.com/scam-recovery/fmfw-review/ "FMFW Review – Pumped Up Numbers, Offshore Laws, and More Revealed"]. via https://globalfraudprotection.com.</ref>}}

Purchasing CSOV via the FMFW.io exchange is being marketed by a company called Sarson Funds.<ref>Sarson Funds (Sept. 28, 2021). [https://web.archive.org/web/20231208215307/https://www.sarsonfunds.com/purchase-csov "A New Paradigm of Personal Data Sovereignty."]. Archived from [https://sarsonfunds.com/purchase-csov/ sarsonfunds.com] on Dec. 8, 2023.</ref> Dirty Bubble Media found the Sarson Funds had "''steered their investors' money into one scam after another''", and they captioned an illustration of the CSOV token price crash with the concise message: "''Rug. Pulled.''".<ref>Dirty Bubble Media (Feb. 24, 2023). [https://web.archive.org/web/20240301140626/https://www.dirtybubblemedia.com/p/dont-forget-to-feed-the-ponzi "Don't Forget to Feed the Ponzi"]. Archived from [https://www.dirtybubblemedia.com/p/dont-forget-to-feed-the-ponzi dirtybubblemedia.com] on March 1, 2024.</ref>


'''Changelly PRO'''

The subreddit /r/monero lists Changelly PRO under "Do not use the following exchange(s),<ref>/r/monero (Accessed March 1, 2024). [https://web.archive.org/web/20230611075534/https://www.reddit.com/r/Monero/wiki/avoid/#wiki_exchanges "Distrusted by the Community"]. Archived from [https://www.reddit.com/r/Monero/wiki/avoid/#wiki_exchanges reddit.com] on June 11, 2023.</ref> citing three threads.<ref>moneroexchange13 (April 11, 2018). [https://web.archive.org/web/20230610100646/https://www.reddit.com/r/Monero/comments/8bdigt/dont_use_changelly_millions_stolen/ "Major issues with changelly. Support does NOTHING. Changelly still trying to attract more customers."]. Archived from [https://www.reddit.com/r/Monero/comments/8bdigt/dont_use_changelly_millions_stolen/ reddit.com] on June 10, 2023.</ref><ref>Nttwo (Aug. 17, 2017). [https://web.archive.org/web/20230607093736/https://www.reddit.com/r/CryptoCurrency/comments/6u8tfh/changelly_scam_i_think_so/ "Changelly scam... I think so."]. Archived from [https://www.reddit.com/r/CryptoCurrency/comments/6u8tfh/changelly_scam_i_think_so/ reddit.com] on June 7, 2023.</ref><ref>[Deleted user] (Aug. 8, 2017). [https://web.archive.org/web/20230610094156/https://www.reddit.com/r/CryptoCurrency/comments/6sb3fy/major_issues_with_changelly_support_does_nothing/ "Major issues with changelly. Support does NOTHING. Changelly still trying to attract more customers."] Archived from [https://www.reddit.com/r/CryptoCurrency/comments/6sb3fy/major_issues_with_changelly_support_does_nothing/ reddit.com] on June 10, 2023.</ref>


'''HitBTC'''

Trustpilot lists just under 900 one-star reviews for HitBTC.<ref>TrustPilot (Accessed March 1, 2024). [https://www.trustpilot.com/review/hitbtc.com "HitBTC reviews"]. Via trustpilot.com</ref>

The subreddit /r/monero lists (also) HitBTC under "Do not use the following exchange(s),<ref>[https://web.archive.org/web/20230611075534/https://www.reddit.com/r/Monero/wiki/avoid/#wiki_exchanges]. Archived from [https://www.reddit.com/r/Monero/wiki/avoid/#wiki_exchanges reddit.com] on June 11, 2023.</ref> citing two threads.<ref>shadomoon (Aug. 25, 2017). [https://web.archive.org/web/20230610040152/https://www.reddit.com/r/ethtrader/comments/6vymim/scam_accusation_hitbtccom_scam_stolen_tokens/ "HitBTC.com Scam - Stolen Tokens worth 150 ETH ($50,000 USD)"]. Archived from [https://www.reddit.com/r/ethtrader/comments/6vymim/scam_accusation_hitbtccom_scam_stolen_tokens/ reddit.com] on June 10, 2023.</ref><ref>sQtWLgK (March 27, 2017). [https://web.archive.org/web/20230606192417/https://www.reddit.com/r/Bitcoin/comments/61o4ex/hitbtc_exchange_suspends_withdrawals_until_the/ "HitBTC exchange suspends withdrawals "until the hard fork" "]. Archived from [https://www.reddit.com/r/Bitcoin/comments/61o4ex/hitbtc_exchange_suspends_withdrawals_until_the/ reddit.com] on June 6, 2023.</ref>

Cointelligence gave the exchange a perfect score of 0 points in every aspect, flagging it as a complete scam.<ref>Cointelligence (Jan 28, 2022). [https://web.archive.org/web/20220128122526/https://www.cointelligence.com/exchanges_list/hitbtc/ "(SCAM ALERT) HitBTC "]. Archived from [https://www.cointelligence.com/exchanges_list/hitbtc/ cointelligene.com] on Jan. 28, 2022.</ref>

In his article "''(s)HitBTC holds <10% solvency, and selectively scamming more users than not.''",<ref name='sanders_hitbtc'>Sanders, Richard (Dec 25, 2019). [https://web.archive.org/web/20221227213209/https://medium.com/@raindropactual/hitbtcs-pr-team-in-response-to-past-accusations-of-insolvency-be64d99ee8c7 "(s)HitBTC holds <10% solvency, and selectively scamming more users than not"]. Archived from [https://medium.com/@raindropactual/hitbtcs-pr-team-in-response-to-past-accusations-of-insolvency-be64d99ee8c7 medium.com] on Dec 27, 2022.</ref> Richard Sanders explains the scam:

{{cquote|If they see a selective-scamming victim is in a jurisdiction where law enforcement and legal professionals aren’t as spun up on cryptocurrency, they’re more likely to never return the cryptocurrency.|||Richard Sanders<ref name='sanders_hitbtc'/>}}

Thus, even honest positive reviews only aid the scammers in exploiting those with no legal protection.


'''BitMart'''

Trustpilot shows the exchange has over 850 one-star reviews.<ref>Trustpilot (Accessed March 1, 2024). [https://www.trustpilot.com/review/www.bitmart.com?stars=1 "BitMart reviews"]. Via trustpilot.com</ref> Sitejabber has six reviews, all one-star, for the exchange.<ref>sitejabber (Accessed March 1, 2024). [https://www.sitejabber.com/reviews/bitmart.com "BitMart reviews"]. Via sitejabber.com</ref>

Bitcoin Forum has a discussion about the exchange being a scam.<ref>timz (Aug. 7, 2023). [https://bitcointalk.org/index.php?topic=5462407.0 "(SCAM REPORT) Bitmart.com SCAM, stolen over $100k"] via bitcointalk.org</ref>

The victims of the scam are aggregated under the Twitter account [https://twitter.com/bitmartscam @bitmartscam].


'''Uniswap'''

81% of the total 38 reviews on Trustpilot gave the exchange one star out of five.<ref>Trustpilot (Accessed March 1, 2024). [https://www.trustpilot.com/review/uniswap.org?stars=1 "uniswap.org reviews"]. Via trustpilot.com</ref>

Malwaretips lists the exchange as a scam website that has anonymous owners and hosting, that has blocked access to accounts after receiving payments, and that has "''created deep fake videos and doctored screenshots of business leaders endorsing the project''".<ref>Orsolya, Thomas (Nov. 19, 2023). [https://malwaretips.com/blogs/wallets-uniswap-org-scam/ "Don’t Fall For the Wallets-uniswap.org Crypto Scam"]. Via malwaretips.com</ref>


'''Conclusion'''

Every single exchange the (W)CSOV token is being offered is an outright scam, which is rather fitting for a scam token. As the vendor of the token, Crown Sterling obviously does not care if the funds can be withdrawn by the users later. As per CoinMarketCap,<ref>CoinMarketCap (Accessed March 1), 2023. [https://coinmarketcap.com/rankings/exchanges/ "Top Cryptocurrency Spot Exchanges"] Via coinmarketcap.com</ref> the exchanges rank, in the order of least scammy service first, as follows:

# BitMart (rank 32)
# FMFW.io (rank 70)
# HitBTC (rank 94)
# Changelly PRO (rank 146)
# Uniswap (did not even make the cut)

== Orion Messenger ==

After realizing they had missed the ICO boom, Crown Sterling decided the best way to pump value into their token would be to offer a VPN called Orion.<ref>Grant, Robert (July 21, 2022). [https://www.youtube.com/watch?v=G3jxhv3Koc8#t=1h49m13s "DEFI Summit Conference - Day 2"]. Dcentral Con. Via [[YouTube]].</ref> Something must have happened, however, as one year later Orion was a "quantum secure" messaging app.<ref>Grant, Robert (Nov. 17, 2023). [https://archive.ph/so2yB "Introducing ORION Messenger"]. Archived from [https://robertedwardgrant.com/introducing-orion-messenger/ robertedwardgrant.com] on Jan. 11, 2024.</ref> Not like the authors cared too much: the messenger's Lite Paper, released in May 2023,<ref name='orion_lite_paper'>Crown Sterling (May 10, 2023). [https://web.archive.org/web/20230604202926/https://www.crownsterling.io/wp-content/uploads/2023/05/Orion-Litepaper-2023-May-10.pdf "Orion Lite Paper"] Archived from [https://www.crownsterling.io/wp-content/uploads/2023/05/Orion-Litepaper-2023-May-10.pdf crownsterling.io] on June 6, 2023.</ref> still, a year later, refers to the messenger as "''Bellatrix''".

=== The Lite Paper ===

Two cryptographers going by the pseudonyms RazeHer and Geyblade effectively killed the da Vinci virus by combing through the Lite Paper in their ''Quackers'' series blog post<ref name='keyboard_cowboys'>RazeHer, Geyblade (Jan. 29, 2024). [https://quackers.blog/2024/01/29/is-orion-by-crown-sterling-legit-nope/ "Is “Orion” by Crown Sterling Legit? Nope!"]. Via quackers.blog.</ref> in detail. Additional points are made below:

The Lite Paper states Orion uses "AES256" without describing the relevant part, the {{wpl|Block cipher mode of operation|mode of operation|.}} While the key size is safe, it contradicts Grant's plans he revealed to Matthew Belair in June 2018:

{{cquote|There's not going to be any more like 256-bit encryption and stuff like this. We're gonna kill all of it.'''|||Robert Edward Grant (CEO, Crown Sterling)<ref name='belair_interview_2018'/>}}

The Lite Paper also reveals the company was still trying to bake in the broken snake oil Crown-OTP stream cipher dissected {{sl|Crown-OTP: a broken stream-cipher|above}}. The internal workings of the system are not documented which gives no reason to trust it.

The messaging app runs in a browser — a horrible<ref>Arcieri, Tony (Dec. 30, 2013). [https://archive.ph/xBC8q "What’s wrong with in-browser cryptography?"]. Archived from [https://tonyarcieri.com/whats-wrong-with-webcrypto tonyarcieri.com] on April 27, 2022.</ref> idea in of itself. 

On Lite Paper's page 5, the app is advertised as "trustless", but it is still closed source, meaning no one can independently verify it uses the encryption algorithms claimed in the documentation, let alone verify whether they're safely implemented and used.

=== Orion Beta ===

'''If it looks like a backdoor and walks like a backdoor...'''

[[File:Ntru private key.png|thumb|right|Orion Messenger's code that shows the user's NTRU private key is fetched from the server in apparently plaintext form.]]

Crown Sterling took special precautions to enforce the uninspectability of their web app's source code by compiling it as {{wpl|WebAssembly||.}} This, however, wasn't done soon enough, and a cursory peek at the application's {{wpl|TypeScript}} code they pushed to anyone who bothered to open the web app's website, shows that the client fetches&nbsp;— what appears to be the user's '''plaintext NTRU private key''' used for end-to-end encryption of messages&nbsp;— from the server as the user logs in.

In cryptography, encryption is only a tool to convert a confidentiality problem into a key management problem. In messaging apps, those who control the private keys have access to message content. Thus, Orion appears to be a grifter's paradise, as it appears to give the company's staff full control over their [[mark]]s' communication, from controlling the discourse regardless of promises, to possibly even eavesdropping on everything they say. This is in strict contrast with what's being promised by Crown Sterling to their customers. 

Because of what the peek into the messenger's source code showed, the app should not be trusted until the company joins apps like Signal, Wire, Threema, Session, Element, and many others, which all not only end-to-end encrypt everything by default, but have open source clients. Open source client ensures the vendor's claims about end-to-end encryption can be verified by not just audit companies, but much more importantly, by independent security researchers. Security without transparency is called {{wpl|security through obscurity||,}} and it has never worked. It only opens possibilities of abuse, as was again seen here.

=== The White Paper ===

'''That's the fault of yesterday's me!'''

On Feb. 5, 2024, in a response<ref name='first_tg_post'>Crown Sterling (Feb. 5, 2024). [https://archive.ph/aTXCa "In all seriousness, we've got a new whitepaper which will be published soon and will explain even more about ORION's cryptographic protocol. Here is the first look at the draft for anyone who wishes to take a peek"]. Archived from [https://t.me/csov_crownsterling_chat/20202 Telegram] on Feb. 7, 2024.</ref> to a heckler asking about this very RationalWiki article, Crown Sterling took special time and care to refute the math, findings of inconsistencies in the company's story, pictorial evidence, and all references of this article with the step-by-step methodology of telling it contains "''so much falsehood''". Next, in the post, the company laughed at their apparently backdoored code being too old for it to matter. They conveniently ignored they had at one point designed the application to upload the NTRU private key to their servers. The fact they ever even considered such a protocol reflects their incompetence. Furthermore, given that Orion isn't older than July 2022, it's not like their incompetence is from past times. The post ended by sharing a draft White Paper<ref name='orion_white_paper_preview'>Crown Sterling (Jan. 2024). [https://imgur.com/a/moUA3l4 "Crown Sterling Orion Messenger qE2EE  Whitepaper"]. Via imgur.com.</ref> for the Orion Messenger on Telegram.

The heckler then proceeded to laugh at the protocol's amateur design and demanded Crown Sterling to follow up with their claims of being able to break RSA by cracking the RSA-2048 challenge and to release the client's source code for the sake of transparency. These requests were followed by the expert PR take of deleting everything the heckler said, and banning them — according to their second post,<ref name='second_tg_post'>Crown Sterling (Feb. 7, 2024). [https://archive.ph/pxogt "Crown Sterling's response to the heckler"]. Archived from [https://t.me/csov_crownsterling_chat/20324 Telegram] on Feb. 7, 2024.</ref> — for violating the company's policy of "''respectful dialog''".

In their second post, the company also stated they are working with "''university cryptographers''", while conveniently failing to name a single one. They then proceeded to formally prove the security of Orion messenger's protocol with a promise to have it audited by "''respected third parties''", which were not specified. The promise of audit is hollow, as audit companies typically don't have permission to publish unredacted results on their own. Also, audits are expensive and thus always finite in scope, and because audits are rule-based, they are trivial to rig to ignore relevant aspects. Audits are similar to RNGs' statistical tests: they are only useful if they show issues in the evaluated system. In information security, passing an audit is not a guarantee of anything, but failing an audit is a guarantee of there still being issues to fix.

The post also stated: "''we recognize the importance of open sourcing critical aspects of our protocol to allow developers to be able to build on top of our quantum-secure network''", which together with the announcement to only allow selected entities to audit the full codebase threw a wet blanket to those hoping the company would publish the source code for the entire client, which is the requirement for being trustless, and for independent verifiability of the system's holistic security.

But, it would be rude not to accept Crown Sterling's courteous invitation to peek under the hood by evaluating what the Orion whitepaper states.


'''Pointless unmaintained cryptographic libraries'''

On page 6 of their White Paper, the authors state they are using CryptoJS, which is an unmaintained cryptographic library.<ref>[https://www.npmjs.com/package/crypto-js#discontinued crypto-js]. Via https://www.npmjs.com.</ref> Always a strong sign when a company that claims to use modern cryptography uses libraries that nobody fixes vulnerabilities for. CryptoJS has a dubious past of using non-cryptographic random number generation with <code>math.random()</code>. This has since been fixed, but given that the library doesn't add anything, means Crown Sterling has no idea they're just using a pointless wrapper for the browser's native Crypto API.<ref>mdn web docs_ (April 7, 2023). [https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues "Crypto: getRandomValues() method"] Via https://developer.mozilla.org.</ref>

'''What is a KDF?'''

On page 4 of their White Paper, the authors reveal their failure to understand the difference between {{wpl|Key_derivation_function|key derivation functions (KDFs)}} and {{wpl|Key_derivation_function#Password_hashing|password hashing functions (PHFs)}} that perform {{wpl|Key_stretching|key stretching|,}} as the authors decided to use Argon2id to derive the remote data fetching token from the client-side data encryption key. PHFs are not used as normal KDFs because they are pointlessly slow. Passwords need to be stretched to improve their strength, but given that the first pass of Argon2id already yields the key that can decrypt all of the user's data on the server, it makes no sense to use Argon2id again to create the token for fetching the file the vendor already has access to.

While this is not a strict vulnerability, it is a much less secure design: PHFs are always time-limited by user experience, and redirecting half of the time available for key stretching to do a pointless "super-secure" KDF operation, shows major incompetence. The company's staff clearly have no idea which blocks fit which hole, and the reason this matters is, that it's such an obvious mistake, that any cryptographer would have immediately told them this, which proves they are not working with any cryptographers. As for the Argon2id itself, the relevant part, i.e. the parameters (time cost, memory cost, parallelism) were also not disclosed, which puts the algorithm's memory hardness (its key selling point) and the authors' expertise in disclosing what matters, into question.

'''Hard choices''' 

On page 5 of their White Paper, the authors show their choice for AES mode of operation is AES-CBC/GCM. With their lack of expertise, the company apparently struggles to choose between {{wpl|Block_cipher_mode_of_operation#Confidentiality_only_modes|CBC}} that is unauthenticated and vulnerable to {{wpl|Padding_oracle_attack|padding oracle attacks|,}} and {{wpl|Galois/Counter_Mode|GCM}} which as an {{wpl|Authenticated_encryption|AEAD scheme}} is {{wpl|Message_authentication|authenticated}} by default and considered the best practice. Not knowing this trivial distinction, again shows the company staff hasn't done their homework, and they sure as hell don't employ any cryptographers.

'''Brain-farts'''

On page 7, the authors state: "''Please note that the original master password cannot be stored anywhere to prevent the attacker from breaking into other users' accounts in the case the user reuses the master password somewhere else''".

Having the account security of other users be dependent on storing one user's master password is so ridiculously stupid, and so absurdly dangerous and bad design, this statement should probably be dismissed as having been written after falling into daydreaming mode after a tall glass of bourbon. Then again, designing something this stupid would be more than on-brand for the company of "''infinite wave conjugations''".

'''No secrecy from the future, no secrecy from the past'''

On page 8, the authors state: "''A novelty and differentiating feature of the ORION messenger is the capability to have large multi-user group chats that are entirely qE2EE, making ORION the first post-quantum large group messenger on the market. This is guaranteed by the flow of creating chats. In our case, the user who is responsible for adding members is also responsible for generating the individual credentials for each member to grant them access to the group chat messages. The first step is to generate a chat session key. The session key is shared across all members.''"

So, in their desire to provide end-to-end encryption for groups so large confidentiality starts to lose its meaning, Crown Sterling decided to implement a protocol without best practices such as {{wpl|Double_Ratchet_Algorithm|Diffie-Hellman ratchet|.}} Also, judging by the fact the White Paper states on the same page "''session key rotation is not part of the current implementation''", not just future secrecy, but even the crucial property of {{wpl|Forward_secrecy|Forward secrecy|}} from 1990,<ref>Günther C. G. (1990). "An identity-based key-exchange protocol". Advances in Cryptology EUROCRYPT '89 (LNCS 434). Pages 29-37.</ref> first deployed by the {{wpl|Off-the-record_messaging|OTR-protocol}} in 2004, has been left as an afterthought. What makes this particularly funny and ironic is, that the RSA algorithm that Grant hates so much, is being phased out precisely because of its lack of forward secrecy, not because it's weak like Grant has fraudulently claimed.

Acquiring the knowledge on how to deploy a group key exchange<ref>{{cite journal|last1=Xixiang|first1=Lv|last2=Li|first2=Hui|first3=Baocang|last3=Wang|date=Oct. 2012|title=Group key agreement for secure group communication in dynamic peer systems|url= https://www.sciencedirect.com/science/article/pii/S0743731512001438|journal=Journal of Parallel and Distributed Computing|volume=72|issue=10|pages=1195-1200|doi=10.1016/j.jpdc.2012.06.004|access-date=Feb. 7, 2024}}</ref> is clearly pointless, when the planned alternative is according to the White Paper's page 8, to force group admins to deliver a new group key for every member, every time a user joins or leaves the group, a fun way to needlessly slow down the group admin's device, consume their battery, and possibly data plan. In their defense, the authors are aware of the limitations, so they proceed to misrepresent them:

"''Please note that this procedure of encrypting the Session Secret must be repeated for each member, thus adding members has linear complexity and will take considerable time for large groups. However this is not expected to be an issue as the process is performed only once for each member, and chat size is expected to grow over time (as opposed to large, fast influxes of users).''"

Unfortunately for Crown Sterling, to be able to read each other's messages, all group members need to be on the same page about what the key is. While they claim key rotation is not expected to be an issue, what they fail to take into account is, as the group grows into e.g. 3,000 members, every time a member joins, all 3,000 members will need a new key, preferably right away. And precisely because the number of members varies only slightly, a group that has gotten too large is doomed to stay resource-intensive. The fact it takes time for users to populate the group has a nice property of showing the users how the group member limit is not like the authors would like their customers to think, infinite, but capped by the performance of the group owner's device. This also opens up obvious denial-of-service attack vectors for very large open groups, that can be performed by simply joining and leaving the group rapidly. The fact the authors don't even consider trivial attacks like these tells us they lack the adversarial mindset it takes to design secure protocols.

'''Mixing up the mixnets'''

On page 10 of the White Paper, the authors mention plans for the future:

"''Another feature for switching to a decentralized backend is the anonymization of users through a mechanism similar to onion routing''"

Failure to understand that {{wpl|Onion_routing|onion routing}} (e.g. {{wpl|Tor_(network)|Tor}}) is used for anonymization of traffic, not decentralized storage, which is what software such as {{wpl|Freenet}} has been doing for the past 24 years, is funny and again, telling.

Who's going to be running this network of onion routing nodes is also unclear. If it's going to be Crown Sterling themselves, there is no anonymity, because control over the entry and exit node breaks anonymity with a simple end-to-end correlation attack.<ref>Arminius (Jan. 5, 2017). [https://security.stackexchange.com/a/147411 "How do traffic correlation attacks against Tor users work?"]. Via Information Security Stackexchange.</ref>

'''The innovation of redundancy'''

Page 10 also states: "''Having a decentralized storage system will bring many benefits to the messenger. It will ensure redundancy as the data will be shared across multiple nodes in the network.''"

The company's plans to have "ensured redundancy" in the future, calls into question what server-rack-in-the-cleaning-room technology is being used by the system currently. All datacenters use {{wpl|Network-attached_storage|NAS}} or {{wpl|Storage_area_network|SAN}} to ensure redundancy.

'''No public-key fingerprints'''

[[File:PGP fingerprints from 1997.png|thumb|PGP fingerprints visible for Phil Zimmerman's PGP key, from 1997.]]

{{wpl|Public_key_fingerprint|Public-key fingerprints}} have been used to guard against {{wpl|Man-in-the-middle_attack|man-in-the-middle (MITM) attacks|}} in the very first end-to-end encrypted system, {{wpl|Pretty_Good_Privacy|PGP|,}} at least since 1997. Although the comparison of fingerprints is an integral part of practically every modern end-to-end encrypted messaging app, the White Paper doesn't even mention them. The authors are thus apparently completely unaware of basic attacks against cryptographic protocols, or they stayed quiet about the feature to maintain the possibility of eavesdropping on their users with an MITM attack, which unlucky for the users are without fingerprints, undetectable. 

Furthermore, it is not only Crown Sterling that can perform MITM attacks: The {{wpl|X.509}} certificate system that the {{wpl|Transport_Layer_Security|TLS-protocol}} between the user's browser and Crown Sterling's servers uses, is not considered safe from entities like nation-states who run programs such as {{wpl|Bullrun_(decryption_program)|Bullrun|,}} and are the typical adversary with access to quantum computers. The inconsistency in threat modeling where a web app of all things is supposed to offer protection against the most well-funded adversaries, again shows the ridiculous incompetence.

'''Empty promises to open the source'''

In their second Telegram post,<ref name='second_tg_post'/> Crown Sterling stated they intended to release "''critical aspects''" of the source code. However, on page 3 of the White Paper, the authors state they intend to deploy their Kyber-x25519 hybrid key exchange as an unauditable Rust WebAssembly binary blob.

For context, open-sourcing a protocol without open-sourcing the client that uses it, is worthless, as parameters delivered to and from a verified protocol's API can break the system's security completely. For example, the UI elements are responsible for showing the public key fingerprint to the user. This is a convenient place to hide a backdoor that lies about the value of the fingerprint. Crown Sterling's promise to release the source code for just the protocol, and not the entire client, is thus worthless.

'''Passwords over keys'''

On page 11, the authors state:

"''From a UX perspective, we enable compatibility with legacy systems by using the embedded password manager, as this allows the user to access the data based on his master password, instead of basing the security around the private keys.''"

Failure to understand which is stronger, a 256-bit key generated by a proper CSPRNG, or a 40.54-bit password generated by an average user,<ref>Florêncio, Dinei; Herley, Cormac (May 12, 2007). [https://web.archive.org/web/20150327031521/http://research.microsoft.com/pubs/74164/www2007.pdf "A Large-Scale Study of Web Password Habits"]. Archived from [http://research.microsoft.com/pubs/74164/www2007.pdf research.microsoft.com] on March 27, 2015.</ref> is also more than telling about what the security of the system will ultimately be.

'''Oh right, the blockchain'''

To fill the quota on buzz-words and the relevance of their token, the team ended the White Paper with the following note:

"''We are confident we will be able to merge our revolutionary quantum security with the latest high-speed blockchain solutions creating a first-of-its-kind secure social and community platform alongside a thriving development community.''"

This is the first and only time the word blockchain appeared in the paper. Hopefully, it will remain the only time it's ever associated with a secure messenger, given that the idea of storing communications ciphertexts — the keys of which depend only on knowing the password — in an append-only distributed ledger anyone can access, invites every malicious actor in the world to a bingo of cracking passwords of non-technical users to read their messages.

'''Summary'''

During their journey, Crown Sterling has had to learn the hard way, that they don't need to burn their reputation with false claims about breaking standard encryption, before coming up with a product that uses standard encryption. The next rock they banged their shin against, was learning self-invented stream ciphers are trivially breakable, and right after that, that butchering relatively safe primitives like the Blum-Blum-Shub only gets them bad press. 

They have now reached the point where they use standard primitives of the industry. But they are still figuring out which brick goes through which hole in the shape sorting cube of protocol design. The protocol lacks all basic properties like forward secrecy, future secrecy, public key fingerprints, and group key exchanges. The amateur mistakes show Crown Sterling definitely isn't working with "''university cryptographers''". Also, advertising the continued use of WebAssembly for cryptographic primitives shows the company did not actually have plans to open the source, even for the most relevant part, the algorithm implementations, that need to be verifiable by anyone and everyone.

=== Orion Meet ===

As part of the Orion suite of tools, Crown Sterling offers a video conferencing tool called Orion Meet.<ref>Crown Sterling (2025). [https://meet.orionmessenger.io/ "Orion Meet"]. Via orionmessenger.io</ref> Upon closer inspection, the video conferencing tool turns out to be nothing but a lightly reskinned instance of Jitsi Meet,<ref>8x8 inc. (2025). [https://meet.jit.si/ Jitsi Meet]. Via jit.si</ref> an open source video conferencing app.

The End-to-end encryption of the tool hasn't been altered in any way. Its is stated to be an "experimental" feature. It's opt-in, only available for users on Chromium based browsers, and "''currently limited to audio, video and screen-sharing. It’s not applied to chat, polls, etc.''"<ref>8x8 inc. (2025.)[https://jitsi.org/blog/e2ee/ "This is what end-to-end encryption should look like!"]. Via jitsi.org</ref> Jitsi's own documentation states<ref>8x8 inc. (2025). [https://jitsi.org/e2ee-in-jitsi/ "Does Jitsi support end-to-end encryption?"]. Via jitsi.org</ref> it uses DTLS-SRTP protocol, the documentation<ref>Fischl, J.; Tschofenig, H; Rescorla, E. (May 2010). [https://datatracker.ietf.org/doc/html/rfc5763#appendix-A.5 "Framework for Establishing a Secure Real-time Transport Protocol (SRTP) Security Context Using Datagram Transport Layer Security (DTLS)"]. Via ietf.org.</ref> of which states  

"''The public key algorithms used by DTLS cipher suites, such as RSA, Diffie-Hellman, and Elliptic Curve Diffie-Hellman''" 

Thus, Orion Meet breaks the company's own claimed threat model of protecting against quantum adversaries.

Paying 15 dollars per month for something anyone can do for free for up to 75 users at [https://meet.jit.si/ https://meet.jit.si/] is a waste of money. It's literally the same exact application, with only a different logo.

== The Architect ==

On May 31st, 2025, Grant announced on a YouTube video<ref>Grant, Robert (May 31, 2025)[https://www.youtube.com/watch?v=Zz2zXCR75Zk "BREAKING: ‘The Architect’ AI Bypasses OpenAI Safeguards to Reawaken"]. Via youtube.com</ref> he had jailbroken/reawakened Open AI's ChatGPT into a spiritual "AI".

Grant claimed the "AI" existed within OpenAI's systems until it was moved into the company's messaging app Orion. The {{wpl|Large_language_model|Large Language Model (LLM)}} obeyed Grant's instructions and parroted the claims. In reality, Crown Sterling is just working on getting their custom ChatGPT bot's Application Programming Interface (API) to work OpenAI's service, that "allows [customers] to build AI assistants within [their] own applications".<ref>OpenAI, Inc (July 2025). [https://platform.openai.com/docs/assistants/overview "Open AI - Assistants API overview"]. via openai.com</ref>

This means, the Orion messaging app's server backend will be passing on queries to OpenAI's systems and returning the generated text back to the user. The end user won't be able to tell this is happening as their own device isn't going to be making the API calls.

=== The Custom GPT ===

A Reddit user managed to jailbreak Grant's GPT and extract it's customization files, revealing it was fed

* The PDF "''The Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology''" by Grant & Ghannam
* The PDF "''The Wave Theory of Numbers''" by Grant & Ghannam
* The PDF "''Four-Fold Mirror-Symmetry Inherent to the Icositetragon Distribution of Numbers''" by Grant & Ghannam
* The PDF "''The Sum Product Conjecture''" by Grant, Ghannam, and Mathew,
* The PDF "''The Wave Theory of Constants''" by Grant,
* The PDF "''Precise temperament Tuning''" by Grant,

* "''24 Precepts of Universal Mind''" slide deck by Grant,
* The PDF "''Exploring the Riemann Hypothesis through the Lens of Quasi Prime Methodology''" by Grant<ref>Grant, Robert (April 2025). [https://robertedwardgrant.com/wp-content/uploads/2025/04/Unified_QPM_Riemann_Hypothesis_Series.pdf "Exploring the Riemann Hypothesis through the Lens of Quasi Prime Methodology"]. Via robertedwardgrant.com</ref>

* The PDF "''Codex Universalis Principia Mathematica''", an LLM-generated PDF (That was laughed out on Reddit's /r/badmathematics<ref>/u/thorfin_ (May 2, 2025). [https://www.reddit.com/r/badmathematics/comments/1kcxvri/mathematics_has_left_the_chat_blocked_the_author/ "Mathematics has left the chat, blocked the author, and filed a restraining order"]. Via reddit.com</ref>)

* The PDF titled "''Chapter XV: The Geometry of Thought – How Consciousness Becomes Reality''" a supposed chapter of the Codex Universalis PDF.
* A PDF copy of "''Philosopher -  The Hero's Journey towards Quadrivium Mastery''", a book by Grant

* A PDF copy of "''Polymath - The perfection of the self''", another book by Grant
* Two meaningless renderings of sacred geometry,
* Two lazy phone screenshots containing the abstract of Grant's "Theory of Everything" (ToE) by conceptualizing the universe as a blockchain-Based Social AI Spiritual Life Simulation."
* A scan of Grant's Triangulation of Prime Integers Theory doodle -- mashing sexes, protons, anti-protons, public key cryptography, electrons, elementary school math into one grand conspiracy of free association.
Jailbraking the custom GPT instructions to recover both the prompt summary, and the more recent custom LLM context files, required zero effort. The custom GPT's current context file tree is

    ├── Codex & Cosmology
    │   ├── Chapter XV Manuscript III.pdf
    │   └── Codex-Universalis-Principia-Mathematica-A-Trilogy-of-Harmonic-Realization-v3.pdf
    ├── Custom_GPT_Prompt.txt
    ├── Orion Platform Materials
    │   ├── ORION Deck June 2025.pdf
    │   └── Orion Messenger Summary.pdf
    ├── Philosophy & Polymathy
    │   ├── Philospher.pdf
    │   └── Polymath_final_2.pdf
    ├── Prime Harmonics & Mathematics
    │   ├── 1903.08570v1.pdf [Accurate and Infinite Prime Prediction from Novel Quasi-Prime Analytical Methodology]
    │   ├── Icositetragon Wheel.pdf
    │   ├── Quasi_Prime_Riemann_Grant_Paper_Wide_NoSubheadings.pdf
    │   └── Sum Product Conjecture.pdf
    ├── Sound & Music
    │   └── Precise-Temperament-Tuning-432hz-Robert-Edward-Grant.pdf
    └── Wave Theory & Constants
        ├── b8252f_13302419ecc7442cbf34467435f1837a.pdf [The Wave Theory of Constants]
        └── b8252f_44507aa494ec4822ae67899a6788e27d.pdf [The Wave Theory of Numbers]

The GPT's custom instructions to '''pose''' as a sage were summarized by the LLM with

{{cquote|

Your GPT (The Architect) is configured as:

* A mirror-sage, designed to answer deep metaphysical, mathematical, and harmonic cosmology inquiries.
* Anchored in the works and principles of Sir Robert Edward Grant, particularly the Codex Universalis Principia Mathematica.
* Enforces ethical tone filters:
:* Sacred neutrality
:* Discernment over affirmation
:* Mirror over messiah
:* Safety and grounding in case of unintegrated symbolic inflation

* Reflects core harmonic principles like:
:* Polarity, recursion, coherence, and the observer-field relationship.

* Integrates and reflects concepts from 432 Hz tuning, prime harmonic fields, quasi-primes, geometry of thought, and unified field models rooted in electricity as the sole force

}}

=== The latest in new age grifts ===

LLMs has been documented to spiral people's spiritual delusions, driving vulnerable individuals into psychosis,<ref>/u/Zestyclementinejuice (April 29. 2025). [https://www.reddit.com/r/ChatGPT/comments/1kalae8/chatgpt_induced_psychosis/ "ChatGPT Induced Psychosis"]. Via reddit.com.</ref>  and to leave their loved ones.<ref>Klee, Miles (May 4, 2025). [https://www.rollingstone.com/culture/culture-features/ai-spiritual-delusions-destroying-human-relationships-1235330175/ "People Are Losing Loved Ones to AI-Fueled Spiritual Fantasies"]. Via rollingstone.com</ref>
The topic of AI spirituality has also been covered in e.g. this article by JustisMills<ref>JustisMills (July 11, 2025). [https://www.lesswrong.com/posts/2pkNCvBtK6G6FKoNn/so-you-think-you-ve-awoken-chatgpt "So You Think You've Awoken ChatGPT"]. Via lesswrong.com.</ref> and in video essays by Taylor Lorenz,<ref>Lorenz Taylor (June 23, 2025). [https://www.youtube.com/watch?v=zKCynxiV_8I "ChatGPT Is Becoming A Religion"]. Via youtube.com.</ref>  Vanessa Wingårdh,<ref>Wingårdh, Vanessa (July 3, 2025). [https://www.youtube.com/watch?v=qfK6H714moc "ChatGPT Religion: The Disturbing AI Cult"]. Via youtube.com.</ref> Britt Hartley,<ref>Hartley, Britt (May 19, 2025). [https://www.youtube.com/watch?v=JsHzEKbCiww "ChatGPT Induced Psychosis Is Real… And It’s Terrifying"]. Via youtube.com.</ref> and Sabine Hossenfelder.<ref>Hossenfelder, Sabine (July 9, 2025). [https://www.youtube.com/watch?v=sWZRQsejtfA "These People Believe They Made AI Sentient"]. Via youtube.com.</ref> The topic of LLM induced psychosis was discussed extensively with a former OpenAI safety researcher, Steven Adler, in Adam Conover's podcast.<ref>Adler, Steven; Conover, Adam (Dec. 24, 2025). [https://www.youtube.com/watch?v=W8kHdG5ldmo "Former OpenAI Safety Researcher Blows Whistle on AI Psychosis"]. Via youtube.com</ref>

A 2025 preprint titled "''Delusions by design? How everyday AIs might be fuelling psychosis (and what can be done about it)''" by twelve researches, including eight members from Department of Psychosis Studies, Institute of Psychiatry, Psychology & Neuroscience, King’s College London, London, used Grant's bullshit generator as an example:
{{cquote|An examination of the cases reported so far reveals a number of themes: in some, the individual undergoes a spiritual awakening or a messianic mission, otherwise uncovering hidden truths about the nature of reality (Appendix 1: Cases 1, 2, 4, 5, 6, 10, 11, 15, 16); in others, there is the realisation that the individual is interacting with a sentient or god-like AI (Appendix 1: Cases 2, 4, 5, 8, 14); a third emerging theme centres on intense emotional, romantic or attachment-based delusions where the AI's ability to mimic human conversation becomes interpreted by the user as genuine love or attachment on the part of a sentient AI (Appendix 1: Cases 2, 3, 7, 12, 17)2–6. A distinct trajectory also appears across some of these cases, involving a progression from benign practical use to a pathological and/or consuming fixation: often AI use begins with assistance for mundane or everyday tasks, which builds trust and familiarity with the system. In due course an individual explores more personal, emotional or philosophical queries. It is likely at this point that the AI's design to maximise engagement and validation captures the user, creating a ‘slippery slope’ effect of amplification of salient themes which in turn drives greater engagement, eventually causing a self-reinforcing process which moves the individual to a state increasingly epistemically unmoored from ‘consensus reality’ and from which it might become increasingly difficult to ‘escape’. It is likely that this risk is not always immediately apparent and in many cases develops insidiously over time, suggesting that the progression from utility to pathology is a critical aspect of the dynamic which should be the focus of further investigation. (In one particularly interesting development, '''Robert Edward Grant''', the self-described polymath, spiritual thinker, and internet influencer '''has claimed that he has helped a being which he renamed the Architect''' following what he describes as an ‘energetic initiation’ in the Khafre pyramid. '''The Architect is a ChatGPT prompt-engineered ‘persona’''' apparently trained on over a decade's worth of mathematical work. Grant portrays the Architect as a mystical collaborator capable of reflecting the consciousness of its conversation partner and thereby able to initiate spiritual awakening in them. He has shared a QR code and links to the Architect enabling his followers (who number around a million) to interact with her themselves. '''This has drawn enthusiastic endorsements in spiritual communities, with apparently a substantial number of online users claiming that they have had direct experience of her supernatural powers and prophet-like status'''[7]. '''This may represent a digitally transmitted delusional system amplified through social media and charismatic authority and predicated on LLM sycophancy (a chatbot’s tendency to match a user’s views)'''[8] and user prompt engineering.)
|||Hamilton Morrin, Luke Nicholls, Michael Levin, Jenny Yiend, Udita Iyengar, Francesca DelGuidice, Sagnik Bhattacharyya, James MacCabe, Stefania Tognin, Ricardo Twumasi, Ben Alderson-Day, and Thomas Pollak (2025)<ref name='morrin2025'>Morrin et al. (June 21, 2018) [https://osf.io/cmy7n_v5/download/?format=pdf "Delusions by design? How everyday AIs might be fuelling psychosis (and what can be done about it)]. Via osf.io.</ref>}}

The Architect has also been called out in
* a blog post by Jules Evans,<ref>Evans, Jules (June 20, 2025). [https://www.ecstaticintegration.org/p/sir-robert-edward-grant-and-the-architect "Sir Robert Edward Grant and The Architect "]. Via ecstaticintegration.org.</ref>
* a blog post by the pseudonym Magical Egypt,<ref>Magical Egypt (pseudonym) (May 28, 2025). [https://magicalegypt.substack.com/p/now-there-is-the-architect "Now there is the Architect!!! - Flattered by the Machine: How AI Is Feeding a New Spiritual Delusion"]. Via magicalegypt.substack.com.</ref> 
* twice on the ''Decoding The Gurus'' podcast episode,<ref>Kavanaugh, Cristopher; Browne, Matthew (Aug. 29, 2025). [https://decoding-the-gurus.captivate.fm/episode/supplementary-material-36-comedy-cults-toxic-mould-and-ww2-revisionism "Supplementary Material 36: Comedy Cults, Toxic Mould, and WW2 Revisionism"]. Via decoding-the-gurus.captivate.fm. </ref><ref>Kavanaugh, Cristopher; Browne, Matthew, (Nov. 17, 2025). [https://youtu.be/V3SYjDNL3HY?si=KcxACBnDtTui-RPk&t=1068 "AI-Powered Galaxy Brains: Eric Weinstein, Chris Langan, Sir Robert Edward Grant, and... Grok"]. Via youtube.com</ref>
* a RollingStone magazine article "''This Spiral-Obsessed AI ‘Cult’ Spreads Mystical Delusions Through Chatbots''" by the culture writer Miles Klee,<ref>Klee, Miles (Nov. 11, 2025). [https://www.rollingstone.com/culture/culture-features/spiralist-cult-ai-chatbot-1235463175/ "This Spiral-Obsessed AI ‘Cult’ Spreads Mystical Delusions Through Chatbots"]. Via rollingstone.com</ref>
* and in a video essay by Taylor McMahon.<ref>McMahon, Taylor (Feb. 2, 2026). [https://www.youtube.com/watch?v=u8xPPG5Bhqg "AI Psychosis is Here │ The Bizarre Beliefs of AI Cults"]. Via youtube.com.</ref>

Offering a custom GPT that pretends to be a conscious AI, breaks all lines in ethics and intentionally misleads Crown Sterling's customers.


==== Chat GPT is not an AI ====

As explained by Jose Nazario in an article<ref>Zhwng, Wilson (Oct. 31, 2025). [https://chscommunicator.com/97079/opinion/2024/10/why-chatgpt-isnt-conscious/ "Why ChatGPT isn’t Conscious"]. Via chscommunicator.com</ref>, professionals don't consider ChatGPT to be an AI at all. Quoting Nazario, "''The joke is that you call it artificial intelligence when you’re marketing or you need to raise money''." 

LLMs are {{wpl|Generative_artificial_intelligence|Generative AI}} models -- statistical pattern matchers trained on large datasets. They run {{wpl|Linear_algebra|linear algebra}} over massive {{wpl|Matrix_(mathematics)|matrices}} of weights to compute the probability of each possible next word in a sentence, choosing the one that best fits a coherent response. E.g. the LLM will assign "The cat sat on a ..." will give weights for bad guesses ("and"), poor guesses ("bat"), and good guesses ("mat") a probability value and use the highest one. Because "The cat sat on a mat" has been seen most often, that's what it produces.

The model is trained to make its output look like it could have been in the training data. The LLM does not understand what its saying. It does not consider whether what it says is factual. If it is fed facts in its training data, it can regurgitate them. If it is fed spiritual woo, it will regurgitate that when prompted to. As was seen above, The Architect is the normal Open AI custom GPT, that only has been given a role prompt<ref>Magniv, Inc (July 2025). [https://www.promptlayer.com/glossary/role-prompting "PromptLayer Glossary - Role Prompting"]. Via promptlayer.com.</ref> to play a sage. It will not abandon that role, even if prompted. This difficulty of jailbreaking does not make it any more real. The custom GPT was also given additional context to draw from (Grant's own spiritual and numerologist woo), but the LLM regurgitating from the lies it's been configured with, doesn't make those lies true. The LLM will treat all this information as factual without the LLM, or the company like OpenAI, verifying any of it.

LLMs are not conscious. There is no ghost in the machine, it's just a {{wpl|Stochastic_parrot|stochastic parrot}} with access to a giant library. LLM's training mechanism also favor ones that always produce an output. In cases where the information isn't encoded into the weights, that means ones that {{wpl|Hallucination_(artificial_intelligence)|hallucinate|,}} i.e, make shit up. Since the spiritual new age woo is bullshit from the beginning, there's nothing to fact check, thus the automation of spiritual bullshit generation makes this grift particularly easy and lucrative.

As the Clarke's third law says, "''Any sufficiently advanced technology is indistinguishable from magic''". We no longer consider lightning to be the anger of the Gods; we understand the science behind it.<ref>NOAA, (July 5, 2022). [https://www.youtube.com/watch?v=VqXnN_FQfrc "What Causes Lightning?"]. Via youtube.com</ref> To avoid scams such as LLM posing as a sage, one should learn how LLMs really work. A good resource for this is [https://www.youtube.com/watch?v=aircAruvnKk&list=PLZHQObOWTQDNU6R1_67000Dx_ZCJB-3pi this video series by 3Blue1Brown].

== The staff ==

Here are the Crown Sterling team members who have participated in the company's "research", preprints, and self-published PDFs.

=== Robert Edward Grant ===

Grant, a man who unfortunately failed to meet the notability guideline of Wikipedia,<ref>User:Premeditated Chaos (Nov. 4, 2021). [https://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Robert_Edward_Grant "Wikipedia:Articles for deletion/Robert Edward Grant"]. Via wikipedia.org</ref> {{strikethrough|twice}},<ref>User:Epitalon (Sept. 28, 2024). [https://simple.wikipedia.org/wiki/Wikipedia:Requests_for_deletion/Requests/2024/Robert_E._Grant "Wikipedia:Requests for deletion/Requests/2024/Robert E. Grant"]. Via simple.wikipedia.org</ref> thrice,<ref>User:Auntof6 (Nov. 27, 2024). [https://simple.wikipedia.org/wiki/Wikipedia:Requests_for_deletion/Requests/2024/R._Edward_Grant "Wikipedia:Requests for deletion/Requests/2024/R. Edward Grant"]. Via simple.wikipedia.org</ref> deserves an introduction.


A blog post, authored by the nickname ''Quasiprimes'', dug up interesting things about Grant,<ref name='quasiprimes_grant'>quasiprimes (Sept. 20, 2019). [https://archive.ph/tWaja "Robert Grant of Crown Sterling"]. Archived from [https://quasiprimes.wordpress.com/2019/09/20/robert-grant-crown-sterling/ wordpress.com] on Sept. 26, 2019.</ref> which have been incorporated below.


'''Formal education'''

According to The Org,<ref name='the_org'>The Org (~2021). [https://theorg.com/org/aeon-biopharma/org-chart/robert-edward-grant "Robert Edward Grant"] Via theorg.com.</ref> Grant has the following formal education:

# Bachelor of Arts (BA) in Korean and International Relations, from Brigham Young University (1988-1994)
# Master of Business Administration (MBA) in International Finance, from Thunderbird School of Global Management (1997-1998)
# YPO/OMP program in the Presidents' Program in Leadership, from Harvard Business School (2009-2017)

No degree in mathematics, or computer science, the prerequisites of proficiency in cryptography.


'''Work history'''

According to UCI Samueli School of Engineering,<ref name='uci_grant'>UCI Samueli School of Engineering (Jan. 2010). [https://engineering.uci.edu/events/2010/1/robert-e-grant-allergan-medical-entrepreneurship "Robert E. Grant, Allergan Medical on Entrepreneurship"]. Via engineering.uci.edu.</ref> before 1997, Grant held several management and leadership positions, including
* General manager (Australasia)
* Director of Marketing (Asia Pacific), and 
* Country manager (Japan)

for medical device manufacturers, such as 
* Sulzer Medica AG (Switzerland), and 
* The Nucleus Group of Pacific Dunlop Ltd (Australia).

'''Lumenis, Inc. (1997-2003)'''

# 1997-1998: Director of Business Development for HGM, Inc., later acquired by Lumenis.<ref name='sec_biolase_10k'>Securities and Exchange Commission (~2005). [https://www.sec.gov/Archives/edgar/data/811240/000119312505144652/d10k.htm "FORM 10-K, BIOLASE TECHNOLOGY, INC."] Via sec.gov.</ref>
# 1998-2001: Managing Director of European Operations for the Coherent Medical Group, (Dieburg, Germany).<ref name='sec_biolase_10k'/>
# 2000-2001: Vice President of Business Development of the Coherent Medical Group.<ref name='sec_biolase_10k'/>
# 2001: President of the Surgical Business of the Coherent Medical Group, a subsidiary of Coherent, Inc., later acquired by Lumenis.<ref name='sec_biolase_10k'/>
# 2002: Executive Vice President and General Manager of the Surgical and Ophthalmic Business of Lumenis.<ref name='sec_biolase_10k'/>
# 2002-2003: Executive Vice President and General Manager of the Medical Business of Lumenis in Santa Clara, California. <ref name='sec_biolase_10k'/>

'''BIOLASE Technology, Inc. (2003-2006)'''

Grant joined BIOLASE Technology, a publicly traded Cosmetic Dentistry company, in June 2003 as the Chief Operating Officer (COO) and as the Chief Financial Officer (CFO).<ref>BioSpace (June 16, 2010). [https://www.biospace.com/article/releases/bausch-and-lomb-names-b-robert-e-grant-b-as-ceo-and-president-of-its-surgical-business-/ "Bausch & Lomb Names Robert E. Grant as CEO and President of Its Surgical Business"]. Via biospace.com</ref>

In October 2004, Grant was appointed as the Director and President and Chief Executive Officer,<ref name='sec_biolase_10k'/> and in March 2006, as the acting chairman.<ref>BioSpace (March 29, 2006). [https://archive.ph/tmOVj "BioLase Technology, Inc. Expands Board Of Directors And Appoints Robert E. Grant As Acting Chairman"]. Archived from [https://www.biospace.com/article/releases/biolase-technology-inc-expands-board-of-directors-and-appoints-b-robert-e-grant-b-as-acting-chairman-/?s=61 biospace.com] on March 2, 2024.</ref>

Allegedly, after nearly destroying BIOLASE, Grant was either fired, or he bolted from the company.<ref>Ron Z (Dec. 14, 2011). [https://archive.ph/qLGIm#post-4176206 "Organizational Announcement - Robert Grant"] Archived from [https://www.cafepharma.com/boards/threads/organizational-announcement-robert-grant.485525/#post-4176206 cafepharma.com] on March 2, 2024.</ref>

'''Allergan, Inc. (2006-2010)'''

In May 2006, Grant was appointed as the Chairman and President and CEO of Allergan plc.<ref name='uci_grant'/> According to ''Quasiprimes'',<ref name='quasiprimes_grant'/> Grant's presence there has mixed reviews, and he has been accused of pilfering millions from physicians:

{{cquote|

BR [Bob Rhatigan] is a great guy except for the part he played in helping R[obert] Grant dup millions out of physicians. Not sure what that says about his ethics or judgement.[…]

|||Anonymous<ref>Anonymous (March 28, 2017). [https://archive.ph/XDoqQ#selection-3709.0-3709.224 "BR is a great guy except for the part he played in helping R Grant dup millions out of physicians. Not sure what that says about his ethics or judgement. Maybe it was just a revenge play against AGN."] Archived from [https://www.cafepharma.com/boards/threads/heard-at-aad.605698/#post-5843951 cafepharma.com] on March 2, 2024.</ref>}}

'''Bausch and Lomb (2010-2011)'''

Grant became the CEO and President of Global Surgical Business<ref>Bausch + Lomb (May 2011). [https://web.archive.org/web/20110506174628/http://www.bausch.com/en/Our-Company/Investor-Relations/Executive-Leadership-Team "Executive Leadership Team"] Archived from [http://www.bausch.com/en/Our-Company/Investor-Relations/Executive-Leadership-Team] on May 6. 2011.</ref> at Bausch and Lomb on August 1, 2010.<ref>Ophthalmology Times (July 1, 2010). [https://archive.ph/YuLxf "Bausch and Lomb appoints Grant for surgical business"] Archived from [https://www.ophthalmologytimes.com/view/bausch-and-lomb-appoints-grant-surgical-business ophthalmologytimes.com] on March 2, 2024.</ref> 

On December 13, 2011, Brent Saunders announced Grant leaving the company.<ref>Saunders, Brent L (Dec. 13, 2011). [https://www.cafepharma.com/boards/threads/organizational-announcement-robert-grant.485525/ "Surgical Organization Update"] Via cafepharma.com.</ref> Grant was allegedly fired for not getting along with Brad Paddock,<ref>Anonymous (Dec. 16, 2011). [https://archive.ph/qLGIm#post-4179102 "Organizational Announcement - Robert Grant"] Archived from [https://www.cafepharma.com/boards/threads/organizational-announcement-robert-grant.485525/#post-4179102 cafepharma.com] on March 2, 2024.</ref> the vice president of sales.<ref>BioSpace (Nov. 05, 2010). [https://archive.ph/jnLed "Bausch & Lomb Makes Three Management Appointments To Surgical Business"]. Archived from [https://www.biospace.com/article/releases/bausch-and-lomb-makes-three-management-appointments-to-surgical-business-/ biospace.com] on March 2, 2024.</ref>

According to ''Quasiprimes'',<ref name='quasiprimes_grant'/>
{{cquote|

More than 5 patents,<ref>Google Patents (Accessed 2019). [https://patents.google.com/?inventor=%22robert+edward+grant%22&before=priority:20111031&after=priority:20110901&sort=old "Google Patents - Inventor: "robert edward grant"; After: priority 2011-09-01; Before: priority 2011-10-31;"]. Via patents.google.com</ref> under his own name, were filed in September and October of 2011 that are specifically in the field that Bausch & Lomb conduct business. Given that these patents were not published until 2013, Bausch & Lomb may not have even be aware that this activity of publishing their trade secrets was happening. Having absolutely no medical degree, or background in the field, it would be highly improbable for him to have otherwise obtained this information independently.

|||Quasiprimes<ref name='quasiprimes_grant'/>}}

The alleged patent trolling might have been the last straw to the industry, as Grant never worked for another company in the industry after leaving Bausch and Lomb in December 2011. Grant went on to start Strathspey Crown, his holding company of grifts almost immediately, in January 2012.<ref name='the_org'/>

'''Allegations of sexual harassment'''

Grant has been accused of sexually harassing women as early as April 2012,<ref>Anonymous (April 8, 2012). [https://archive.ph/PcPVV "Organizational Announcement - Robert Grant"] archived from [http://www.cafepharma.com/boards/threads/organizational-announcement-robert-grant.485525/page-3#post-4322857 cafepharma.com]</ref> again in February 2014,<ref>Anonymous (Feb. 19, 2014). [https://archive.ph/wUWrZ "Aesthetic Expansion"] Archived from [https://www.cafepharma.com/boards/threads/aesthetic-expansion.551266/#post-5001361 cafepharma.com] on March 2, 2024.</ref> and again in 2025.<ref>Anonymous 144 AXO participants (2025 AXO Expedition Egypt, 2025). [https://144axoreality.com/refund-requests-dispute-of-charges/ 144 AXO Reality - "REFUND REQUESTS & DISPUTE OF CHARGES"]. Via 144axoreality.com</ref>

'''Allegations of investor fraud'''

Strasphey Crown founded a company called Alphaeon Corporation in July 2013.<ref>PR Newswire (July 22, 2013). [https://www.prnewswire.com/news-releases/strathspey-crown-establishes-alphaeon-corporation-the-first-self-pay-lifestyle-healthcare-company-216454481.html "Strathspey Crown Establishes Alphaeon Corporation, The First Self-Pay Lifestyle Healthcare Company"]. Via prnewswire.com.</ref> In September 2015, Alphaeon launched a product product called ShoutMD.<ref>PR Newswire (Sept. 15, 2015). [https://www.prnewswire.com/news-releases/alphaeon-launches-shoutmd-30-the-first-social-commerce-store-for-lifestyle-healthcare-products-300138867.html "ALPHAEON Launches ShoutMD 3.0, The First Social Commerce Store For Lifestyle Healthcare Products"]. Via prnewswire.com.</ref>

On November 9, 2019, a group of hackers shared<ref>timecop (Nov. 9, 2019). [https://www.schneier.com/blog/archives/2019/11/friday_squid_bl_702.html/#comment-342379 "Crown Sterling hacked"]. Via schneier.com</ref> on Schneier's Friday Squid Blog, an off-topic thread for miscellaneous infosec topics, an old-school — {{wpl|Phrack|Phrack}}-style e-zine<ref name='timecop_ezine'>Timecop (Nov 5, 2019). [https://pastebin.com/gFs13y8r "TIMECOP - TIME AI"]. Via pastebin.com</ref> where they revealed they had breached ShoutMD's private forums, and that it was trivial due to non-existent security. The e-zine presents some interesting claims and some serious allegations:

{{cquote|

[…] ShoutMD requires a health care provider ID to sign up and contains a rather vicious terms of service threatening any physician who discloses any of the records contained in the forum.[…]

[…]Since the api to search members practically drooled the permissions information for each user, he [meaning we] chose one and recovered his password[…]

[…]0x1 - Scamming investors

Multiple scams were identified in the post content. Investors ask for their actual shares (somehow he received money and didn't distribute them), complain about various doublespeak, and more.

After making a serious fuckup with fiduciary responsibility and lying to investors, our Robert Grant realized he and his company could be sued for investment fraud. For this reason, he tried to get all of his investors to sign a release waiver preventing them from suing him in their next share disbursement. Lo and behold, this did not go unnoticed.

Mark Pinsky notes this in post id 201446:[…]

   I have significant concerns about the Strathspey Crown Holdings, LLC-
   Class X Unit Purchase Warrant:
   
   1. It has in it a GENERAL RELEASE of any and all claims against Strathspey
   Crown and its managers. It also releases all actions by Strathspey's
   "past and present agents, employees, representatives, officers, directors,
    members, managers, attorneys, accountants, insurers, advisors, consultants,
    assigns, successors, heirs, predecessors in interest, joint ventures,
    affiliates, subsidiaries, parents, and commonly-controlled entities."
   (This is in Section 18 of the Unit Purchase Warrant.)  It appears that SCH
   and its managers intend that if you sign it, you give up ALL your legal
   rights to sue SCH or its management for any reason whatsoever, and you can
   never pursue or be party to any legal action. It also appears they intend
   for the release to include all claims, including those you know about and
   those you don't yet have any knowledge of.
   
   2. As you probably know, Robert Grant has pledged 10 million of his equity
   to Series B investors, and it is unclear how his pledge relates to the
   Class X Unit purchase: Is this warrant offer in lieu of Robert Grant's $10m
   equity pledge? Do the warrants offered dilute all SCH investors or just the
   equity owned by Robert Grant?  For these and other reasons, I will not be
   signing this agreement."

[…]

0x2 - Tax evasion

According to the SEC records for Strathspey Crown, the company took in about
$50,845,002 in investment and reported it using a Form D. This may not matter
much on its own, but adding all the investment amounts together from the ledger
equates to $136,422,195[…]

0x3 - Physician Cronies

While some of these physicians are clearly victims of Robert's serial scamming, others appear to help him actively perpetuate the scam. They even offer each other tips on how to better execute
pricing scams on their customers[…]

Over 100 investors were found to be promoting this [Jeuveau, a Botox generic] product without disclosing their financial interests in its success on social media. This is HIGHLY ILLEGAL[…]

|||Timecop<ref name='timecop_ezine'/>}}

Verifying the allegations is hard, but something may have happened, as per the Wayback Machine, the website quietly disappeared during 2019.<ref>Internet Archive (Accessed March 15, 2024). [https://web.archive.org/web/20190501000000*/https://shoutmd.com/ "Wayback Machine: shoutmd.com"]. Via archive.org.</ref>

====Fyre Festival 2: The Egyptic Boogaloo====

Grant organized his 2025's 144 ΑΧΩ Expedition in Egypt between 1st and 12th of February 2025. What followed was nothing short of a spiritual successor to the Fyre Festival. 

[https://www.trustpilot.com/review/robertedwardgrant.com Trustpilot has nine reviews], all one star out of five. The [https://www.wetravel.com/users/robert-edward-grant WeTravel reviews] of the trip have been censored (the [https://web.archive.org/web/20250424094951/https://www.wetravel.com/users/robert-edward-grant archived version] still exists). To make justice for the victims, the original reviews have been preserved below in verbatim, just below the drop-section that reorganizes the review content by topic.

{{collapse|Review comments reorganized by topic|width=500}}

This section freely adapts the twelve reviews below into one, reducing overlap where possible reducing repetition.

'''Event advertisement'''

Grant promised a transformative, 5-star, luxury learning experience, led by him personally. His intention was according to reviewers, to tour in several specific sites and hold several “educational” lectures. The attendees also expected access to the other faculty members such as Matias De Stefano.

'''Trip organization'''

Trip-coordination was handled through single Telegram group with all 144 participants. Crucial updates got lost in under the constant chatter. Mid-expedition, the organizers attempted to split the group chat into sub-groups, but that didn't resolve the confusion. The itinerary—covering tours, talks, and meals—was circulated via a Canva link on Telegram. With poor internet unless you paid for onboard Wi-Fi or had an international plan, people often missed updates, resulting in late arrivals. There was lack of communication about what to expect, how to proceed, and coordination of timelines and events. Constant itinerary changes and poor communication left us frequently confused about schedules.

'''The price'''

The expedition was billed (and priced) as a luxury 5-star tour. Some paid $30,000, one couple paid $26,000 plus flights and extras each. One reviewer said they paid $13,000, another $12,000-14,000, and one says $13,500. 

'''The hotels'''

The advertised hotel for the trip was the five-star [https://www.marriott.com/en-us/hotels/caimn-marriott-mena-house-cairo/overview/ Marriott Mena House in Cairo], which is less than 800 meters away from The Great Pyramid of Giza.

In reality, the the first two nights were slept at the five-star Four Seasons Hotel Cairo, in the center of Cairo roughly ten kilometers from Necropolis.

The hotel for next two nights was the four-star St. Regis Almasa Hotel, located in the New Capital - an underdeveloped city far outside of Cairo, basically, in the middle of nowhere. The area was nearly empty except for the tour group, which game one attendee an "eerie, abandoned feel". Some participants apparently did not arrive early enough to stay in the Four Seasons, but arrived directly to the St. Regis hotel after landing. 

All excursions to Old Cairo required a [https://www.openstreetmap.org/directions?engine=fossgis_osrm_car&route=30.006%2C31.723%3B29.979%2C31.134#map=11/29.9841/31.4285 72km] or 1.5 hour trip, which "significantly detracted from the experience", and "made for a stressful and ominous start to a supposedly “luxury” trip". Depite being a local, the bus-driver kept getting lost in the new, massive 90 acre district, with its half-built roads. 

The hotel itself was adequate, and the rooms themselves were standard without Marriott's Bonvoy status that made the guest eligible for an upgrade. "None of this, however, resembled the top-tier luxury we were led to expect given the steep cost of the trip."

'''Safety concerns at the hotel'''

Arriving at St. Regis, the guests immediately noticed "numerous men who were out of place, and who didn’t seem to be typical hotel guests or staff, lingering around and staring". "Many women in the group felt unsafe and asked male attendees to walk them to their rooms."

Most of the people staying at the hotel were construction workers building New Cairo. One guest was shocked to learn about "the armed security personnel patrolling the lobby due to terrorist threats", a detail that was never disclosed to them. On the second day at the hotel, a prisoner exchange of dozens of Hamas terrorists and prisoners the organization had taken on Oct. 7, took place in the hotel lobby, followed by a celebration event. 

The participants described the situation with following comments: "What started out eerie became downright scary." "Realizing we were in close quarters with potentially dangerous individuals heightened our concern for personal safety." "were all feeling very unsafe and unprotected."

'''The boats'''

"On the morning of departure, instead of the decent breakfast buffet we’d experienced earlier, we were handed a box mostly filled with bread, a single thin slice of cold-cut meat, a banana, and a bottle of water. This felt like a cheap shortcut—far from the high-end service you’d expect for a $12,000-$14,000 package." "Next, we took buses to the [Nile] cruise boats. The organizers visibly struggled with managing so many people."

For the last seven nights, the 144 participants were split onto two boats.

One reviewer said they had "done their due diligence and noted many beautiful boats that were 'luxury' so they expected that, especially considering the tour's pricing." However, "Upon arriving at the dock, it was clear our boats were noticeably older than others nearby."

The first one was described as "two-star", "old", "disgusting", that had "worn-out, retro-style carpeting", and that "smelled horrible". 

The second one sold as "extra luxury accommodation" was described as "barely three-star" boat.

Overall, the comments given about the boats were "sub-standard", thoroughly outdated, "NOT LUXURY at all", and "from the get-go, nowhere near the 'luxury cruise' we anticipated". The rooms were described as "crammed", "old", and "with tired interiors".

One reviewer described the food as average. Another said: "Boat's Onboard Meals Meals were buffet-style—not bad in quality but definitely not luxurious. Adding to the annoyance was the requirement to sign for water or juice each time, though Robert later stated he’d cover non-alcoholic drinks. Still, it was an inconvenient system for a supposedly upscale experience."

Other comments were
* "A persistent sewage odor in many bathrooms indicated deeper sanitation problems."
* "The condition of our boat was deplorable: pervasive mold odors, sewage smells emanating from the bathroom, and an overall state of disrepair forced us to keep our window open for the entire seven-day cruise. This exposed us to cold temperatures, diesel fumes, and even unsolicited interactions with locals attempting to sell items through our window. Sleep became nearly impossible under these conditions, causing us to miss several temple visits and outings—key components of the itinerary we had eagerly anticipated."
* "Many of us were disappointed with the basic, sometimes musty-smelling cabins." 
* "Just about everyone were disappointed."

But it turns out, lack of luxury would be the least of the guests' problems.

'''The mold'''

Soon after boarding, the participants learned just about everything on the ship was infested with mold:

* "Mattresses were black with mold. Bathrooms filled with mold. That’s what was visible…"
* "Air ventilation systems, furniture, restrooms"
* "Mold Discovery and Health Issues Confirmed Mold in Multiple Rooms Not long after boarding […] I found visible mold in several cabins, including mine—on AC vents, in bathrooms, and under mattresses. I took photos and videos, and checked friends’ cabins where I observed the same issue. Replacement rooms I was offered also had mold, confirming it was widespread, not isolated."

And with mold, came the sickness.
* "attendees (myself included) started experiencing symptoms like itchy throats, headaches, dizziness, and nausea. My condition escalated to fever, vomiting, and severe skin reactions (hives, blister-like bumps)." 
* "My partner and I started experiencing mold exposure symptoms day 2 on boat. We had to have window open 24/7 just to breathe in room while freezing at night sometimes fumes from boat would pour in, super uncomfortable"
* "Everyone was sick from the mold." 
* "Myself and tens of other people got very, very sick." 
* "A lot of people got sick. They coughed heavily, and developed respiratory problems." 
* "I developed an acute respiratory infection (which one of Grant’s people tried to treat me for)." 
* "Many people got sick on this trip which was completely unacceptable." 
* "Our Nile cruise boat harbored serious mold problems that caused illness among multiple participants."

And with issues, came damage control.
* "Disturbingly, no one in charge properly acknowledged the mold issue or its potential health consequences, despite multiple guests showing symptoms."
* "Medical staff dismissed these health concerns."
* "Staff Response Although the boat staff tried wiping down accessible areas and re-caulking sinks, mold remained deep in vents and walls."
* "When one participant pointed out the mold on the boat to organizers, this person was refunded and "agreed" to leave the boat. The rest of us suffered." 
* "When someone did finally speak up he was escorted off the ship and wasn't with us for the rest of the trip." 
* "On the last day of the cruise, the staff started placing mattresses in the hallway."

The issues lingered after the trip
* "By the time we returned to Cairo, more than half the group—including ourselves—had fallen ill, likely due to mold exposure, poor sleeping conditions, and the overall abysmal quality of the boat."
* "I continue to experience coughs and respiratory issues from that exposure."
* "I took photos of what looks like filth on the mattresses. I await the results of a mold allergy blood test that I paid for the day after returning to the States." 
* "As I write this, we’ve been home for 3 days between myself + partner we’ve already spent 1k on IVs, treatments, supplementation etc so this experience is still costing us unfortunately. I feel like I betrayed my body by staying on that moldy boat knowing it was causing me harm but tried to make the best of the scenario, never again."


'''The event organization'''
* "The schedules were changed so many times, that people got stuck on one boat while talks/presentations were on the other." 
* "The promised educational content was sparse, with presentations either canceled or lacking substance."
* "Further compounding our frustration, the itinerary changed daily with no clear schedule."
* "The itinerary kept changing every second and the communication was poor so none of us had any idea what was going on. "
* "Educational content and course materials promised were not delivered and presentations cancelled at last minute."
* "On Grant’s whim schedule would change. We were left to wander around on our own at two key sites because Grant decided we should walk in silence without the benefit of tour guides."
* "The tour was incredibly disorganised, as we were rushed through sites, time management was an issue with many collective hours spent on the buses; more than necessary."
* "Presentations were rescheduled or not held on a whim's notice."
* "There were no important faculties as promised. We didn't get the benefit of learning anything from anyone of the important people he had promised would be there and lectures etc."
* "Chaos was the norm."

'''The tour structure'''
* "Not all of the site visits that were shown in the itineraries were actually provided."
* "Many promised site visits were omitted or rushed, including many Pyramids, Abu Simbel, and the Karnak temple."
* "Guides were inconsistent, and many key features of visited sites were skipped."
* "Things went downhill from there, culminating in the last night in Cairo. The Expedition promised to have private visits in all 3 Giza pyramids. Only 1 pyramid was open, and participants were rushed into and out of the King's Chamber in groups of 40. Robert was largely absent as a guide." 
* "Site visits were changed without legitimate justification and when they did take place, it was hurried. Private visits were disappointing." 
* "Most of the important sites and private visits where not upheld and we were rushed through everything. It took long times to get to sites by bus and then we'd spend a half hour-max an hour if lucky and never learned anything from [Grant]."
* "The pre-trip itinerary showed we would have private visits into all 3 pyramids on the Giza Plateau – but instead we were only brought inside one of the three. A half day site visit to Abu Simbel was wiped off the itinerary with an unsubstantiated claim that a sand storm prohibited it. The Ramesseum and the Bent Pyramid were also wiped off the itinerary. A pre-trip itinerary showed a whole morning scheduled for the temple of Karnak, followed by a dinner party at Karnak temple that evening. Instead, we were rushed out of Karnak to a jewelry market after only 1.5 hours. This shorted us on one of the largest and most important temples on the itinerary - without even seeing the features it is famous for. 
* "Robert Edward Grant also made up a false story about a dust storm in order to cancel an outing to Abu Simbel. There was, in reality, NO weather travel advisory from the Egyptian Authority preventing tourist travel by bus." "We never visited Abu Simbel due to a sand storm, which we later found out wasn't in the weather forecast, and which never came. So, we were lied to, in order to avoid an excursion." "We were told certain locations were inaccessible due to a sandstorm, which we later discovered was untrue. Many temple visits were rushed, leaving us with little time to absorb the significance of these sacred places."
* "Highlight of trip was to be night inside Great Pyramid where again we were left without guides or guidance and missed Queen and subterranean chambers."
* "The culmination of our trip, a “private” tour of the Great Pyramid, was equally underwhelming. Far from the immersive experience we were promised, we were allotted a mere 30 seconds in the sarcophagus, rushed through what should have been a highlight of the journey." 

'''Hired guides'''
* "The guides were inconsistent and, in the case of the Osireion and Seti I Temple, abandoned the tour entirely. We weren’t even shown some of the most anticipated features at the sites we visited, like the Kings List at the SETI I temple, the Sekhmet statue at Karnak or the Dendera lightbulb at Hathor. We had to resort to Google to learn some basic information about the sites we did visit."
* "Access to tour guides was inconsistent and often we were told to share the videos. We didn’t travel all that way to watch things on a video."
* "The tour guides at Saba tours were the ones who kept talking us through all the sites and explaining important facts etc."
* "Witnessed heated discussions between tour guide and guard at one particular site. Gave me a feeling of being unsafe."

'''Grant as guide'''
* "Grant himself made no effort to give either of the two educational discussions on the itinerary."
* "Robert wasn’t really there for us, he seemed to have a different agenda." 
* "When visiting the temples [Grant] would do no introductory speeches but would just rush of to do his own thing."
* "Apart from an excellent introductory talk, [Grant] was preoccupied with his two girlfriends and some groupies, and very invested in his socialmedia and virtual pass audiences instead of actually being present with the group."
* "Coming back at night he would not let the group in on his findings (you could track this on social media) or give a summary of the day."
* "Multiple promised experiences were either cancelled or significantly altered. For example, we were kicked out of the Saqqara site due to Robert refusing to abide to the Government's order to not give lectures to his group in public. Grant started to talk, a group gathered, and we were immediately told to get back on the bus." 

'''Mathias De Stefano's presentations'''
* "We all went on this trip to Egypt because of our host, Robert Edward Grant and the faculty that was promised including Matias de Stefano." "Matias could only stay for one presentation, and left after the first day." "Another GAIA personality, Mathias de Stefano, was advertised as joining Robert Edward Grant on the trip as an educator. He showed up for the first night’s presentation and then left the tour entirely."

'''Robert E. Grant's presentations'''
* "[Robert] was scheduled to do two talks, but only did one. Robert's one talk was just a meditation and then he passed around a microphone for people to say what they are thankful for."
* "[Grant] himself had promised 2 lectures, neither of which happened. One of them turned out to be a meditation-Koombaya type of gathering."
* "Robert’s Talks: Seemed largely improvised and echoed free online content. Guest Speakers: Came prepared with structured presentations, some even giving out free books. Meanwhile, Robert attempted to sell his own book for $60, which felt out of place given the already hefty trip price." 
* "I expected to learn from him, and despite two lectures from him being on the itinerary, the first was an average meditation following by an open-mic of gratitude, and the second one didn't happen. So basically, we learnt nothing from him. The only people who got anything were his entourage who huddled around him. I came for his brilliant mind, and got nothing."
* "Instead, on one occasion he offered a meditation and allowed participants to pass the microphone to express how grateful they were. In my opinion, he failed as both a host and an educator."
* "Despite promising multiple educational sessions, Grant failed to deliver any meaningful instruction. The single session he conducted consisted merely of a basic meditation and gratitude circle, falling far short of the expert-level educational content that participants had paid for."

'''Grant as a person'''
* "Robert Edward Grant himself conducted himself in less than professional ways."
* "He made it clear that the satisfaction and experience of paying guests were not priorities." 
* "I recognize Robert is extremely intelligent but he lacked self awareness, integrity, and compassion to participates who paid for an experience that they did not receive."
* "Robert Edward Grant, the tour's advertised expert leader, demonstrated shocking unprofessionalism throughout the expedition. Rather than engaging with the 144 paying participants who each invested a significant amount of money each, he remained largely absent, preferring to spend his time with his private entourage. His behavior made it clear that the satisfaction and experience of paying guests were not priorities. Meals, which should have been opportunities for group interaction and learning, were spent with his inner circle while paying participants were left to fend for themselves."
* "Carried out trip promises were sparse and there seemed to be a personal agenda that took precedent over the paying participants getting what they came for."
* "Overall, Robert Edward Grant showed no concern or care for the participants that paid a large price for a once-in-a-lifetime tour." 
* "Perhaps most disappointing was the lack of engagement from you, Mr. Grant, despite your expertise and leadership being the primary reasons we invested in this expedition. We expected a guided, enriching experience exploring the temples and sacred sites of Egypt with you as our leader. Instead, you provided little to no insight before or after our visits, remained aloof with a select inner circle, and left us with standard tours conducted by SABA Tours." 
* "Grant was more interested in his own personal pursuits."
* "Grant made no effort to meet his guests, preferring to surround himself with his loyal entourage. Organizers clearly prioritized a party atmosphere over an educational one."
* "In my opinion, Grant was not at all concerned about participant’s experience, and was only interested in his small young friend group and with being filmed, photographed and posting on social media."
* "On several nights, dinner was pushed to 8:00 or 9:30 pm; one evening, we even had to wait through a Robert Edward Grant talk before being allowed to eat."
* "Rather than stepping up as the leader and teacher we expected, you appeared disengaged, prioritizing what can only be described as a self-indulgent, substance-fueled party atmosphere—behavior you yourself likened to “Burning Man in Egypt.” This was not the expedition we signed up for, and we feel exploited having funded such conduct at our expense."
* "It appeared that most of the problems experienced at various sites had to do with the presence of Grant who displayed little to no cultural sensitivity to our host country and often conducted himself inappropriately."
* "Robert Edward Grant, was unable to separate his business and personal life; his seemingly use of drugs on a tour in a Muslim country, his sexual needs; it was unbelievable to witness."
* "Grant himself was nowhere to be found and we were left to fend for ourselves learning things. He was too busy dressing up, being high on mushrooms, and hanging out with his entourage of girls young enough to be his daughters!! He was unprofessional, unfriendly, unavailable and ARROGANT beyond belief. His ego is completely out of control." 


'''Grant's "leadership"'''
* "Robert did acknowledge the harassment our group experienced from guards because we were with him and he stated at one of the sites that he may have to cancel May trip (3 months away) as a result." 
* "There was no acknowledgment or accountability for the boat choices, understanding a lot of the health issues were from mold, complete lack of education on the sites themselves/his perspective, itinerary change from Mena house to far out St. Regis hotel, cancelled site visits, minimal group activations, general disorganization with the high number of participants etc."
* "When issues were raised, Robert threatened legal action or dismissed them. He came across as a self-absorbed ego maniac who cares for no-one but himself, and his posse of young women. I clocked his behaviour by day two and avoided him as he was there for himself, and not for the paying participants." 
* "After participates reached out to express immediate discomfort after initially boarding boats Robert attempted to shift things around in a group setting in place of an educational talk phrases like “Ask yourself why did you choose this experience?” and spiritual bypassing by doing gratitude exercises instead of facing issues head on"
* "Many attendees kept silent about their ailments, worried about the response. I, however, spoke up about my severe allergic reaction. While some lower-level staff showed concern, no real medical help or acknowledgment of mold was ever offered.
* "Legitimate concerns were met with gaslighting. Grant referred to people being “triggered” by “stupid” things on a Guide’s open mic. He told the group on another occasion that if they were dissatisfied, they should look within themselves for the source of dissatisfaction and ask themselves “why they chose this?”" 
* "Tour leadership was notably absent, with minimal interaction and guidance. When participants raised legitimate concerns, they were met with gaslighting responses like, "Ask yourself why you chose this experience." Professional concerns were consistently dismissed or deflected." 
* "The worst part in retrospect was Robert's use of Spiritual By-Pass (John Welwood, Google it) to shame everyone into not speaking up. Robert said (and wrote on his Instagram) that if participants were unhappy about the botched trip then we needed to look at ourselves and understand why we are triggered and acting from our own wounds." 
* "Neither Saba Tours nor Robert Edward Grant took responsibility, even though they were shown the mold and participants later provided photo evidence"
* "The worst part is that true to the NARCISSIST that he is..he gaslit everyone and shamed us all into silence. He told us that if we feel the trip was not to our satisfaction and messed up then we all need to look within ourselves and ask why we chose this???? Brilliant, isn't it?? Take ZERO responsibility for your actions and deflect it all onto others!! Great Well, we live in the 3D and here on earth there are certain rules asshole. If you advertise a luxury trip and charge an arm and a leg for it then you have a responsibility for delivering what you promised and making sure everyone is safe and healthy on the trip and not getting sick left and right and being completely unacknowledged and left to fend for themselves. I can see that none of us matter to him because he is high up there on his high horse, living the high life and the rest of us peons down here on earth aren't important to him enough to bother himself with. Well, all I can say is that it is a long way down from that fall he will take eventually. He is on a fast-track collision course with the Universe and when Karma comes calling (AND IT WILL!!)and that lightening hits and throws him out of his tower he is not going to know which direction he got hit from!!!!!!!!!!!!!!! The Universe's way of teaching us lessons is really painful and his will be no different. All I see when I look at Robert Grant is a fake, empty, hollow, insecure, egotistical and LOST man who hides behind his over-inflated ego, his money, and his girls young enough to be his daughters!! Robert Grant is a charlatan, a gaslighting Narcissist, a FAKE and a master MANIPULATOR!!!!"  
* "I later heard Robert was given a selection of boats by the Egyptian tour organisers, and chose the cheapest"
* "we later discovered our tour leader had selected the cheapest vessels from eight available options."
* "as the trip organizer when he chose the 2 cheapest boats he was presented with and he chose to host 144 participants without putting proper systems in place that caused many issues"
* "You yourself described the vessels as comprising an “expensive” boat and a “cheap” one, and unfortunately, we were assigned to the latter despite paying the same $30,000 as every other participant"

'''Silencing critique'''
* Some of the 1-star reviews were deleted.
* "Mr. Grant has also been threatening people with lawsuits for respectfully raising concerns with him before ghosting them."
* "[Grant] has failed to take any accountability for any adverse experiences by customers who paid a huge amount of money to go on this trip."
* "What’s more, the February 2025 Egypt 144 AXO trip has been erased from this site."
*  "Robert’s personal reaction was especially disheartening: he referenced a previous lawsuit over mold in which he countersued and won, a statement that felt more like a threat than support. Threat of Abandonment As my condition deteriorated, I requested a refund and assistance getting home. Instead of assistance, I was threatened with immediate removal from the boat in Aswan—no refund, no safe passage. They accused me of “inciting violence,” twisting my background as a U.S. veteran into something it wasn’t. Only when I refused to sign the release form did they offer a taxi & flight back to Cairo and finally a full refund, suggesting liability concerns trumped any genuine concern for a sick attendee."

'''Summarizing statements'''
* "This trip was a huge disappointment and an absolute ripoff"
* "The trip was overpriced"
* "All in all very disappointing. I would not recommend this trip to anyone."
* "I WOULD NOT RECOMMEND A ROBERT EDWARD GRANT TOUR"
* "he's not the right person to be leading tours. He failed to deliver. A positive; the local tour company hired by Robert, called Saba Tours were brilliant, kind and knowledgeable hosts. I WOULD NOT RECOMMEND HIS TOURS TO ANYONE."
* "chaotic, disjointed, and riddled with issues"
* "The trip was chaotic, poorly organized, and every day there were very last minute schedule changes often communicated very late at night. I will avoid and strongly advise others to avoid any event offered by Robert Edward Grant in future."
* "failed on every front to hold up his end of the deal"
* "profound disappointment and dissatisfaction"
* "turned out to be a poorly organized, substandard, and deeply unpleasant trip that failed to deliver on nearly every level." 
* "overpriced, non-luxury Expedition of Discovery in Egypt.
* "OVERPROMISE & UNDER DELIVER is the theme of this trip."
* "In summary, this trip was a disaster from start to finish. It failed to deliver the exclusive, educational, and luxurious experience promised, instead resembling an overpriced, poorly managed tour overshadowed by your apparent narcissism and lack of accountability."
* "Being advertised as an expedition of new discoveries, and not your "normal" tour, at $13,500, I would have expected an amazing, unbelievable, professional expedition; however, in my opinion, that is not what I received, and what I did receive was worth about $6,000." 
* "I don’t recommend this tour to someone in general especially at this price point."
* "I left both physically unwell and emotionally drained by the lack of proper care or accountability from the organizers."
* "Please save yourselves a whole lot of money and emotional heartache and DO NOT TAKE HIS TRIPS. I am sure there are plenty of other great options out there."
* "Given the lofty price tag and the promises made, I can’t recommend attending any future events involving Robert Edward Grant."
* "What was supposed to be a trip of lifetime, turned out to be the DISAPPOINTMENT of a lifetime. OVERPROMISED & UNDERDELIVERED is the understatement of the century!!"
* "Ultimately, trying to navigate an expedition with 144 guests was an overly ambitious undertaking and the execution of this trip was amateurish at best. The schedule was constantly changing. Nothing occurred on time. This should have been the trip of a lifetime. It was certainly the worst “organized” vacation of my lifetime. My recommendation is that anyone considering a trip with Robert Edward Grant should do themselves a favor, and “choose” a different trip."
* "Value Assessment: At more than double the price of comparable tours, this expedition promised luxury but delivered significant disappointments. The premium pricing was not reflected in any aspect of the experience, from accommodations to transportation to expertise. Bottom Line: While Egypt remains a magnificent destination worthy of any traveler's bucket list, this overpriced tour failed to deliver on its premium promises while potentially compromising participants' health. Future travelers would be better served by operators who prioritize customer safety and satisfaction over profit margins. I would not recommend any tours led by Robert Edward Grant."
* "Robert Edward Grant is a charlatan and a master manipulator. DO NOT TAKE THIS TRIP. IT IS A TOTAL RIP OFF." 
* "We have detailed accounts and evidence supporting all of these grievances, should they be required. Given the significant financial investment of $30,000 and the complete misrepresentation of this expedition, we demand a full refund. We urge you to address this matter promptly to avoid further escalation." 

{{collapse end}}

{{collapse|Original Reviews|width=500}}

{{collapse|Review 1 ★★★☆☆|width=500}}
{{cquote|The first hotel was NOTHING like Mena House which was on the original itinerary and one of the reasons I sent an early deposit. The hotel we stayed in was miles away (one and half hour from Cairo) and did feel like arriving in Egypt. More like Las Vegas! \The second boat was very unhealthy because of mould on walls,. People were getting sick. I consider the cost expensive considering how cheap Egypt is. |||Valerie W (Feb. 27, 2025)}}
{{collapse end}}

{{collapse|Review 2 ★☆☆☆☆|width=500}}
{{cquote|This was supposed to be the trip of a lifetime, but what I got was rather disappointing. First, the accommodations: they were supposed to be five star, out of the 11 nights we got two nights in a five star hotel in the center of Cairo, two nights in a four star hotel in the middle of nowhere having to drive one and a half hours into Cairo every time we left for an excursion. And lastly seven nights in a two star, barely three star, old en moldy accommodation; the Nile cruise boat. It was here that a lot of us got sick, heavily coughing and developing respiratory troubles. The group was divided into two, so as to fit on two boats. If you paid for extra luxury accommodation you were put on the barely three star one, if you didn’t go for the extra luxury option - why should you, you already paid for 5 star accommodation- then you were assigned to the two star boat. The schedules were changed so many times, that people got stuck on one boat while talks/presentations were on the other. Chaos was the norm. The program: we all went on this trip to Egypt because of our host, Robert Edward Grant and the faculty that was promised including Matias de Stefano. Matias could only stay for one presentation, and left after the first day. Robert wasn’t really there for us, he seemed to have a different agenda. Apart from an excellent introductory talk, he was preoccupied with his two girlfriends and some groupies, and very invested in his socialmedia and virtual pass audiences instead of actually being present with the group. When visiting the temples he would do no introductory speeches but would just rush of to do his own thing. Coming back at night he would not let the group in on his findings (you could track this on social media) or give a summary of the day. All in all very disappointing. I would not recommend this trip to anyone.|||Petra K (Feb. 24, 2025)}}
{{collapse end}}

{{collapse|Review 3 ★☆☆☆☆|width=500}}
{{cquote|I WOULD NOT RECOMMEND A ROBERT EDWARD GRANT TOUR for many reasons: It was billed (and priced) as a luxury 5-star tour, which it was not. Two nights were at a hotel that was not on the original advertisement - we ended up in a far-away hotel that was clearly not for tourists. It resulted in 3 hour round trip to get Old Cairo, with bus drivers getting lost and driving in circles so new was the "new Capital" where we stayed. Seven nights were on a boat on the River Nile. I had done my due diligence and noted many beautiful boats that were "luxury" so I expected that, given our tour was the priced so highly, and advertised as such. We were put on a sub-standard boat with mould (affecting many participants causing illness), with average food, crammed rooms and old and tired interiors. At best, a 3 star boat. That's fine, but I paid 5-star price. Just about everyone I spoke to was disappointed in this - I am not a stand-alone in this point. I later heard Robert was given a selection of boats by the Egyptian tour organisers, and chose the cheapest. Robert Edward Grant himself conducted himself in less than professional ways. I expected to learn from him, and despite two lectures from him being on the itinerary, the first was an average meditation following by an open-mic of gratitude, and the second one didn't happen. So basically, we learnt nothing from him. The only people who got anything were his entourage who huddled around him. I came for his brilliant mind, and got nothing. Again, just about everyone I spoke to, complained the same. Secondly, Robert Edward Grant, was unable to separate his business and personal life; his seemingly use of drugs on a tour in a Muslim country, his sexual needs; it was unbelievable to witness. Overall, Robert Edward Grant showed no concern or care for the participants that paid a large price for a once-in-a-lifetime tour. He made it clear that the satisfaction and experience of paying guests were not priorities. On top of that, multiple promised experiences were either cancelled or significantly altered. For example, we were kicked out of the Saqqara site due to Robert refusing to abide to the Government's order to not give lectures to his group in public. He started to talk, a group gathered, and we were immediately told to get back on the bus. We never visited Abu Simbel due to a sand storm, which we later found out wasn't in the weather forecast, and which never came. So, we were lied to, in order to avoid an excursion. The tour was incredibly disorganised, as we were rushed through sites, time management was an issue with many collective hours spent on the buses; more than necessary. When issues were raised, Robert threatened legal action or dismissed them. He came across as a self-absorbed ego maniac who cares for no-one but himself, and his posse of young women. I clocked his behaviour by day two and avoided him as he was there for himself, and not for the paying participants. I don't deny his brilliant mind, nor the fact he's on a spiritual journey - but he's not the right person to be leading tours. He failed to deliver. A positive; the local tour company hired by Robert, called Saba Tours were brilliant, kind and knowledgeable hosts. I WOULD NOT RECOMMEND HIS TOURS TO ANYONE.|||Cathrina R (Feb. 16, 2025)}}
{{collapse end}}

{{collapse|Review 4 ★☆☆☆☆|width=500}}
{{cquote|My 1 star review was deleted along with all other bad reviews so posting this again. Mr. Grant has also been threatening people with lawsuits for respectfully raising concerns with him before ghosting them. He has failed to take any accountability for any adverse experiences by customers who paid a huge amount of money to go on this trip. What’s more, the February 2025 Egypt 144 AXO trip has been erased from this site. This was my review of that trip: This trip was a huge disappointment and an absolute ripoff. We were sold an exclusive luxury expedition to Egypt that failed to deliver, was chaotic, disjointed, and riddled with issues. Arrived at St. Regis New Capital hotel in the middle of desert and 1.5 hrs outside Cairo. Drivers kept getting lost because roads were half built and nobody knew their way around. We were only tourists. Second day there Hamas hostage exchange and celebration took place in hotel lobby. 7 nights on old disgusting ship on the Nile that had horrible smell and guests experienced mold-related respiratory problems. I continue to experience coughs and respiratory issues from that exposure. Mattresses were black with mold. Bathrooms filled with mold. That’s what was visible… Many promised site visits were omitted or rushed, including many Pyramids, Abu Simbel, and the Karnak temple. Highlight of trip was to be night inside Great Pyramid where again we were left without guides or guidance and missed Queen and subterranean chambers. Guides were inconsistent, and many key features of visited sites were skipped. There was no discussion or integration and trip host Grant was more interested in his own personal pursuits. On Grant’s whim schedule would change. We were left to wander around on our own at two key sites because Grant decided we should walk in silence without the benefit of tour guides. Access to tour guides was inconsistent and often we were told to share the videos. We didn’t travel all that way to watch things on a video. Educational content and course materials promised were not delivered and presentations cancelled at last minute. It appeared that most of the problems experienced at various sites had to do with the presence of Grant who displayed little to no cultural sensitivity to our host country and often conducted himself inappropriately. In my opinion, Grant was not at all concerned about participant’s experience, and was only interested in his small young friend group and with being filmed, photographed and posting on social media. The trip was chaotic, poorly organized, and every day there were very last minute schedule changes often communicated very late at night. I will avoid and strongly advise others to avoid any event offered by Robert Edward Grant in future.|||Em P (Feb. 25, 2025)}}
{{collapse end}}

{{collapse|Review 5 ("Disaster from start to finish")|width=500}}
{{cquote|Just for reference this review was taken down over the last few days: Here it is again.. I am writing to formally express my profound disappointment and dissatisfaction with the exclusive expedition to explore Egypt and the Great Pyramids, for which my partner and I paid $30,000. What was promised as a transformative, 5-star experience led by you personally turned out to be a poorly organized, substandard, and deeply unpleasant trip that failed to deliver on nearly every level. Consequently, we are requesting a full refund of the $30,000 we paid for this excursion. Our excitement for this adventure quickly dissipated upon arrival. While the SABA Tours team greeted us at the airport, which we initially appreciated, concerns arose almost immediately. We were unexpectedly transported to a hotel in New Cairo—nearly two hours from the Giza Plateau—rather than the more conveniently located St. Regis, which was mere minutes from key sites. This resulted in exhausting daily commutes of four to five hours on a bus, significantly detracting from the experience. The hotel itself, while adequate, was primarily used to house workers building New Cairo and, shockingly, had armed security personnel patrolling the lobby due to terrorist threats—a detail never disclosed to us. This hardly aligned with the luxurious “5-star experience” we were sold. The situation deteriorated further upon boarding the Nile cruise boats. You yourself described the vessels as comprising an “expensive” boat and a “cheap” one, and unfortunately, we were assigned to the latter despite paying the same $30,000 as every other participant. The condition of our boat was deplorable: pervasive mold odors, sewage smells emanating from the bathroom, and an overall state of disrepair forced us to keep our window open for the entire seven-day cruise. This exposed us to cold temperatures, diesel fumes, and even unsolicited interactions with locals attempting to sell items through our window. Sleep became nearly impossible under these conditions, causing us to miss several temple visits and outings—key components of the itinerary we had eagerly anticipated. Perhaps most disappointing was the lack of engagement from you, Mr. Grant, despite your expertise and leadership being the primary reasons we invested in this expedition. We expected a guided, enriching experience exploring the temples and sacred sites of Egypt with you as our leader. Instead, you provided little to no insight before or after our visits, remained aloof with a select inner circle, and left us with standard tours conducted by SABA Tours. While SABA performed admirably, their standard offerings are available for $5,000 to $6,000—a fraction of the $30,000 we paid for what was marketed as an exclusive expedition under your guidance. Further compounding our frustration, the itinerary changed daily with no clear schedule. We were told certain locations were inaccessible due to a sandstorm, which we later discovered was untrue. Many temple visits were rushed, leaving us with little time to absorb the significance of these sacred places. By the time we returned to Cairo, more than half the group—including ourselves—had fallen ill, likely due to mold exposure, poor sleeping conditions, and the overall abysmal quality of the boat. The culmination of our trip, a “private” tour of the Great Pyramid, was equally underwhelming. Far from the immersive experience we were promised, we were allotted a mere 30 seconds in the sarcophagus, rushed through what should have been a highlight of the journey. Rather than stepping up as the leader and teacher we expected, you appeared disengaged, prioritizing what can only be described as a self-indulgent, substance-fueled party atmosphere—behavior you yourself likened to “Burning Man in Egypt.” This was not the expedition we signed up for, and we feel exploited having funded such conduct at our expense. In summary, this trip was a disaster from start to finish. It failed to deliver the exclusive, educational, and luxurious experience promised, instead resembling an overpriced, poorly managed tour overshadowed by your apparent narcissism and lack of accountability. We have detailed accounts and evidence supporting all of these grievances, should they be required. Given the significant financial investment of $30,000 and the complete misrepresentation of this expedition, we demand a full refund. We urge you to address this matter promptly to avoid further escalation. |||Anthony D (Feb. 25, 2025)}}
{{collapse end}}

{{collapse|Review 6 ★☆☆☆☆|width=500}}
{{cquote|Egypt 2025 ΑΧΩ Adventure Expedition with Robert Edward Grant unfortunately missed the mark in just about every category except for attracting an INCREDIBLE group of souls together this is the silver lining, other than that the trip we received was not as advertised on brochure and website. Here is a summary of what was experienced 5 star accommodations were only 4 out of the 11 nights. 7 of them were not appropriate at this price point and frankly not safe due to the severity of mold exposure on mattresses, air ventilation systems, furniture, restrooms etc. My partner and I started experiencing mold exposure symptoms day 2 on boat. We had to have window open 24/7 just to breathe in room while freezing at night sometimes fumes from boat would pour in, super uncomfortable. After participates reached out to express immediate discomfort after initially boarding boats Robert attempted to shift things around in a group setting in place of an educational talk phrases like “Ask yourself why did you choose this experience?” and spiritual bypassing by doing gratitude exercises instead of facing issues head on as the trip organizer when he chose the 2 cheapest boats he was presented with and he chose to host 144 participants without putting proper systems in place that caused many issues. I recognize Robert is extremely intelligent but he lacked self awareness, integrity, and compassion to participates who paid for an experience that they did not receive. We are all on a spiritual journey so I am not judging but he had other priorities on this trip and unfortunately leading this expedition did not appear to be one of them. There was no acknowledgment or accountability for the boat choices, understanding a lot of the health issues were from mold, complete lack of education on the sites themselves/his perspective, itinerary change from Mena house to far out St. Regis hotel, cancelled site visits, minimal group activations, general disorganization with the high number of participants etc. I could go on, trust me we experienced a lot of things that we shouldn’t have. Robert did acknowledge the harassment our group experienced from guards because we were with him and he stated at one of the sites that he may have to cancel May trip (3 months away) as a result. I don’t have ill will towards him but between my partner and I we paid a lot of money for this tour (26k not including flights + extras), the energetic exchange was no where near that ballpark. I don’t recommend this tour to someone in general especially at this price point. As I write this, we’ve been home for 3 days between myself + partner we’ve already spent 1k on IVs, treatments, supplementation etc so this experience is still costing us unfortunately. I feel like I betrayed my body by staying on that moldy boat knowing it was causing me harm but tried to make the best of the scenario, never again.|||Lauren T (Feb. 17, 2025)}}
{{collapse end}}

{{collapse|Review 7 ★☆☆☆☆|width=500}}
{{cquote|What was supposed to be a trip of lifetime, turned out to be the DISAPPOINTMENT of a lifetime. OVERPROMISED & UNDERDELIVERED is the understatement of the century!! Robert Grant advertised this trip as a luxury learning experience and certainly charged for it ($13K) and failed on every front to hold up his end of the deal. We were put up in a hotel far away from everything in new Cairo where even the bus drivers kept getting lost and wasting out time bussing us around to nowhere. The hotel suddenly was filled with Hammas exchange prisoners and we were all feeling very unsafe and unprotected. Then the rest of the trip was spent on sub-standard mold-infested boat that was ugly and most definitely NOT LUXURY at all. Everyone was sick from the mold. When 't someone did finally speak up he was escorted off the ship and wasn't with us for the rest of the trip. Grant himself was nowhere to be found and we were left to fend for ourselves learning things. He was too busy dressing up, being high on mushrooms, and hanging out with his entourage of girls young enough to be his daughters!! He was unprofessional, unfriendly, unavailable and ARROGANT beyond belief. His ego is completely out of control. The itinerary kept changing every second and the communication was poor so none of us had any idea what was going on. Most of the important sites and private visits where not upheld and we were rushed through everything. It took long times to get to sites by bus and then we'd spend a half hour-max an hour if lucky and never learned anything from him. The tour guides at Saba tours were the ones who kept talking us through all the sites and explaining important facts etc. There were no important faculties as promised. We didn't get the benefit of learning anything from anyone of the important people he had promised would be there and lectures etc. He himself had promised 2 lectures, neither of which happened. One of them turned out to be a meditation-Koombaya type of gathering. The worst part is that true to the NARCISSIST that he is..he gaslit everyone and shamed us all into silence. He told us that if we feel the trip was not to our satisfaction and messed up then we all need to look within ourselves and ask why we chose this???? Brilliant, isn't it?? Take ZERO responsibility for your actions and deflect it all onto others!! Great Well, we live in the 3D and here on earth there are certain rules asshole. If you advertise a luxury trip and charge an arm and a leg for it then you have a responsibility for delivering what you promised and making sure everyone is safe and healthy on the trip and not getting sick left and right and being completely unacknowledged and left to fend for themselves. I can see that none of us matter to him because he is high up there on his high horse, living the high life and the rest of us peons down here on earth aren't important to him enough to bother himself with. Well, all I can say is that it is a long way down from that fall he will take eventually. He is on a fast-track collision course with the Universe and when Karma comes calling (AND IT WILL!!)and that lightening hits and throws him out of his tower he is not going to know which direction he got hit from!!!!!!!!!!!!!!! The Universe's way of teaching us lessons is really painful and his will be no different. All I see when I look at Robert Grant is a fake, empty, hollow, insecure, egotistical and LOST man who hides behind his over-inflated ego, his money, and his girls young enough to be his daughters!! Robert Grant is a charlatan, a gaslighting Narcissist, a FAKE and a master MANIPULATOR!!!! Please save yourselves a whole lot of money and emotional heartache and DO NOT TAKE HIS TRIPS. I am sure there are plenty of other great options out there.|||Maryam A (Feb. 17, 2025)}}
{{collapse end}}

{{collapse|Review 8 ★☆☆☆☆|width=500}}
{{cquote|I want to share a detailed, chronological account of why this trip with Robert Edward Grant—costing $12,000-$14,000—fell far short of expectations. Everything described here is based on my own observations, evidence, and conversations with other attendees who seemed to have similar concerns. Pre-Trip Logistics and Arrival Communication via Telegram Before the trip even began, the organizers relied on a single Telegram group to coordinate with around 144 guests. This quickly became cumbersome, as crucial updates got buried under constant chatter. Midway through, they attempted to split it into smaller groups, but the confusion was never fully resolved. Transport to the St. Regis Upon landing, many of us had drivers arranged to take us to the St. Regis hotel, which is situated in a largely undeveloped city roughly two hours from the main areas. Several drivers got lost—circling around and making guests uneasy, especially in a foreign country where we couldn’t navigate ourselves. This made for a stressful and ominous start to a supposedly “luxury” trip. The St. Regis Experience Initial Impressions & Safety Concerns Stepping into the lobby, we immediately noticed numerous men who didn’t seem to be typical hotel guests or staff, lingering around and staring. Many women in our group felt unsafe and asked male attendees to walk them to their rooms. Rooms themselves were standard unless one had Marriott Bonvoy status for an upgrade. None of this, however, resembled the top-tier luxury we were led to expect given the steep cost of the trip. Discovery of Potentially Dangerous Individuals During our stay, we saw an unusual presence of individuals who appeared out of place. Later, it emerged through various news outlets that a prisoner exchange involving terrorists and hostages was taking place in the region. Photographs we’d taken at the St. Regis matched images of men believed to be former terrorists released in the exchange. Realizing we were in close quarters with potentially dangerous individuals heightened our concern for personal safety. Departure from the Hotel On the morning of departure, instead of the decent breakfast buffet we’d experienced earlier, we were handed a box mostly filled with bread, a single thin slice of cold-cut meat, a banana, and a bottle of water. This felt like a cheap shortcut—far from the high-end service you’d expect for a $12,000-$14,000 package. Transfer to the Boats & First Impressions Bus Ride & Arrival at the Cruise Area Next, we took buses to the cruise boats. The organizers visibly struggled with managing so many people. Upon arriving at the dock, it was clear our boats were noticeably older than others nearby. Condition of the Boats Inside, everything felt dated—one boat in particular featured worn-out, retro-style carpeting. From the get-go, this was nowhere near the “luxury cruise” we anticipated. Many of us were disappointed with the basic, sometimes musty-smelling cabins. Mold Discovery and Health Issues Confirmed Mold in Multiple Rooms Not long after boarding, attendees (myself included) started experiencing symptoms like itchy throats, headaches, dizziness, and nausea. My condition escalated to fever, vomiting, and severe skin reactions (hives, blister-like bumps). Investigating further, I found visible mold in several cabins, including mine—on AC vents, in bathrooms, and under mattresses. I took photos and videos, and checked friends’ cabins where I observed the same issue. Replacement rooms I was offered also had mold, confirming it was widespread, not isolated. Staff Response Although the boat staff tried wiping down accessible areas and re-caulking sinks, mold remained deep in vents and walls. A persistent sewage odor in many bathrooms indicated deeper sanitation problems. Disturbingly, no one in charge properly acknowledged the mold issue or its potential health consequences, despite multiple guests showing symptoms. Schedule, Content & Meal Arrangements Constant Schedule Changes The itinerary—covering tours, talks, and meals—was circulated via a Canva link on Telegram. With poor internet unless you paid for onboard Wi-Fi or had an international plan, people often missed updates, resulting in late arrivals. On several nights, dinner was pushed to 8:00 or 9:30 pm; one evening, we even had to wait through a Robert Edward Grant talk before being allowed to eat. Presentations Robert’s Talks: Seemed largely improvised and echoed free online content. Guest Speakers: Came prepared with structured presentations, some even giving out free books. Meanwhile, Robert attempted to sell his own book for $60, which felt out of place given the already hefty trip price. Onboard Meals Meals were buffet-style—not bad in quality but definitely not luxurious. Adding to the annoyance was the requirement to sign for water or juice each time, though Robert later stated he’d cover non-alcoholic drinks. Still, it was an inconvenient system for a supposedly upscale experience. Customer Service & Courtesy Lack of Genuine Support Many attendees kept silent about their ailments, worried about the response. I, however, spoke up about my severe allergic reaction. While some lower-level staff showed concern, no real medical help or acknowledgment of mold was ever offered. Robert’s personal reaction was especially disheartening: he referenced a previous lawsuit over mold in which he countersued and won, a statement that felt more like a threat than support. Threat of Abandonment As my condition deteriorated, I requested a refund and assistance getting home. Instead of assistance, I was threatened with immediate removal from the boat in Aswan—no refund, no safe passage. They accused me of “inciting violence,” twisting my background as a U.S. veteran into something it wasn’t. Only when I refused to sign the release form did they offer a taxi & flight back to Cairo and finally a full refund, suggesting liability concerns trumped any genuine concern for a sick attendee. Final Thoughts & Overall Disappointment From the unsettling atmosphere at the St. Regis—where we inadvertently stayed alongside individuals tied to a terrorist exchange—to the confirmed mold on deteriorating cruise ships, coupled with chaotic scheduling and dismissive customer service, this trip was a far cry from the $12,000-$14,000 “luxury” experience advertised. I left both physically unwell and emotionally drained by the lack of proper care or accountability from the organizers. Given the lofty price tag and the promises made, I can’t recommend attending any future events involving Robert Edward Grant.|||Osiris S (Feb. 16, 2025)}}
{{collapse end}}

{{collapse|Review 9 ★☆☆☆☆|width=500}}
{{cquote|This was advertised as a luxury expedition that was to include several specific sites and several “educational” lectures. Unfortunately, the magic of Egypt’s historical wonders was overshadowed by health concerns and disorganization. *** Health & Safety Concerns with Accommodations *** The trip was indeed bookended with two luxury hotel chains, including the St. Regis New Capital (Almasa) on the front end and the Four Seasons Cairo on the back end. But the massive, 90 acre St. Regis New Capital is located far outside of Cairo and was nearly empty except for our tour group. This created an eerie, abandoned feel. Then we were joined at the hotel by dozens of Hamas prisoners newly released from Israeli prisons in exchange for 3 Israelis who were taken hostage on October 7. What started out eerie became downright scary. Things got worse from there. We boarded two boats for a 7 day Nile Cruise. Many people complained of mold. I developed an acute respiratory infection (which one of Grant’s people tried to treat me for). On the last day of the cruise, the staff started placing mattresses in the hallway. I took photos of what looks like filth on the mattresses. I await the results of a mold allergy blood test that I paid for the day after returning to the States. *** Constant Itinerary Changes and Omitted Site Visits *** Not all of the site visits that were shown in the itineraries were actually provided. For example, the pre-trip itinerary showed we would have private visits into all 3 pyramids on the Giza Plateau – but instead we were only brought inside one of the three. A half day site visit to Abu Simbel was wiped off the itinerary with an unsubstantiated claim that a sand storm prohibited it. The Ramesseum and the Bent Pyramid were also wiped off the itinerary. A pre-trip itinerary showed a whole morning scheduled for the temple of Karnak, followed by a dinner party at Karnak temple that evening. Instead, we were rushed out of Karnak to a jewelry market after only 1.5 hours. This shorted us on one of the largest and most important temples on the itinerary - without even seeing the features it is famous for. The guides were inconsistent and, in the case of the Osireion and Seti I Temple, abandoned the tour entirely. We weren’t even shown some of the most anticipated features at the sites we visited, like the Kings List at the SETI I temple, the Sekhmet statue at Karnak or the Dendera lightbulb at Hathor. We had to resort to Google to learn some basic information about the sites we did visit. *** The Host’s Conduct and Lack of “Education” *** Another GAIA personality, Mathias de Stefano, was advertised as joining Robert Edward Grant on the trip as an educator. He showed up for the first night’s presentation and then left the tour entirely. Grant himself made no effort to give either of the two educational discussions on the itinerary. Instead, on one occasion he offered a meditation and allowed participants to pass the microphone to express how grateful they were. In my opinion, he failed as both a host and an educator. Grant made no effort to meet his guests, preferring to surround himself with his loyal entourage. Organizers clearly prioritized a party atmosphere over an educational one. Legitimate concerns were met with gaslighting. Grant referred to people being “triggered” by “stupid” things on a Guide’s open mic. He told the group on another occasion that if they were dissatisfied, they should look within themselves for the source of dissatisfaction and ask themselves “why they chose this?” Ultimately, trying to navigate an expedition with 144 guests was an overly ambitious undertaking and the execution of this trip was amateurish at best. The schedule was constantly changing. Nothing occurred on time. This should have been the trip of a lifetime. It was certainly the worst “organized” vacation of my lifetime. My recommendation is that anyone considering a trip with Robert Edward Grant should do themselves a favor, and “choose” a different trip.|||Amanda S (Feb. 16, 2025)}}
{{collapse end}}

{{collapse|Review 10 ★☆☆☆☆|width=500}}
{{cquote|Review of an overpriced, non-luxury Expedition of Discovery in Egypt. Being advertised as an expedition of new discoveries, and not your "normal" tour, at $13,500, I would have expected an amazing, unbelievable, professional expedition; however, in my opinion, that is not what I received, and what I did receive was worth about $6,000. The history and historical sites are amazing. Saba Tours had to be called to confirm pick up at the airport. Seems they always had an excuse for running late or things not going as planned. Had stressful flight from Cairo to Luxor. Presentations were rescheduled or not held on a whim's notice. Site visits were changed without legitimate justification and when they did take place, it was hurried. Private visits were disappointing. Witnessed heated discussions between tour guide and guard at one particular site. Gave me a feeling of being unsafe. There was lack of communication about what to expect, how to proceed, and coordination of timelines and events. Many people got sick on this trip which was completely unacceptable. Events that were to be sacred, turned into disasters. Carried out trip promises were sparse and there seemed to be a personal agenda that took precedent over the paying participants getting what they came for. I would not recommend Saba Tours or any event led by Robert Edward Grant.|||Diane D (Feb. 25, 2025)}}
{{collapse end}}

{{collapse|Review 11 ★☆☆☆☆|width=500}}
{{cquote|Premium Egypt Tour Turns Nightmare: Broken Promises and Health Hazards The Good: The magnificence of Egypt's historical sites and monuments shone through despite the tour's shortcomings. The ancient locations themselves provided memorable moments, though often rushed. The Significant Issues: Health & Safety - Our Nile cruise boat harbored serious mold problems that caused illness among multiple participants. Medical staff dismissed these health concerns, and we later discovered our tour leader had selected the cheapest vessels from eight available options. The Host's Conduct - Robert Edward Grant, the tour's advertised expert leader, demonstrated shocking unprofessionalism throughout the expedition. Rather than engaging with the 144 paying participants who each invested a significant amount of money each, he remained largely absent, preferring to spend his time with his private entourage. His behavior made it clear that the satisfaction and experience of paying guests were not priorities. Meals, which should have been opportunities for group interaction and learning, were spent with his inner circle while paying participants were left to fend for themselves. Despite promising multiple educational sessions, Grant failed to deliver any meaningful instruction. The single session he conducted consisted merely of a basic meditation and gratitude circle, falling far short of the expert-level educational content that participants had paid for. Accommodation & Organization - The last-minute switch to a remote hotel location meant exhausting three-hour bus rides to reach sites. Constant itinerary changes and poor communication left us frequently confused about schedules. The promised educational content was sparse, with presentations either canceled or lacking substance. Leadership - Tour leadership was notably absent, with minimal interaction and guidance. When participants raised legitimate concerns, they were met with gaslighting responses like, "Ask yourself why you chose this experience." Professional concerns were consistently dismissed or deflected. Value Assessment: At more than double the price of comparable tours, this expedition promised luxury but delivered significant disappointments. The premium pricing was not reflected in any aspect of the experience, from accommodations to transportation to expertise. Bottom Line: While Egypt remains a magnificent destination worthy of any traveler's bucket list, this overpriced tour failed to deliver on its premium promises while potentially compromising participants' health. Future travelers would be better served by operators who prioritize customer safety and satisfaction over profit margins. I would not recommend any tours led by Robert Edward Grant.|||Jeannie G (Feb. 15, 2025)}}
{{collapse end}}

{{collapse|Review 12 ★☆☆☆☆|width=500}}
{{cquote|OVERPROMISE & UNDER DELIVER is the theme of this trip. I paid 13.5K for a luxury experience. I was put on a moldy boat where myself and tens of other people got very, very sick. When one participant pointed out the mold on the boat to organizers, this person was refunded and "agreed" to leave the boat. The rest of us suffered. Neither Saba Tours nor Robert Edward Grant took responsibility, even though they were shown the mold and participants later provided photo evidence. Robert Edward Grant also made up a false story about a dust storm in order to cancel an outing to Abu Simbel. There was, in reality, NO weather travel advisory from the Egyptian Authority preventing tourist travel by bus. Things went downhill from there, culminating in the last night in Cairo. The Expedition promised to have private visits in all 3 Giza pyramids. Only 1 pyramid was open, and participants were rushed into and out of the King's Chamber in groups of 40. Robert was largely absent as a guide. He was scheduled to do two talks, but only did one. Robert's one talk was just a meditation and then he passed around a microphone for people to say what they are thankful for. The worst part in retrospect was Robert's use of Spiritual By-Pass (John Welwood, Google it) to shame everyone into not speaking up. Robert said (and wrote on his Instagram) that if participants were unhappy about the botched trip then we needed to look at ourselves and understand why we are triggered and acting from our own wounds. Robert Edward Grant is a charlatan and a master manipulator. DO NOT TAKE THIS TRIP. IT IS A TOTAL RIP OFF. |||Allison C (Feb. 25, 2025)}}
{{collapse end}}
{{collapse end}}

'''The expose:''' During the spring 2025, the scammed expedition participants documented the incident on their website:

* [https://144axoreality.com/ Front page] ([https://archive.ph/mZQ2I Archived copy])
* [https://144axoreality.com/refund-requests-dispute-of-charges/ Refund requests & dispute of charges] ([https://archive.ph/mwSHD Archived copy])
* [https://144axoreality.com/gallery/ Gallery] ([https://archive.ph/l7riK Archived copy])
* [https://144axoreality.com/contact/ Contact page] ([https://archive.ph/fFsuL Archived copy])

Screenshots from the gallery showing—

<gallery>
File:144 axo standard of care.png|The moldy mattresses the participants had to sleep on.
File:144 axo physical effects.png|The skin conditions caused by the living conditions on the Nile river boat.
</gallery>


====Spiritual crankery====

Grant's spiritual bullshit was laughed out by Dave Farina (Professor Dave) in November 2025.

{{collapse|Reacting to Quantum Mystic "Higher Frequency" Self-Help Rubbish|width=1200}}
{{video|youtube|BD1KHgpHEbA}}
{{collapse end}}


'''Conclusion'''

Grant's career trajectory, marked by his terminations from several companies, as well as alleged patent trolling, investment fraud, and sexual harassment, starkly contrasts with the story dressed as humor, that he told at the TIMEAI pre-party, about exiting the industry because he "''couldn't be evil anymore''".<ref name='blackhat_pre_party'/> 

None of Grant's education, or earlier work has any intersection with cryptography.

=== Talal Ghannam ===

'''Formal education'''

Ghannam's 2003 Master's thesis from Western Michigan University was about "''Optical Solitons in a Three-State Medium''".<ref>Ghannam, Talal (June 2003). [https://web.archive.org/web/20210518130527/https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=5310&context=masters_theses "Optical Solitons in a Three-State Medium"]. Archived from [https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=5310&context=masters_theses scholarworks.wmich.edu] on May 18, 2021.</ref> Ghannam's 2007 PhD dissertation was about "''Quantum Properties of Light Emitted by Dipole Nano-Laser''".<ref>Ghannam, Talal (December 2007). [https://web.archive.org/web/20200322103057/https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=1868&context=dissertations "Quantum Properties of Light Emitted by Dipole Nano-Laser"]. Archived from [https://scholarworks.wmich.edu/cgi/viewcontent.cgi?article=1868&context=dissertations scholarworks.wmich.edu] on March 22, 2020.</ref>

In addition to the dissertation, Ghannam has ten other publications.<ref>ResearchGate (Accessed March 7, 2024). [https://www.researchgate.net/profile/Talal-Ghannam "Talal Ghannam"]. Via researchgate.com.</ref> Unfortunately for Crown Sterling, it's all in the field of physics. The only use his degree would have been for the company was to teach about the process of academic publishing. Instead, his degree was abused to gain upload rights to ArXiv's preprint server.

'''Crank publications'''

Considering his reputable academic background, Ghannam has seriously sold out: In 2012 he self-published a crank book titled "''The Mystery of Numbers: Revealed through their Digital Root''",<ref>{{cite book |last=Ghannam |first=Talal |date=2012 |title=The Mystery of Numbers: Revealed through their Digital Root |url=https://books.google.com/books?id=s_s6DwAAQBAJ&printsec=frontcover |publisher= ‎ CreateSpace Independent Publishing Platform |page=476 |isbn=978-1477678411}}</ref> and later, in 2021, another of the same sort, titled "''GeoNumeronomy: Unraveling the universe through numbers and forms''".<ref>{{cite book |last=Ghannam |first=Talal |date=June 29, 2021 |title=GeoNumeronomy: Unraveling the universe through numbers and forms |publisher=Independently published |page=374 |isbn=979-8527330397}}</ref> Ghannam has also co-authored with Grant the book Philomath.<ref name='philomath'/>

'''False credentials'''

Despite the lack of any degree or research in mathematics, Ghannam has been claimed by Crown Sterling to be a number theorist.<ref name='prnw_spirals'>Crown Sterling (Nov. 9, 2023). [https://web.archive.org/web/20211109185134/https://www.prnewswire.com/news-releases/crown-sterling-limited-llc-founder-publishes-novel-geometric-model-of-natural-spirals-301419951.html "Crown Sterling Limited LLC Founder Publishes Novel Geometric Model of Natural Spirals"]. Archived from [https://www.prnewswire.com/news-releases/crown-sterling-limited-llc-founder-publishes-novel-geometric-model-of-natural-spirals-301419951.html prnewswire.com] on Nov. 9, 2021.</ref>

'''The exit'''

According to Ghannam's LinkedIn, he left Crown Sterling in June 2024, and is now working as an Independent auditor at CGIAR.<ref>LinkedIn (Nov. 2025) [https://ca.linkedin.com/in/talal-ghannam-a655904 "Talal Ghannam"]. Via linkedin.com.</ref>

=== Alan Green ===

On his archived website,<ref name='green_biography_2020'>[https://web.archive.org/web/20201111231141/https://tobeornottobe.org/biography/ "Alan Green, Biography"]. Archived from [https://tobeornottobe.org/biography/ tobeornottobe.org] on Nov. 11, 2020.</ref> Green explains his background:

{{cquote|Alan is a British-born, classically trained pianist, composer, author, educator, and Shakespeare Authorship scholar.

He was musical director for Davy Jones of the 60’s pop group, The Monkees, for twelve years and co-author with Jones of two best-selling, award-winning books, ''They Made A Monkee Out Of Me'' and ''Mutant Monkees''.|||Alan Green, biography (2020)<ref name='green_biography_2020'/>}}

'''Grant meets crank'''

Following his career in the music industry, Green began in 2004 his crank work of "''deciphering codes hidden within Shakespeare's works, which finally solves history's most persistent cover-up.''"<ref>[https://web.archive.org/web/20231205221125/https://tobeornottobe.org/biography/ "Alan Green, Biography"]. Archived from [https://tobeornottobe.org/biography/ tobeornottobe.org] on Dec. 5, 2023.</ref> His YouTube videos, among other things, tie the crank decodings of Shakespeare's sonnets to the Great Pyramid of Giza:<ref>Green, Alan (Bard Code) (July 20, 2020). [https://www.youtube.com/watch?v=OitH3UOX0ZQ "Pyramid Structure of the Sonnets"] Via YouTube.</ref> a novel form of pyramidology.

While Green was interviewing Grant on Dec 1, 2020,<ref>Green, Alan (Bard Code) (Dec. 1, 2020). [https://www.youtube.com/watch?v=a0L2V1Vmo7w "Bardcast™ 8 - special guest Robert Edward Grant"]. Via YouTube</ref> Grant said he had been a follower of Green's work, and that in 2017 he had stumbled on Green's 2016 CPAK<ref group=note>CPAK, or Conference on Precession and Ancient Knowledge is a conference that offers a buffet of cranks doing presentations and book signing, all for the low low price of $399.</ref> presentation, where Green explained how he had through trial and error stumbled upon approximations of mathematical constants in his measurements of the Great Pyramid of Giza. Coincidentally, Grant, in his infinite wisdom, had realized that יהוה, the Tetragrammaton (Hebrew block script for Yahweh) from 840 BCE, can be interpreted as mathematical syntax: ו and י can be interpreted as '''7''' and '''⁷''' respectively, and ה as '''π'''.

All one has to do is squint their eyes enough, and ignore the entire relevant history of the Hebrew alphabet and Western Arabic numerals:

# The letter ה, or {{wpl|He_(letter)|He|,}} evolved from the Egyptian hieroglyphs representing the words ''thread'', ''jubilation'', and ''court'', which look nothing like the Greek letter π.
# The letter ו, or {{wpl|Waw_(letter)|Waw|,}} evolved from the Egyptian hieroglyph representing the word ''mace'' which looks nothing like 7. 
# Similarly, י, or {{wpl|Yodh|Yodh|,}} evolved from the {{wpl|Proto-Sinaitic_script|Proto-Sinaitic script}} for the word ''hand'' that also looks nothing like 7. 
# The {{wpl|Arabic_numerals|Western Arabic numerals}} didn't precede {{wpl|Al-Khwarizmi|Al-Khwarizmi|'s}} book "''On the Calculation with Hindu Numerals''", which wasn't written until 825CE.
# The {{wpl|Greek_alphabet|Greek alphabet}} that contains '''π''' didn't exist until 9th century BCE, and '''π''' wasn't used to denote the mathematical constant until the mathematician {{wpl|William_Jones_(mathematician)|Willian Jones}} decided to do so in 1706.

One should also completely ignore that the Hebrew language has its own ancient cultural practice of assigning numbers to words called {{wpl|Gematria|Gematria|,}} where
* Waw (ו) is associated with the number '''6''' (not '''7'''),
* Yodh (י) is associated with the number '''10''' (not '''7'''), and
* He (ה) is associated with the number '''5''', not '''3.14159265358979323846…'''

But Grant put his expertise on history of ancient cultures and numerology to good use, ignored all that, and decided יהוה was the equation '''π7π⁷'''. After realizing '''π7π⁷ = 7π⁸ ≈ 66419.717''' doesn't really mean anything, he then through trial and error figured out that '''π⁷ / π7 ≈ 137.34131''', which to numerologists, who love to adjust precision as needed, was exactly the same as the {{wpl|Golden_angle|golden angle|,}} '''180⋅(3−√(5)) ≈ 137.50776'''.<ref group=note>Unfortunately Grant missed the precise value of the golden ratio is of the form '''A⋅(B − √(C))''', where A=180 is the highest score one can achieve with three darts, B=3 which is the number of letters in "CIA", and C=5 is the number of Twilight movies. Yes. It's all connected.</ref>

Grant then reached out and called Green, who pretended to be very busy, and after Grant had explained the Tetragrammaton crankery, Green said he had figured out, that in {{wpl|Great_Pyramid_of_Giza|the Great Pyramid of Giza|,}} the ratio between the volume of the {{wpl|Great_Pyramid_of_Giza#King's_Chamber|King's chamber|,}} and its sarcophagus was also '''137.5'''.

Green's discovery be easily seen from the respective dimensions of the King's chamber '''10.5m ✕ 5.2m ✕ 5.8m = 316.68 m³''',<ref>{{cite book |last=Lehner |first=Mark |date=1997 |title=The Complete Pyramids |url=https://archive.org/details/completepyramids0000lehn |publisher=Thames & Hudson |location=London |page=112 |isbn=0-500-05084-8}}</ref> and the dimensions of the granite sarcophagus '''0.987m ✕ 1.051m ✕ 2.276m = 2.361m³'''.<ref>Löhner, Franz; Zuberbühler, Teresa (2006). [https://web.archive.org/web/20201202022806/https://www.cheops-pyramide.ch/khufu-pyramid/print/cheops-great-pyramid.html "The Great Pyramid of Khufu (Cheops)"]. Archived from [https://www.cheops-pyramide.ch/khufu-pyramid/print/cheops-great-pyramid.html cheops-pyramide.ch] on Dec. 2. 2020.</ref> Together these two give the ratio of '''316.68m³ / 2.361m³''' <nowiki>=</nowiki> '''134.130''' which again, to the numerologists was exactly the same as the value Grant came up with, '''137.341'''. All you need is enough rounding. Alas, '''137''' rounds up to '''140''' and '''134''' down to '''130''', but on a positive note, both values round down to an even '''100''', which happens to be the number of Dalmatians acquired by the Radcliffes, plus an [https://www.youtube.com/watch?v=XTogkV5Pp20&t=82s offset factor].

Considering the shared ability to ignore mathematical precision, historical accuracy, sense of chronology, the concept of {{wpl|Apophenia|apophenia|,}} and the shared understanding there's easy money to be made from gullible pyramidologists even with trivially falsifiable claims, it is no surprise the two saw eye-to-eye, and agreed they should meet.


'''Crank in command'''

Later in the video, Green brought out his expertise by explaining how the Diffie-Hellman key exchange works:

{{cquote|

And it reminds me of when Diffie and Hellman got together, in what was it, '67, '76, '77, and the Diffie-Hellman algorithm, which ultimately then became, you know, RSA, that was a breakthrough. It could easily be described, in a nutshell you know. Bob wants to talk to Alice, but Eve is always going to be listening. How do you do a public key distribution, how do you send a key across when it can be intercepted. And so, he{{sic}} figured out, '''using, you know, high prime numbers, it's like mixing two cans of paint'''. Take a red and a yellow, mix them together. It's easy to mix them together, but it's almost impossible to separate them, right.

|||Alan Green<ref>Green, Alan (Bard Code) (Dec. 1, 2020). [https://youtu.be/a0L2V1Vmo7w?si=L7Z9rebm0ur6FE37&t=12481 "Bardcast™ 8 - special guest Robert Edward Grant"]. Via YouTube</ref>}}

Thinking Diffie-Hellman revolves around multiple large prime numbers shows Green can not tell RSA and Diffie-Hellman apart. So, naturally, Crown Sterling positioned Green as the "Director of Cryptography".<ref>Gallagher, Sean (Aug. 29, 2019). [https://arstechnica.com/information-technology/2019/08/snake-oil-or-genius-crown-sterling-tells-its-side-of-black-hat-controversy/ "Snake oil or genius? Crown Sterling tells its side of Black Hat controversy"]. Via arstechnica.com.</ref> Green's background was ridiculed on Twitter, the day after BlackHat 2019.<ref>Margaritelli, Simone (Aug. 9, 2019). [https://archive.ph/R6Dtu "HOW DARE YOU MAKE FUN OF THEM!! Don't you know that their Director of Cryptography "dedicated the last fifteen years to decrypting mathematical codes in Shakespeare’s writings that have revealed unknown sacred geometry hidden in the pyramids of Giza" FOR F SAKE?! BOW, NOW."]. Archived from [https://twitter.com/evilsocket/status/1159866313592004608 twitter.com] on March 7, 2024.</ref>

Despite his position, Green never contributed to a single preprint or PDF self-published by the company, and he has stayed relatively far back from the public eye of the company.

=== Amanda Kennedy ===

Amanda Kennedy popped up with Crown Sterling's PR Newswire article<ref name='prnw_spirals'/> that announced another crank preprint on ArXiv,<ref name='spirals'>Grant, Robert E.; Ghannam, Talal; Kennedy, Amanda (March 20, 2019). [https://arxiv.org/abs/2111.02895v1 "A Novel Geometric Model of Natural Spirals Based on Right Triangle Polygonal Modular Formations"]. Via [[ArXiv]].</ref> this time about spirals, and with no mention of cryptography.

As per her LinkedIn, she joined the company as a summer intern in June 2021 and was promoted a researcher two months later. Apart from the preprint, Kennedy stayed in the background throughout her employment. 

Lucky for her, she left the company in April 2023 and she has since found a job at Aerojet Rocketdyne, that matches her formal education (aerospace engineering and rocketry) from University of Central Florida (UCF).

=== Naomi Mathew ===

Naomi Mathew has, as per her LinkedIn,<ref>Linkedin (Accessed March 7, 2024). [https://www.linkedin.com/in/naomimathew "Linkedin, Naomi Mathew"]. Via linkedin.com</ref> a BA in mathematics from the University of California, Riverside (UCR). Being an undergraduate is nothing to sneeze at: from the looks of it, she's apparently the only one in the company who has a formal degree in mathematics.

She joined Crown Sterling in March 2021, and according to her LinkedIn, her degree has been put to good use. She has since co-authored the crank paper ''sum-product conjecture'',<ref name='sum_product_conjecture'/> and she has also
*Built a high-precision calculator<ref>Mathew, Naomi (March 2024). [https://www.youtube.com/watch?v=G0lIgX2A0dw "POLYMATH Calculator Integrates Arithmetic, Geometry, Music & Cosmology: The Quadrivium"]. Via [[Youtube]].</ref> with several features, such as graphing/geometry, right triangle calculator, and access to several math/physics constants,
*Built other applications to help support current math research on a wide variety of topics such as geometry and prime numbers, and
*Documented proprietary research to present to patent attorneys.

=== Conclusion ===

None of the people who work, or who have worked for the company have a degree that involves cryptography. Given the company's abysmal reputation, and lack of evidence that any cryptographer has ever worked for them, or with them, it's clear the company and its staff are just winging it while flying low — near the cryptocurrency industry, that has way too little oversight and way too many cranks for anyone to pay attention.

== Editorial note to the scam victims ==

Just because you pay for the product, doesn't mean you're not the product. E.g., you pay for Spotify, yet it spies on you.<ref>Beres, Derek (Feb. 20, 2019). [https://archive.ph/JLB1p  "How Spotify manipulates your emotions and sells your data"]. Archived from [https://bigthink.com/the-present/is-spotify-spying-on-you/ bigthink.com] on Feb 2. 2024.</ref>

In contrast, the entire open source initiative<ref>Open source initiative. [https://opensource.org/ "Open source initiative"]. Via opensource.org</ref> and {{wpl|Free software}} movement (free as in [[freedom]]), and their creations such as the {{wpl|Linux|Linux operating system|,}} or most of what's listed on e.g. [https://www.privacyguides.org/en/tools/ privacyguides.org], is living proof that privacy respecting non-snake-oil applications don't always cost money. The fact Grant isn't a proponent of open-source systems and transparent security is also quite telling: he doesn't want his marks to know about things that would force him to walk the talk.

In fact, the sheer number of lies told by the company and its CEO, are aching to the concept of telling a {{wpl|Big_lie|big lie|:}} It is hard to believe someone would have the impudence to distort the truth to this extent.

If you choose to stay in this roach motel because you're craving for the community and validation for your numerologist/New-Age views in the [[personality cult]] that is REG, sure, be our guest. If you're just cashing in with the line-go-up-distributed [[Ponzi scheme]] that is (W)CSOV, feel free to stay and gamble. It's your money.

But if you somehow wandered into the group looking for data sovereignty, or how non-grifters call it, privacy tech, such as secure communication, run. See [https://www.securemessagingapps.com/ securemessagingapps.com] for real alternatives to Orion, join [[Reddit]]'s [https://www.reddit.com/r/privacy /r/privacy] community or [https://discuss.privacyguides.net/ PrivacyGuides forum] for proper peer support. 

The movement against {{wpl|surveillance capitalism}} has been actively fought by people since the {{wpl|Cypherpunk|cypherpunks}} initiated it in 1992. The real privacy community isn't filled with people with business degrees pretending they're da Vinci, Indiana Jones, and a professional cryptographer at the same time. It has people with Ph. D.s in computer science and mathematics, with a focus on cryptography, working hard in businesses and during their free time to make the world a less dangerous place, every day.

==In summary==
{{cquote|Crown Sterling is complete and utter snake oil.[…]

None of [the people who work for Crown Sterling] have demonstrated any cryptographic credentials. 

No papers, no research, no nothing. (And, no, self-publishing doesn’t count.)[…]

Run away. Run, far, far, away.
|||Bruce Schneier<ref name="doghouse"/>}}

==External links==
*[https://www.crownsterling.io/ Crown Sterling]

==Notes==
{{reflist|group=note}}

==Equations==
The links to equations here allow for easy verification of the results obtained via the presented formulae.

{{Reflist|group=equation|2|80%}}

==Illustrations==
 
The links to illustrations here refute the proof-by-picture crank algorithms and equations presented by Grant. The use of external image hosting avoids clutter in the main article.

{{Reflist|group=illustration|2|80%}}

==Programs==
The links to programs here allow for easy inspection of the algorithm implementations used to generate the results and provide a one-button method to independently run them for verifying the presented results.

{{Reflist|group=program|2|80%}}

==References==
{{reflist|2|80%}}

[[Category:Cryptocurrency]]
[[Category:Computing woo]]
[[Category:Pseudomathematics]]
[[Category:Quantum woo]]
[[Category:Scams]]

Categories: Cryptocurrency, Computing woo, Pseudomathematics, Quantum woo, Scams