Block #452,049

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 8:30:53 AM · Difficulty 10.3846 · 6,373,143 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83376a33e2aba00d3e7fa0ddc5190fdc7b51c9b751a67effac39f9355adc7f91

Height

#452,049

Difficulty

10.384601

Transactions

7

Size

1.81 KB

Version

2

Bits

0a627533

Nonce

177,685

Timestamp

3/20/2014, 8:30:53 AM

Confirmations

6,373,143

Merkle Root

c4ef24b5b406d7933c89898d0162ae7c794c52d6d536b7a2da2455ff3636b036
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.066 × 10⁹⁷(98-digit number)
10663917551040781850…20064989486876712159
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.066 × 10⁹⁷(98-digit number)
10663917551040781850…20064989486876712159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.132 × 10⁹⁷(98-digit number)
21327835102081563701…40129978973753424319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.265 × 10⁹⁷(98-digit number)
42655670204163127402…80259957947506848639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.531 × 10⁹⁷(98-digit number)
85311340408326254805…60519915895013697279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.706 × 10⁹⁸(99-digit number)
17062268081665250961…21039831790027394559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.412 × 10⁹⁸(99-digit number)
34124536163330501922…42079663580054789119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.824 × 10⁹⁸(99-digit number)
68249072326661003844…84159327160109578239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.364 × 10⁹⁹(100-digit number)
13649814465332200768…68318654320219156479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.729 × 10⁹⁹(100-digit number)
27299628930664401537…36637308640438312959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.459 × 10⁹⁹(100-digit number)
54599257861328803075…73274617280876625919
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,845,627 XPM·at block #6,825,191 · 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