Block #427,221

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 5:49:04 AM · Difficulty 10.3466 · 6,389,599 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b406c4bd0e5a418fd482087b17f56b1afacc0200c01a2539c7f4464735165326

Height

#427,221

Difficulty

10.346646

Transactions

4

Size

1.47 KB

Version

2

Bits

0a58bdca

Nonce

124,897

Timestamp

3/3/2014, 5:49:04 AM

Confirmations

6,389,599

Merkle Root

fd64545283d5f2d69f73884c8944869bd7269d8f3aa3e8737ecbf33a0d1ba299
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.845 × 10⁹⁴(95-digit number)
48452617923225099096…67701413165918675879
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.845 × 10⁹⁴(95-digit number)
48452617923225099096…67701413165918675879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.690 × 10⁹⁴(95-digit number)
96905235846450198192…35402826331837351759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.938 × 10⁹⁵(96-digit number)
19381047169290039638…70805652663674703519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.876 × 10⁹⁵(96-digit number)
38762094338580079276…41611305327349407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.752 × 10⁹⁵(96-digit number)
77524188677160158553…83222610654698814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.550 × 10⁹⁶(97-digit number)
15504837735432031710…66445221309397628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.100 × 10⁹⁶(97-digit number)
31009675470864063421…32890442618795256319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.201 × 10⁹⁶(97-digit number)
62019350941728126843…65780885237590512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.240 × 10⁹⁷(98-digit number)
12403870188345625368…31561770475181025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.480 × 10⁹⁷(98-digit number)
24807740376691250737…63123540950362050559
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,778,599 XPM·at block #6,816,819 · 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