Block #449,665

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 6:05:48 PM · Difficulty 10.3730 · 6,356,849 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e9d1e52c1f1741f63260e2310dc4e556c2834fb74d5ba2ec85136ec963dc5145

Height

#449,665

Difficulty

10.373040

Transactions

11

Size

3.89 KB

Version

2

Bits

0a5f7f85

Nonce

17,876

Timestamp

3/18/2014, 6:05:48 PM

Confirmations

6,356,849

Merkle Root

06540d45849b1495207591b542a6dcde6519905ee138c6554c912f940976558c
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.

8.529 × 10¹⁰²(103-digit number)
85291341591224356998…51857771464195870719
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
8.529 × 10¹⁰²(103-digit number)
85291341591224356998…51857771464195870719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.705 × 10¹⁰³(104-digit number)
17058268318244871399…03715542928391741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.411 × 10¹⁰³(104-digit number)
34116536636489742799…07431085856783482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.823 × 10¹⁰³(104-digit number)
68233073272979485598…14862171713566965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.364 × 10¹⁰⁴(105-digit number)
13646614654595897119…29724343427133931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.729 × 10¹⁰⁴(105-digit number)
27293229309191794239…59448686854267863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.458 × 10¹⁰⁴(105-digit number)
54586458618383588478…18897373708535726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.091 × 10¹⁰⁵(106-digit number)
10917291723676717695…37794747417071452159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.183 × 10¹⁰⁵(106-digit number)
21834583447353435391…75589494834142904319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.366 × 10¹⁰⁵(106-digit number)
43669166894706870783…51178989668285808639
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,696,210 XPM·at block #6,806,513 · 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