Block #289,832

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 9:42:47 AM · Difficulty 9.9888 · 6,535,518 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
63122cb128dc5c23e48376cf5d0453bb770edde8f3a5005634b7dded7e7739a1

Height

#289,832

Difficulty

9.988809

Transactions

9

Size

3.11 KB

Version

2

Bits

09fd229c

Nonce

86,836

Timestamp

12/2/2013, 9:42:47 AM

Confirmations

6,535,518

Merkle Root

eee7e903ff2a845023c68936e3a94980352e1000241e11e66bd64676f6484af3
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.904 × 10⁹⁴(95-digit number)
29049002326236380403…50641635608398768639
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.904 × 10⁹⁴(95-digit number)
29049002326236380403…50641635608398768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.809 × 10⁹⁴(95-digit number)
58098004652472760807…01283271216797537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.161 × 10⁹⁵(96-digit number)
11619600930494552161…02566542433595074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.323 × 10⁹⁵(96-digit number)
23239201860989104322…05133084867190149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.647 × 10⁹⁵(96-digit number)
46478403721978208645…10266169734380298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.295 × 10⁹⁵(96-digit number)
92956807443956417291…20532339468760596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.859 × 10⁹⁶(97-digit number)
18591361488791283458…41064678937521192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.718 × 10⁹⁶(97-digit number)
37182722977582566916…82129357875042385919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.436 × 10⁹⁶(97-digit number)
74365445955165133832…64258715750084771839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.487 × 10⁹⁷(98-digit number)
14873089191033026766…28517431500169543679
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,846,906 XPM·at block #6,825,349 · 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