Block #439,002

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 9:35:43 AM · Difficulty 10.3581 · 6,378,127 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c89a1012c41d603f8a9268657e97afb016686dc730013685b0c2a0067da51c54

Height

#439,002

Difficulty

10.358128

Transactions

2

Size

1.38 KB

Version

2

Bits

0a5bae49

Nonce

154,557

Timestamp

3/11/2014, 9:35:43 AM

Confirmations

6,378,127

Merkle Root

847e7f768ef1ad6f86ce461c65ad997b353a43df36673630ebfb924193132022
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.

8.909 × 10⁹⁸(99-digit number)
89098454352352747579…32102692039326807041
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
8.909 × 10⁹⁸(99-digit number)
89098454352352747579…32102692039326807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.781 × 10⁹⁹(100-digit number)
17819690870470549515…64205384078653614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.563 × 10⁹⁹(100-digit number)
35639381740941099031…28410768157307228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.127 × 10⁹⁹(100-digit number)
71278763481882198063…56821536314614456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.425 × 10¹⁰⁰(101-digit number)
14255752696376439612…13643072629228912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.851 × 10¹⁰⁰(101-digit number)
28511505392752879225…27286145258457825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.702 × 10¹⁰⁰(101-digit number)
57023010785505758450…54572290516915650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.140 × 10¹⁰¹(102-digit number)
11404602157101151690…09144581033831301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.280 × 10¹⁰¹(102-digit number)
22809204314202303380…18289162067662602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.561 × 10¹⁰¹(102-digit number)
45618408628404606760…36578324135325204481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,781,066 XPM·at block #6,817,128 · 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