Block #403,566

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/14/2014, 6:34:08 AM · Difficulty 10.4299 · 6,413,704 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba7a954fb948fcbe8176b7973b4cf1d8f301c8ffa77409b140a0b0c92a6cea1b

Height

#403,566

Difficulty

10.429897

Transactions

1

Size

902 B

Version

2

Bits

0a6e0dc1

Nonce

71,243

Timestamp

2/14/2014, 6:34:08 AM

Confirmations

6,413,704

Merkle Root

abc3b50c80fd399e3ead459b76df207c773cab9144500526b759d3597588bf14
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.

3.260 × 10⁹⁷(98-digit number)
32608340895331597330…89940804698322414159
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
3.260 × 10⁹⁷(98-digit number)
32608340895331597330…89940804698322414159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.521 × 10⁹⁷(98-digit number)
65216681790663194661…79881609396644828319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.304 × 10⁹⁸(99-digit number)
13043336358132638932…59763218793289656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.608 × 10⁹⁸(99-digit number)
26086672716265277864…19526437586579313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.217 × 10⁹⁸(99-digit number)
52173345432530555729…39052875173158626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.043 × 10⁹⁹(100-digit number)
10434669086506111145…78105750346317253119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.086 × 10⁹⁹(100-digit number)
20869338173012222291…56211500692634506239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.173 × 10⁹⁹(100-digit number)
41738676346024444583…12423001385269012479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.347 × 10⁹⁹(100-digit number)
83477352692048889166…24846002770538024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.669 × 10¹⁰⁰(101-digit number)
16695470538409777833…49692005541076049919
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,782,197 XPM·at block #6,817,269 · 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