Block #290,498

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 5:36:51 PM · Difficulty 9.9892 · 6,516,722 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
627e8222ea4fce803cdb31e6ba4165e607d2636449cee71dc63542f13c8e6e5d

Height

#290,498

Difficulty

9.989245

Transactions

3

Size

2.02 KB

Version

2

Bits

09fd3f31

Nonce

352

Timestamp

12/2/2013, 5:36:51 PM

Confirmations

6,516,722

Merkle Root

e77f4bf77548edf51bd37b341aa71413155afd411b336650f94c8423b75dcc91
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.357 × 10¹⁰²(103-digit number)
13573285062757838737…01265225191754433919
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.357 × 10¹⁰²(103-digit number)
13573285062757838737…01265225191754433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.714 × 10¹⁰²(103-digit number)
27146570125515677474…02530450383508867839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.429 × 10¹⁰²(103-digit number)
54293140251031354948…05060900767017735679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.085 × 10¹⁰³(104-digit number)
10858628050206270989…10121801534035471359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.171 × 10¹⁰³(104-digit number)
21717256100412541979…20243603068070942719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.343 × 10¹⁰³(104-digit number)
43434512200825083958…40487206136141885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.686 × 10¹⁰³(104-digit number)
86869024401650167917…80974412272283770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.737 × 10¹⁰⁴(105-digit number)
17373804880330033583…61948824544567541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.474 × 10¹⁰⁴(105-digit number)
34747609760660067167…23897649089135083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.949 × 10¹⁰⁴(105-digit number)
69495219521320134334…47795298178270167039
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,701,777 XPM·at block #6,807,219 · 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.

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