Block #2,478,337

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2018, 5:13:01 AM · Difficulty 10.9655 · 4,353,506 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a3b265026aec29b97f3090e1c897eff66233895d26f1b5226eae02ba260c70d0

Height

#2,478,337

Difficulty

10.965538

Transactions

4

Size

813 B

Version

2

Bits

0af72d81

Nonce

1,275,156,840

Timestamp

1/18/2018, 5:13:01 AM

Confirmations

4,353,506

Merkle Root

34fc4bad8cb9ecf183205a453c0cd3f456bda02e1ef03c2dd90d43b03d76893a
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.392 × 10⁹⁶(97-digit number)
13920220710152896116…73381907686094796801
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.392 × 10⁹⁶(97-digit number)
13920220710152896116…73381907686094796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.784 × 10⁹⁶(97-digit number)
27840441420305792233…46763815372189593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.568 × 10⁹⁶(97-digit number)
55680882840611584467…93527630744379187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.113 × 10⁹⁷(98-digit number)
11136176568122316893…87055261488758374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.227 × 10⁹⁷(98-digit number)
22272353136244633786…74110522977516748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.454 × 10⁹⁷(98-digit number)
44544706272489267573…48221045955033497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.908 × 10⁹⁷(98-digit number)
89089412544978535147…96442091910066995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.781 × 10⁹⁸(99-digit number)
17817882508995707029…92884183820133990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.563 × 10⁹⁸(99-digit number)
35635765017991414059…85768367640267980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.127 × 10⁹⁸(99-digit number)
71271530035982828118…71536735280535961601
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,898,864 XPM·at block #6,831,842 · 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