Block #2,635,205

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 4:16:38 AM · Difficulty 11.2987 · 4,209,354 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8c4c8c896777cb4c1fceef41a26786668c813c9399da5672846003cb3622718

Height

#2,635,205

Difficulty

11.298720

Transactions

6

Size

1.78 KB

Version

2

Bits

0b4c78ec

Nonce

906,824,273

Timestamp

4/29/2018, 4:16:38 AM

Confirmations

4,209,354

Merkle Root

5a6a560dbf9e5d02ff92ddc445e8928e0a251f42d6f79e7fe6f6ec68e6d5f018
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.

2.400 × 10⁹³(94-digit number)
24003367336478320323…42370113364151318361
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
2.400 × 10⁹³(94-digit number)
24003367336478320323…42370113364151318361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.800 × 10⁹³(94-digit number)
48006734672956640647…84740226728302636721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.601 × 10⁹³(94-digit number)
96013469345913281295…69480453456605273441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.920 × 10⁹⁴(95-digit number)
19202693869182656259…38960906913210546881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.840 × 10⁹⁴(95-digit number)
38405387738365312518…77921813826421093761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.681 × 10⁹⁴(95-digit number)
76810775476730625036…55843627652842187521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.536 × 10⁹⁵(96-digit number)
15362155095346125007…11687255305684375041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.072 × 10⁹⁵(96-digit number)
30724310190692250014…23374510611368750081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.144 × 10⁹⁵(96-digit number)
61448620381384500029…46749021222737500161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.228 × 10⁹⁶(97-digit number)
12289724076276900005…93498042445475000321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.457 × 10⁹⁶(97-digit number)
24579448152553800011…86996084890950000641
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:58,000,874 XPM·at block #6,844,558 · 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