Block #2,114,517

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2017, 4:58:21 PM · Difficulty 10.9002 · 4,716,776 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ae8014629e8f2768f8394242c425063e145db4f8dc65c9dbf0407c124486705d

Height

#2,114,517

Difficulty

10.900237

Transactions

6

Size

3.22 KB

Version

2

Bits

0ae675ed

Nonce

486,604,031

Timestamp

5/13/2017, 4:58:21 PM

Confirmations

4,716,776

Merkle Root

a1fdd29ad244207ff7ea8102969ed31f9a27e837047ef51efd0734cefd967bd8
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.921 × 10⁹⁴(95-digit number)
39211568921964277860…82822533140666046601
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.921 × 10⁹⁴(95-digit number)
39211568921964277860…82822533140666046601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.842 × 10⁹⁴(95-digit number)
78423137843928555721…65645066281332093201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.568 × 10⁹⁵(96-digit number)
15684627568785711144…31290132562664186401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.136 × 10⁹⁵(96-digit number)
31369255137571422288…62580265125328372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.273 × 10⁹⁵(96-digit number)
62738510275142844577…25160530250656745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.254 × 10⁹⁶(97-digit number)
12547702055028568915…50321060501313491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.509 × 10⁹⁶(97-digit number)
25095404110057137830…00642121002626982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.019 × 10⁹⁶(97-digit number)
50190808220114275661…01284242005253964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.003 × 10⁹⁷(98-digit number)
10038161644022855132…02568484010507929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.007 × 10⁹⁷(98-digit number)
20076323288045710264…05136968021015859201
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,894,490 XPM·at block #6,831,292 · 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