Block #2,132,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 8:26:20 PM · Difficulty 10.9102 · 4,709,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9233c8ad5ffe9fc795a1dab5cc2b408c5c1495fe5d441101185aa8bcd80c21b5

Height

#2,132,502

Difficulty

10.910200

Transactions

3

Size

1.74 KB

Version

2

Bits

0ae902da

Nonce

420,206,012

Timestamp

5/25/2017, 8:26:20 PM

Confirmations

4,709,711

Merkle Root

3e7c6feb11349470b8393947f91a89a34fce3eddbb37e08d840e524cf864e935
Transactions (3)
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.206 × 10⁹⁵(96-digit number)
12068807004018698219…17611791913608596481
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.206 × 10⁹⁵(96-digit number)
12068807004018698219…17611791913608596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.413 × 10⁹⁵(96-digit number)
24137614008037396439…35223583827217192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.827 × 10⁹⁵(96-digit number)
48275228016074792878…70447167654434385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.655 × 10⁹⁵(96-digit number)
96550456032149585756…40894335308868771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.931 × 10⁹⁶(97-digit number)
19310091206429917151…81788670617737543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.862 × 10⁹⁶(97-digit number)
38620182412859834302…63577341235475087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.724 × 10⁹⁶(97-digit number)
77240364825719668605…27154682470950174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.544 × 10⁹⁷(98-digit number)
15448072965143933721…54309364941900349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.089 × 10⁹⁷(98-digit number)
30896145930287867442…08618729883800698881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.179 × 10⁹⁷(98-digit number)
61792291860575734884…17237459767601397761
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,982,101 XPM·at block #6,842,212 · 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