Block #2,087,095

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2017, 10:56:44 AM · Difficulty 10.8740 · 4,752,096 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a06256d065738280ab8b9fe1004d19a5ba3433136c5d0c3f5af534d6534a2d55

Height

#2,087,095

Difficulty

10.874040

Transactions

3

Size

2.46 KB

Version

2

Bits

0adfc119

Nonce

439,663,098

Timestamp

4/25/2017, 10:56:44 AM

Confirmations

4,752,096

Merkle Root

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

2.722 × 10⁹⁴(95-digit number)
27220797069267394759…10098216888027061479
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.722 × 10⁹⁴(95-digit number)
27220797069267394759…10098216888027061479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.444 × 10⁹⁴(95-digit number)
54441594138534789518…20196433776054122959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.088 × 10⁹⁵(96-digit number)
10888318827706957903…40392867552108245919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.177 × 10⁹⁵(96-digit number)
21776637655413915807…80785735104216491839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.355 × 10⁹⁵(96-digit number)
43553275310827831614…61571470208432983679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.710 × 10⁹⁵(96-digit number)
87106550621655663228…23142940416865967359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.742 × 10⁹⁶(97-digit number)
17421310124331132645…46285880833731934719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.484 × 10⁹⁶(97-digit number)
34842620248662265291…92571761667463869439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.968 × 10⁹⁶(97-digit number)
69685240497324530583…85143523334927738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.393 × 10⁹⁷(98-digit number)
13937048099464906116…70287046669855477759
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,957,806 XPM·at block #6,839,190 · 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