Block #448,108

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/17/2014, 4:50:34 PM · Difficulty 10.3675 · 6,368,951 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fcc4f07a9d1ea2ba47f23d009bfe90b8667453c49a86acbfec5ab9d4c33dd2e1

Height

#448,108

Difficulty

10.367533

Transactions

6

Size

1.73 KB

Version

2

Bits

0a5e169d

Nonce

24,853,421

Timestamp

3/17/2014, 4:50:34 PM

Confirmations

6,368,951

Merkle Root

ce1044f5cd4ff54f9fcdda54271df360b002320880ece0004d36e7ef01fc6a87
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.210 × 10⁹⁶(97-digit number)
22102589158149022446…02593844464647619839
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.210 × 10⁹⁶(97-digit number)
22102589158149022446…02593844464647619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.420 × 10⁹⁶(97-digit number)
44205178316298044892…05187688929295239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.841 × 10⁹⁶(97-digit number)
88410356632596089785…10375377858590479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.768 × 10⁹⁷(98-digit number)
17682071326519217957…20750755717180958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.536 × 10⁹⁷(98-digit number)
35364142653038435914…41501511434361917439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.072 × 10⁹⁷(98-digit number)
70728285306076871828…83003022868723834879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.414 × 10⁹⁸(99-digit number)
14145657061215374365…66006045737447669759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.829 × 10⁹⁸(99-digit number)
28291314122430748731…32012091474895339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.658 × 10⁹⁸(99-digit number)
56582628244861497462…64024182949790679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.131 × 10⁹⁹(100-digit number)
11316525648972299492…28048365899581358079
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,780,506 XPM·at block #6,817,058 · 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