Block #2,153,293

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/9/2017, 2:02:08 PM · Difficulty 10.9029 · 4,663,149 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
84fbf76309f6b23293d8952f31f011b54fe324ce7ab2281f8b740ca04a42bbd9

Height

#2,153,293

Difficulty

10.902856

Transactions

4

Size

3.27 KB

Version

2

Bits

0ae72197

Nonce

1,460,848,099

Timestamp

6/9/2017, 2:02:08 PM

Confirmations

4,663,149

Merkle Root

6555df5ade8578cd1146190adf247d1d9f04e805381b8934bffdca633b551ecb
Transactions (4)
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.408 × 10⁹³(94-digit number)
24083213103812363748…67668312285946126079
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.408 × 10⁹³(94-digit number)
24083213103812363748…67668312285946126079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.816 × 10⁹³(94-digit number)
48166426207624727497…35336624571892252159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.633 × 10⁹³(94-digit number)
96332852415249454994…70673249143784504319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.926 × 10⁹⁴(95-digit number)
19266570483049890998…41346498287569008639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.853 × 10⁹⁴(95-digit number)
38533140966099781997…82692996575138017279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.706 × 10⁹⁴(95-digit number)
77066281932199563995…65385993150276034559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.541 × 10⁹⁵(96-digit number)
15413256386439912799…30771986300552069119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.082 × 10⁹⁵(96-digit number)
30826512772879825598…61543972601104138239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.165 × 10⁹⁵(96-digit number)
61653025545759651196…23087945202208276479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.233 × 10⁹⁶(97-digit number)
12330605109151930239…46175890404416552959
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,775,662 XPM·at block #6,816,441 · 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