Block #444,238

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 3:38:53 AM · Difficulty 10.3408 · 6,365,486 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c3abcb01708342d8f5442020f646b53aa75951c135228760f1e068b1287ae0e

Height

#444,238

Difficulty

10.340758

Transactions

2

Size

43.63 KB

Version

2

Bits

0a573be8

Nonce

820,506

Timestamp

3/15/2014, 3:38:53 AM

Confirmations

6,365,486

Merkle Root

b5acdcd4eb31b05bf88e1b4dd744ce37804f58dca24146b927ce947642f928b9
Transactions (2)
1 in → 1 out9.7900 XPM110 B
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.

5.490 × 10⁹⁷(98-digit number)
54905777674002341447…01827508979815884799
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
5.490 × 10⁹⁷(98-digit number)
54905777674002341447…01827508979815884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.098 × 10⁹⁸(99-digit number)
10981155534800468289…03655017959631769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.196 × 10⁹⁸(99-digit number)
21962311069600936579…07310035919263539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.392 × 10⁹⁸(99-digit number)
43924622139201873158…14620071838527078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.784 × 10⁹⁸(99-digit number)
87849244278403746316…29240143677054156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.756 × 10⁹⁹(100-digit number)
17569848855680749263…58480287354108313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.513 × 10⁹⁹(100-digit number)
35139697711361498526…16960574708216627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.027 × 10⁹⁹(100-digit number)
70279395422722997052…33921149416433254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.405 × 10¹⁰⁰(101-digit number)
14055879084544599410…67842298832866508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.811 × 10¹⁰⁰(101-digit number)
28111758169089198821…35684597665733017599
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,721,873 XPM·at block #6,809,723 · 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