Several years ago I came up with a algorithm that was thousands of times faster then anything else known at finding long chains of primes in sequences. primes.plentyoffish.com contains the original post I made when we found the first 23 primes in succession. I created the application, and then recruited Paul Jobling and Paul Underwood to provide computers to aid in finding the record.
In 2004 Terry Tao solved one of the hardest problems in Math and cited our record http://arxiv.org/pdf/math.NT/0404188
Here is more details on why he won the Fields Medal which is considered the Nobel Prize of Math, there is a typo there as it should say the record is 23 primes in progression. Paul Jobling emailed Terry Tao to confirm.
Earlier this year I refined the program and found several more chains of 23 primes. I am amazed I managed to create this program in the first place, I barely barely even understand how it works and I wrote it. This is because the program scans in multiple dimensions is very hard to conceptualize. At any rate I think its cool that my record is cited in the Fields Medals press release.