Block #448,494

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/17/2014, 11:23:31 PM · Difficulty 10.3670 · 6,361,458 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b6753b05bc89fe6af676dd404c275c31734cf3a822d2fa4182db689cbc0f323b

Height

#448,494

Difficulty

10.366965

Transactions

3

Size

29.40 KB

Version

2

Bits

0a5df169

Nonce

4,488

Timestamp

3/17/2014, 11:23:31 PM

Confirmations

6,361,458

Merkle Root

fe7b387ca3de961cf6f29b560ac4aae51bcc13c8e15f95d97d55d1d3c30fc8de
Transactions (3)
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.938 × 10⁹⁸(99-digit number)
19382009257416627415…78705000464548340479
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.938 × 10⁹⁸(99-digit number)
19382009257416627415…78705000464548340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.876 × 10⁹⁸(99-digit number)
38764018514833254830…57410000929096680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.752 × 10⁹⁸(99-digit number)
77528037029666509660…14820001858193361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.550 × 10⁹⁹(100-digit number)
15505607405933301932…29640003716386723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.101 × 10⁹⁹(100-digit number)
31011214811866603864…59280007432773447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.202 × 10⁹⁹(100-digit number)
62022429623733207728…18560014865546895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.240 × 10¹⁰⁰(101-digit number)
12404485924746641545…37120029731093790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.480 × 10¹⁰⁰(101-digit number)
24808971849493283091…74240059462187581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.961 × 10¹⁰⁰(101-digit number)
49617943698986566182…48480118924375162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.923 × 10¹⁰⁰(101-digit number)
99235887397973132365…96960237848750325759
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,723,697 XPM·at block #6,809,951 · 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