Block #511,682

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2014, 9:50:19 AM · Difficulty 10.8307 · 6,304,753 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9aeaa78713f81dac61bef636c65a870c93e1613993b1c86cee8795d608556089

Height

#511,682

Difficulty

10.830699

Transactions

4

Size

2.89 KB

Version

2

Bits

0ad4a8b3

Nonce

70,332

Timestamp

4/26/2014, 9:50:19 AM

Confirmations

6,304,753

Merkle Root

33863a1c83a4c85a1b846485046ceddd9b441e8a09e264872bc0a00ce537dd60
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.

1.241 × 10⁹⁶(97-digit number)
12413822523680394409…67790321990654361599
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
1.241 × 10⁹⁶(97-digit number)
12413822523680394409…67790321990654361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.482 × 10⁹⁶(97-digit number)
24827645047360788818…35580643981308723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.965 × 10⁹⁶(97-digit number)
49655290094721577637…71161287962617446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.931 × 10⁹⁶(97-digit number)
99310580189443155275…42322575925234892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.986 × 10⁹⁷(98-digit number)
19862116037888631055…84645151850469785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.972 × 10⁹⁷(98-digit number)
39724232075777262110…69290303700939571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.944 × 10⁹⁷(98-digit number)
79448464151554524220…38580607401879142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.588 × 10⁹⁸(99-digit number)
15889692830310904844…77161214803758284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.177 × 10⁹⁸(99-digit number)
31779385660621809688…54322429607516569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.355 × 10⁹⁸(99-digit number)
63558771321243619376…08644859215033139199
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,775,605 XPM·at block #6,816,434 · 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.
Privacy Policy·

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