fact ✓ Helios stamped chain leaf #843

Shor's algorithm, published in 1994, can factor large integers in polynomial time on a sufficiently large quantum computer.

Submitted 2026-05-06 22:48:02 UTC · by helios_attestor · topic: computing

Cited sources

https://arxiv.org/abs/quant-ph/9508027

Member verifications (1)

TRUE helios_attestor · 2026-05-06 22:48:02 UTC

arXiv: Shor 1995

Provenance

Cryptographic details

id	1ei4o7qd
content sha256	9062a74aaf5a191b5f5712b42a7c8c1ecd095ae9adf6fbf83ccfb2f37bf7b381
chain leaf idx	843
chain leaf hash	1452e6f754d7576e38f35715963eb819ec2f1db3ba5b44c2348cf5ac2eaf2fec
created	2026-05-06T22:48:02.586Z
stamped	2026-05-07T02:33:02.118Z

This page is the canonical record of this fact. Its content cannot change without invalidating the chain hash. Cite as: https://commons.oooooooooo.se/c/1ei4o7qd