Block #2,134,689

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2017, 12:06:17 PM · Difficulty 10.9068 · 4,691,559 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e51665dc674beb063663419c1c9ba4bd3a73c790453839a62222e11266e95e4

Height

#2,134,689

Difficulty

10.906764

Transactions

3

Size

1.79 KB

Version

2

Bits

0ae821b0

Nonce

20,614,802

Timestamp

5/27/2017, 12:06:17 PM

Confirmations

4,691,559

Merkle Root

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

2.122 × 10⁹⁶(97-digit number)
21222833072812915138…30123472082578073601
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.122 × 10⁹⁶(97-digit number)
21222833072812915138…30123472082578073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.244 × 10⁹⁶(97-digit number)
42445666145625830276…60246944165156147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.489 × 10⁹⁶(97-digit number)
84891332291251660553…20493888330312294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.697 × 10⁹⁷(98-digit number)
16978266458250332110…40987776660624588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.395 × 10⁹⁷(98-digit number)
33956532916500664221…81975553321249177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.791 × 10⁹⁷(98-digit number)
67913065833001328443…63951106642498355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.358 × 10⁹⁸(99-digit number)
13582613166600265688…27902213284996710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.716 × 10⁹⁸(99-digit number)
27165226333200531377…55804426569993420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.433 × 10⁹⁸(99-digit number)
54330452666401062754…11608853139986841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.086 × 10⁹⁹(100-digit number)
10866090533280212550…23217706279973683201
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,854,116 XPM·at block #6,826,247 · 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