Block #448,741

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/18/2014, 3:53:09 AM · Difficulty 10.3640 · 6,367,605 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7f84c40b937094f9a696f9644d031e25a1b0881ec483818afd01a2097fd0dc9a

Height

#448,741

Difficulty

10.364022

Transactions

2

Size

4.29 KB

Version

2

Bits

0a5d308e

Nonce

9,804

Timestamp

3/18/2014, 3:53:09 AM

Confirmations

6,367,605

Merkle Root

471f9c32e88c85329cfc14d9aceae7f7e4c00f668d0d090f35a811a60966d440
Transactions (2)
1 in → 1 out9.3500 XPM116 B
28 in → 1 out7.3882 XPM4.09 KB
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.295 × 10⁹⁸(99-digit number)
52950058368479553730…87566296622597622179
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.295 × 10⁹⁸(99-digit number)
52950058368479553730…87566296622597622179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.059 × 10⁹⁹(100-digit number)
10590011673695910746…75132593245195244359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.118 × 10⁹⁹(100-digit number)
21180023347391821492…50265186490390488719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.236 × 10⁹⁹(100-digit number)
42360046694783642984…00530372980780977439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.472 × 10⁹⁹(100-digit number)
84720093389567285968…01060745961561954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.694 × 10¹⁰⁰(101-digit number)
16944018677913457193…02121491923123909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.388 × 10¹⁰⁰(101-digit number)
33888037355826914387…04242983846247819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.777 × 10¹⁰⁰(101-digit number)
67776074711653828774…08485967692495639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.355 × 10¹⁰¹(102-digit number)
13555214942330765754…16971935384991278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.711 × 10¹⁰¹(102-digit number)
27110429884661531509…33943870769982556159
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,774,892 XPM·at block #6,816,345 · 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