Block #453,192

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 2:32:58 AM · Difficulty 10.3926 · 6,377,404 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
74cc7b2ba577a5f7338e1518464c5bc949e432850691ca8b8022100e694082d0

Height

#453,192

Difficulty

10.392608

Transactions

2

Size

428 B

Version

2

Bits

0a6481fc

Nonce

531,357

Timestamp

3/21/2014, 2:32:58 AM

Confirmations

6,377,404

Merkle Root

3e26d5b91843708c88d9bb2a1ce4e55ae6fb62579eac5bc17f0a2fe283053d29
Transactions (2)
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.

4.470 × 10⁹⁹(100-digit number)
44703030574834261725…02120326169279949639
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
4.470 × 10⁹⁹(100-digit number)
44703030574834261725…02120326169279949639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.940 × 10⁹⁹(100-digit number)
89406061149668523450…04240652338559899279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.788 × 10¹⁰⁰(101-digit number)
17881212229933704690…08481304677119798559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.576 × 10¹⁰⁰(101-digit number)
35762424459867409380…16962609354239597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.152 × 10¹⁰⁰(101-digit number)
71524848919734818760…33925218708479194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.430 × 10¹⁰¹(102-digit number)
14304969783946963752…67850437416958388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.860 × 10¹⁰¹(102-digit number)
28609939567893927504…35700874833916776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.721 × 10¹⁰¹(102-digit number)
57219879135787855008…71401749667833553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.144 × 10¹⁰²(103-digit number)
11443975827157571001…42803499335667107839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.288 × 10¹⁰²(103-digit number)
22887951654315142003…85606998671334215679
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,888,889 XPM·at block #6,830,595 · 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