Block #453,555

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2014, 9:34:28 AM · Difficulty 10.3860 · 6,357,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9565f616a7de4cb6acc17c3182f33913ed1ebea62a24a86d2297feb9650f1960

Height

#453,555

Difficulty

10.385996

Transactions

9

Size

1.96 KB

Version

2

Bits

0a62d0a1

Nonce

177,546

Timestamp

3/21/2014, 9:34:28 AM

Confirmations

6,357,083

Merkle Root

0917736200416f6f5d50bcf8e6211d2b92e33bdf0a82327361a856ff50a0911c
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.528 × 10⁹⁹(100-digit number)
15289275609963106356…27609524737773609519
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.528 × 10⁹⁹(100-digit number)
15289275609963106356…27609524737773609519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.057 × 10⁹⁹(100-digit number)
30578551219926212713…55219049475547219039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.115 × 10⁹⁹(100-digit number)
61157102439852425427…10438098951094438079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.223 × 10¹⁰⁰(101-digit number)
12231420487970485085…20876197902188876159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.446 × 10¹⁰⁰(101-digit number)
24462840975940970171…41752395804377752319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.892 × 10¹⁰⁰(101-digit number)
48925681951881940342…83504791608755504639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.785 × 10¹⁰⁰(101-digit number)
97851363903763880684…67009583217511009279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.957 × 10¹⁰¹(102-digit number)
19570272780752776136…34019166435022018559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.914 × 10¹⁰¹(102-digit number)
39140545561505552273…68038332870044037119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.828 × 10¹⁰¹(102-digit number)
78281091123011104547…36076665740088074239
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,729,192 XPM·at block #6,810,637 · 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