Block #2,129,399

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2017, 4:24:07 PM · Difficulty 10.9105 · 4,701,095 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9726aefd248b57ddcae5af0964da370795bd6b82d399d02175bdcccb696f214c

Height

#2,129,399

Difficulty

10.910453

Transactions

3

Size

4.89 KB

Version

2

Bits

0ae9136b

Nonce

1,206,114,518

Timestamp

5/23/2017, 4:24:07 PM

Confirmations

4,701,095

Merkle Root

e278ca5138c41504727a72c9c8d75be67cc79ad2a5c07c2317ee03e431a3b9f6
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.377 × 10⁹⁶(97-digit number)
13779253471709218036…11364117607637876481
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.377 × 10⁹⁶(97-digit number)
13779253471709218036…11364117607637876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.755 × 10⁹⁶(97-digit number)
27558506943418436072…22728235215275752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.511 × 10⁹⁶(97-digit number)
55117013886836872145…45456470430551505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.102 × 10⁹⁷(98-digit number)
11023402777367374429…90912940861103011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.204 × 10⁹⁷(98-digit number)
22046805554734748858…81825881722206023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.409 × 10⁹⁷(98-digit number)
44093611109469497716…63651763444412047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.818 × 10⁹⁷(98-digit number)
88187222218938995432…27303526888824094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.763 × 10⁹⁸(99-digit number)
17637444443787799086…54607053777648189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.527 × 10⁹⁸(99-digit number)
35274888887575598172…09214107555296378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.054 × 10⁹⁸(99-digit number)
70549777775151196345…18428215110592757761
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,888,202 XPM·at block #6,830,493 · 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