Block #2,217,786

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/22/2017, 1:47:12 PM · Difficulty 10.9436 · 4,624,763 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
694515172bf0e1a8d44c1f01c636374a0441bbc5209cc610d98122c1c1c56b16

Height

#2,217,786

Difficulty

10.943623

Transactions

6

Size

1.82 KB

Version

2

Bits

0af19143

Nonce

277,494,583

Timestamp

7/22/2017, 1:47:12 PM

Confirmations

4,624,763

Merkle Root

c2464c9acd12c0c451f6c9b8045217fa99db3802c7619d4648cd07f94ef8a5f7
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.366 × 10⁹⁴(95-digit number)
13666972953134876979…89273467208807275999
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.366 × 10⁹⁴(95-digit number)
13666972953134876979…89273467208807275999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.733 × 10⁹⁴(95-digit number)
27333945906269753959…78546934417614551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.466 × 10⁹⁴(95-digit number)
54667891812539507918…57093868835229103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.093 × 10⁹⁵(96-digit number)
10933578362507901583…14187737670458207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.186 × 10⁹⁵(96-digit number)
21867156725015803167…28375475340916415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.373 × 10⁹⁵(96-digit number)
43734313450031606334…56750950681832831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.746 × 10⁹⁵(96-digit number)
87468626900063212669…13501901363665663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.749 × 10⁹⁶(97-digit number)
17493725380012642533…27003802727331327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.498 × 10⁹⁶(97-digit number)
34987450760025285067…54007605454662655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.997 × 10⁹⁶(97-digit number)
69974901520050570135…08015210909325311999
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,984,817 XPM·at block #6,842,548 · 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