Block #2,171,713

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/22/2017, 6:43:22 AM · Difficulty 10.9061 · 4,668,161 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f7c439f2832bdb1bfcff8317b599a64c4aa469e8ad1cca9b7fc89985190dbd13

Height

#2,171,713

Difficulty

10.906089

Transactions

2

Size

1.14 KB

Version

2

Bits

0ae7f575

Nonce

54,629,664

Timestamp

6/22/2017, 6:43:22 AM

Confirmations

4,668,161

Merkle Root

51ba4b56fb2c20254152e21fe992a12301ca5e5cc489d64c93617ae509ccc311
Transactions (2)
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.355 × 10⁹⁵(96-digit number)
23558794594172029894…45648232813100607999
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.355 × 10⁹⁵(96-digit number)
23558794594172029894…45648232813100607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.711 × 10⁹⁵(96-digit number)
47117589188344059789…91296465626201215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.423 × 10⁹⁵(96-digit number)
94235178376688119579…82592931252402431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.884 × 10⁹⁶(97-digit number)
18847035675337623915…65185862504804863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.769 × 10⁹⁶(97-digit number)
37694071350675247831…30371725009609727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.538 × 10⁹⁶(97-digit number)
75388142701350495663…60743450019219455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.507 × 10⁹⁷(98-digit number)
15077628540270099132…21486900038438911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.015 × 10⁹⁷(98-digit number)
30155257080540198265…42973800076877823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.031 × 10⁹⁷(98-digit number)
60310514161080396531…85947600153755647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.206 × 10⁹⁸(99-digit number)
12062102832216079306…71895200307511295999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,963,293 XPM·at block #6,839,873 · 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