Block #429,067

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2014, 12:58:01 PM · Difficulty 10.3459 · 6,388,754 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9b5b41fcf508706923fc905af63de5c1c158795309bd24f5fc44b7da700bc654

Height

#429,067

Difficulty

10.345858

Transactions

3

Size

1.89 KB

Version

2

Bits

0a588a22

Nonce

146,490

Timestamp

3/4/2014, 12:58:01 PM

Confirmations

6,388,754

Merkle Root

5836cf6b37933fccf313055ea453bb1ceb81d0e4b95ea4b7c1e3c3feacc26dc2
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.

5.507 × 10⁹⁹(100-digit number)
55073880497160331271…89872649734217384319
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
5.507 × 10⁹⁹(100-digit number)
55073880497160331271…89872649734217384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.101 × 10¹⁰⁰(101-digit number)
11014776099432066254…79745299468434768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.202 × 10¹⁰⁰(101-digit number)
22029552198864132508…59490598936869537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.405 × 10¹⁰⁰(101-digit number)
44059104397728265017…18981197873739074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.811 × 10¹⁰⁰(101-digit number)
88118208795456530034…37962395747478149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.762 × 10¹⁰¹(102-digit number)
17623641759091306006…75924791494956298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.524 × 10¹⁰¹(102-digit number)
35247283518182612013…51849582989912596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.049 × 10¹⁰¹(102-digit number)
70494567036365224027…03699165979825192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.409 × 10¹⁰²(103-digit number)
14098913407273044805…07398331959650385919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.819 × 10¹⁰²(103-digit number)
28197826814546089611…14796663919300771839
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,786,631 XPM·at block #6,817,820 · 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