Block #2,050,664

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2017, 5:02:21 AM · Difficulty 10.6964 · 4,789,386 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28d1b52838c011c4d9187f2d2bbeb4b9c99e0104be6196a87383630ed1ad9655

Height

#2,050,664

Difficulty

10.696397

Transactions

5

Size

58.88 KB

Version

2

Bits

0ab2470f

Nonce

1,849,627,310

Timestamp

4/3/2017, 5:02:21 AM

Confirmations

4,789,386

Merkle Root

66ca11809420edbeb964eb5c9daaed2a7a98ef68eeb1f46523850bc84935bdf9
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.989 × 10⁹³(94-digit number)
49896514801416298675…03024797316998649601
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.989 × 10⁹³(94-digit number)
49896514801416298675…03024797316998649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.979 × 10⁹³(94-digit number)
99793029602832597350…06049594633997299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.995 × 10⁹⁴(95-digit number)
19958605920566519470…12099189267994598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.991 × 10⁹⁴(95-digit number)
39917211841133038940…24198378535989196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.983 × 10⁹⁴(95-digit number)
79834423682266077880…48396757071978393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.596 × 10⁹⁵(96-digit number)
15966884736453215576…96793514143956787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.193 × 10⁹⁵(96-digit number)
31933769472906431152…93587028287913574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.386 × 10⁹⁵(96-digit number)
63867538945812862304…87174056575827148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.277 × 10⁹⁶(97-digit number)
12773507789162572460…74348113151654297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.554 × 10⁹⁶(97-digit number)
25547015578325144921…48696226303308595201
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,964,708 XPM·at block #6,840,049 · 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