Block #2,164,549

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2017, 1:52:30 PM · Difficulty 10.8982 · 4,677,822 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a088f57d3f145ea000d007360d026522f500b4e3a733deec5b56f48401bf9fa0

Height

#2,164,549

Difficulty

10.898222

Transactions

2

Size

5.62 KB

Version

2

Bits

0ae5f1dd

Nonce

1,580,560,273

Timestamp

6/17/2017, 1:52:30 PM

Confirmations

4,677,822

Merkle Root

9ea66c28f22ac493adb9b0b530f2266667d65286bb0fccdad1e65f8f51d0342c
Transactions (2)
1 in → 1 out8.4700 XPM109 B
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.

8.373 × 10⁹⁴(95-digit number)
83731220872411457748…69785741016990896799
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
8.373 × 10⁹⁴(95-digit number)
83731220872411457748…69785741016990896799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.674 × 10⁹⁵(96-digit number)
16746244174482291549…39571482033981793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.349 × 10⁹⁵(96-digit number)
33492488348964583099…79142964067963587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.698 × 10⁹⁵(96-digit number)
66984976697929166198…58285928135927174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.339 × 10⁹⁶(97-digit number)
13396995339585833239…16571856271854348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.679 × 10⁹⁶(97-digit number)
26793990679171666479…33143712543708697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.358 × 10⁹⁶(97-digit number)
53587981358343332958…66287425087417395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.071 × 10⁹⁷(98-digit number)
10717596271668666591…32574850174834790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.143 × 10⁹⁷(98-digit number)
21435192543337333183…65149700349669580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.287 × 10⁹⁷(98-digit number)
42870385086674666367…30299400699339161599
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,983,378 XPM·at block #6,842,370 · 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