Block #852,492

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2014, 3:57:10 AM · Difficulty 10.9696 · 5,990,808 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abec578e0609a7f0e3a2478a7ea3a76640dc92ba399b0b373cb186f5d93a1e48

Height

#852,492

Difficulty

10.969590

Transactions

4

Size

986 B

Version

2

Bits

0af8370f

Nonce

1,626,478,636

Timestamp

12/14/2014, 3:57:10 AM

Confirmations

5,990,808

Merkle Root

9c54c2bfab1c2ea56a69d899ba4396c5387e2f17d216df20294a84228ad9fed0
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.141 × 10⁹⁸(99-digit number)
11414325424038737112…05175301268938721281
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.141 × 10⁹⁸(99-digit number)
11414325424038737112…05175301268938721281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.282 × 10⁹⁸(99-digit number)
22828650848077474224…10350602537877442561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.565 × 10⁹⁸(99-digit number)
45657301696154948448…20701205075754885121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.131 × 10⁹⁸(99-digit number)
91314603392309896897…41402410151509770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.826 × 10⁹⁹(100-digit number)
18262920678461979379…82804820303019540481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.652 × 10⁹⁹(100-digit number)
36525841356923958758…65609640606039080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.305 × 10⁹⁹(100-digit number)
73051682713847917517…31219281212078161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.461 × 10¹⁰⁰(101-digit number)
14610336542769583503…62438562424156323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.922 × 10¹⁰⁰(101-digit number)
29220673085539167007…24877124848312647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.844 × 10¹⁰⁰(101-digit number)
58441346171078334014…49754249696625295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.168 × 10¹⁰¹(102-digit number)
11688269234215666802…99508499393250590721
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,990,765 XPM·at block #6,843,299 · 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