Block #449,141

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 10:06:49 AM · Difficulty 10.3678 · 6,361,447 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
623f7ff0a5d86f20cc5cc3f2701c952712efc8eea4f833a9d2f40e90039a3b6a

Height

#449,141

Difficulty

10.367843

Transactions

2

Size

1.05 KB

Version

2

Bits

0a5e2af8

Nonce

327,697

Timestamp

3/18/2014, 10:06:49 AM

Confirmations

6,361,447

Merkle Root

840207cb374257fc899c6ed4bb4d3fc0be98e211d5f744a57e163592d1bb64d3
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.

3.263 × 10⁹⁷(98-digit number)
32635773404387308967…98567872269530812159
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
3.263 × 10⁹⁷(98-digit number)
32635773404387308967…98567872269530812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.527 × 10⁹⁷(98-digit number)
65271546808774617934…97135744539061624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.305 × 10⁹⁸(99-digit number)
13054309361754923586…94271489078123248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.610 × 10⁹⁸(99-digit number)
26108618723509847173…88542978156246497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.221 × 10⁹⁸(99-digit number)
52217237447019694347…77085956312492994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.044 × 10⁹⁹(100-digit number)
10443447489403938869…54171912624985989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.088 × 10⁹⁹(100-digit number)
20886894978807877739…08343825249971978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.177 × 10⁹⁹(100-digit number)
41773789957615755478…16687650499943956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.354 × 10⁹⁹(100-digit number)
83547579915231510956…33375300999887912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.670 × 10¹⁰⁰(101-digit number)
16709515983046302191…66750601999775825919
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,728,790 XPM·at block #6,810,587 · 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