By applying lattice cryptography algorithms, a global group of researchers has sped up blind gamma-ray pulsar searches in NASA Fermi satellite archives by a factor of one million, converting public astronomical data stores into instant discovery engines.
Detailed on Thursday in Physical Review Letters, the findings describe how investigators spotted a previously overlooked gamma-ray pulsar named PSR J1622-7204 within a 15-year archive of public observations gathered by the Large Area Telescope on NASA’s Fermi Gamma-ray Space Telescope.
The newly found neutron star spins 261 times per second (CASRAI) (or 261 Hz [American Physical Society]). The team located the pulsar utilizing approximately 10 CPU hours on one processor core, completing the initial screening in roughly 100 minutes on a standard workstation, while each individual trial run required about five minutes on a single computer core.
Traditional blind searches previously performed on the exact same dataset failed to find the object despite consuming a computational effort equal to 600 CPU years.
Pulsars are dense neutron stars that sweep beams of radiation across space as they rotate, much like a lighthouse. Detecting pulsars in gamma rays is notoriously difficult because instruments record only sparse photon arrivals, with a typical pulsar spinning hundreds of millions of times for each individual photon detected.
Over the course of 15 years, the Fermi observatory collected roughly 16,000 candidate photons altogether from the patch of sky housing PSR J1622-7204, with the actual signal obscured by scattered Galactic background interference.

“We don’t see every rotation from the pulsar, and we can’t just count the rotations to work out where the photon came from,” Daniel Pook-Kolb, a scientist at the Max Planck Institute for Gravitational Physics (Albert Einstein Institute) in Germany and lead author of the study, said according to NASA. “We have a four-dimensional grid, and we must search each direction with millions of trials in it. There’s just not enough computing power on Earth to do it.”
To solve this, study co-authors Dotan Gazith and Barak Zackay from the Weizmann Institute of Science in Israel developed a method that transforms the search into a geometry problem: finding the shortest vector in a high-dimensional lattice, or a regularly spaced array of points. This technique draws on algorithms developed by cryptographers trying to break encryption systems designed to resist code-breaking by future quantum computers.
“We have nothing to do with cryptography in our analysis here, but those algorithms can help us solve the problem of searching for pulsars in our data,” Dotan Gazith said according to NASA.
The algorithm identified PSR J1622-7204 using an initial sample of just 80 randomly chosen photons before validating the signal against the complete dataset. The study was led jointly by Daniel Pook-Kolb and Dotan Gazith, together with co-authors Colin J. Clark, Erik Agrell, Barak Zackay, and Bruce Allen, representing institutions including the Max Planck Institute for Gravitational Physics, Leibniz Universität Hannover, Weizmann Institute of Science, and Chalmers University of Technology.
Looking ahead, the team’s next goal is to extend searches to binary systems where a pulsar orbits a star, which has traditionally been an intractable problem without detailed prior knowledge of orbital parameters.
“We know that there are probably tens or maybe even hundreds of these pulsars in the data set that we just couldn’t find,” Colin Clark, an astrophysicist at the Max Planck Institute who co-authored the study, said according to NASA.
“The next goal is to extend the searches and use the combination of the new algorithm and the crowdsourced computing power from volunteers in our Einstein@Home program to hopefully find many new pulsars that we t”.
Worth a look