Block #452,406

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 1:41:03 PM · Difficulty 10.3907 · 6,363,642 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dc6702695162c9570cbcd73a7cd6203d081e01841be4c22fc2491e006c085b73

Height

#452,406

Difficulty

10.390688

Transactions

7

Size

1.52 KB

Version

2

Bits

0a640428

Nonce

188,371

Timestamp

3/20/2014, 1:41:03 PM

Confirmations

6,363,642

Merkle Root

7626f40de86389ace92040c445ee3c2acbe053580da0fa60cac099c2d2a1587f
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.000 × 10¹⁰¹(102-digit number)
10001718864110105995…13144334533794959359
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.000 × 10¹⁰¹(102-digit number)
10001718864110105995…13144334533794959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.000 × 10¹⁰¹(102-digit number)
20003437728220211990…26288669067589918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.000 × 10¹⁰¹(102-digit number)
40006875456440423980…52577338135179837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.001 × 10¹⁰¹(102-digit number)
80013750912880847961…05154676270359674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.600 × 10¹⁰²(103-digit number)
16002750182576169592…10309352540719349759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.200 × 10¹⁰²(103-digit number)
32005500365152339184…20618705081438699519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.401 × 10¹⁰²(103-digit number)
64011000730304678368…41237410162877399039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.280 × 10¹⁰³(104-digit number)
12802200146060935673…82474820325754798079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.560 × 10¹⁰³(104-digit number)
25604400292121871347…64949640651509596159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.120 × 10¹⁰³(104-digit number)
51208800584243742695…29899281303019192319
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,772,500 XPM·at block #6,816,047 · 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