Block #520,066

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2014, 3:16:07 PM · Difficulty 10.8577 · 6,286,338 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
c75444e9ff250144cc103633a18e1c89130d4896ebab88b3d2448eb72c26bc97

Height

#520,066

Difficulty

10.857679

Transactions

7

Size

1.67 KB

Version

2

Bits

0adb90d5

Nonce

1,741

Timestamp

5/1/2014, 3:16:07 PM

Confirmations

6,286,338

Merkle Root

63c58211fd62b08cad36709577c74de3f3f0e34867a47ec754a946047998687a
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

4.153 × 10⁹⁸(99-digit number)
41535339299873661681…20849738676624006839
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
4.153 × 10⁹⁸(99-digit number)
41535339299873661681…20849738676624006839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.307 × 10⁹⁸(99-digit number)
83070678599747323362…41699477353248013679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.661 × 10⁹⁹(100-digit number)
16614135719949464672…83398954706496027359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.322 × 10⁹⁹(100-digit number)
33228271439898929344…66797909412992054719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.645 × 10⁹⁹(100-digit number)
66456542879797858689…33595818825984109439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.329 × 10¹⁰⁰(101-digit number)
13291308575959571737…67191637651968218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.658 × 10¹⁰⁰(101-digit number)
26582617151919143475…34383275303936437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.316 × 10¹⁰⁰(101-digit number)
53165234303838286951…68766550607872875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.063 × 10¹⁰¹(102-digit number)
10633046860767657390…37533101215745751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.126 × 10¹⁰¹(102-digit number)
21266093721535314780…75066202431491502079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,695,325 XPM·at block #6,806,403 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy