Block #441,258

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/13/2014, 12:21:37 AM · Difficulty 10.3509 · 6,366,450 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5f1053d2e55e73bb269e8bb9008ded299712ef7048c036a70794e1777813f75

Height

#441,258

Difficulty

10.350875

Transactions

2

Size

367 B

Version

2

Bits

0a59d2f9

Nonce

36,062

Timestamp

3/13/2014, 12:21:37 AM

Confirmations

6,366,450

Merkle Root

311a199d39beaaedb0c2ef81a4eb2f9d692914582b278b8cd2c6bbc23def1cbf
Transactions (2)
1 in → 1 out9.3300 XPM116 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.

1.142 × 10¹⁰⁰(101-digit number)
11421581305210762251…53578119487609655519
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.142 × 10¹⁰⁰(101-digit number)
11421581305210762251…53578119487609655519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.284 × 10¹⁰⁰(101-digit number)
22843162610421524503…07156238975219311039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.568 × 10¹⁰⁰(101-digit number)
45686325220843049007…14312477950438622079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.137 × 10¹⁰⁰(101-digit number)
91372650441686098015…28624955900877244159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.827 × 10¹⁰¹(102-digit number)
18274530088337219603…57249911801754488319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.654 × 10¹⁰¹(102-digit number)
36549060176674439206…14499823603508976639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.309 × 10¹⁰¹(102-digit number)
73098120353348878412…28999647207017953279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.461 × 10¹⁰²(103-digit number)
14619624070669775682…57999294414035906559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.923 × 10¹⁰²(103-digit number)
29239248141339551365…15998588828071813119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.847 × 10¹⁰²(103-digit number)
58478496282679102730…31997177656143626239
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,705,695 XPM·at block #6,807,707 · 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