Block #2,160,573

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2017, 4:49:08 PM · Difficulty 10.9014 · 4,677,636 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f86fa479cbd5a503e64c02eb86f0c51303f2fc30b936c31de5c6dc3070f150f5

Height

#2,160,573

Difficulty

10.901433

Transactions

3

Size

2.49 KB

Version

2

Bits

0ae6c44d

Nonce

732,959,110

Timestamp

6/14/2017, 4:49:08 PM

Confirmations

4,677,636

Merkle Root

be6c19874c41294fdbe49659be115db3f3bb0a60a404a32717abc1f090d33b10
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.

3.187 × 10⁹³(94-digit number)
31877807851962720861…14773488520725963759
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
3.187 × 10⁹³(94-digit number)
31877807851962720861…14773488520725963759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.375 × 10⁹³(94-digit number)
63755615703925441723…29546977041451927519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.275 × 10⁹⁴(95-digit number)
12751123140785088344…59093954082903855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.550 × 10⁹⁴(95-digit number)
25502246281570176689…18187908165807710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.100 × 10⁹⁴(95-digit number)
51004492563140353379…36375816331615420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.020 × 10⁹⁵(96-digit number)
10200898512628070675…72751632663230840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.040 × 10⁹⁵(96-digit number)
20401797025256141351…45503265326461680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.080 × 10⁹⁵(96-digit number)
40803594050512282703…91006530652923361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.160 × 10⁹⁵(96-digit number)
81607188101024565406…82013061305846722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.632 × 10⁹⁶(97-digit number)
16321437620204913081…64026122611693445119
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,949,945 XPM·at block #6,838,208 · 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