Block #2,501,635

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/2/2018, 1:54:11 AM · Difficulty 10.9769 · 4,313,417 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
badd01ebbb1aafcb0f41fd9c2e8902062e074e91291939ccd4cf77fb178ed6f4

Height

#2,501,635

Difficulty

10.976914

Transactions

2

Size

20.67 KB

Version

2

Bits

0afa170e

Nonce

1,578,821,426

Timestamp

2/2/2018, 1:54:11 AM

Confirmations

4,313,417

Merkle Root

8c78341ef6ab9df3e82d6890dc6909b7e58e79ba06cb4ca58e979f6b70f9f695
Transactions (2)
1 in → 1 out8.5000 XPM110 B
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.

3.739 × 10⁹⁵(96-digit number)
37395416299919634401…98319010544486461361
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
3.739 × 10⁹⁵(96-digit number)
37395416299919634401…98319010544486461361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.479 × 10⁹⁵(96-digit number)
74790832599839268802…96638021088972922721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.495 × 10⁹⁶(97-digit number)
14958166519967853760…93276042177945845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.991 × 10⁹⁶(97-digit number)
29916333039935707521…86552084355891690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.983 × 10⁹⁶(97-digit number)
59832666079871415042…73104168711783381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.196 × 10⁹⁷(98-digit number)
11966533215974283008…46208337423566763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.393 × 10⁹⁷(98-digit number)
23933066431948566016…92416674847133527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.786 × 10⁹⁷(98-digit number)
47866132863897132033…84833349694267054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.573 × 10⁹⁷(98-digit number)
95732265727794264067…69666699388534108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.914 × 10⁹⁸(99-digit number)
19146453145558852813…39333398777068216321
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,764,507 XPM·at block #6,815,051 · 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