Block #452,130

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 9:35:09 AM · Difficulty 10.3865 · 6,357,519 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c69800f01ef7451f0bcea69ba02ab0d095cd485266883e76ae4427eb7ab8a239

Height

#452,130

Difficulty

10.386505

Transactions

2

Size

575 B

Version

2

Bits

0a62f1fb

Nonce

181,362

Timestamp

3/20/2014, 9:35:09 AM

Confirmations

6,357,519

Merkle Root

636d66d3c19598a271972ef71b3741027e4f3bb54fd420e62f155f694f87e690
Transactions (2)
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.663 × 10⁹⁶(97-digit number)
16632051380498678555…20107852968446950399
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.663 × 10⁹⁶(97-digit number)
16632051380498678555…20107852968446950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.326 × 10⁹⁶(97-digit number)
33264102760997357111…40215705936893900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.652 × 10⁹⁶(97-digit number)
66528205521994714222…80431411873787801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.330 × 10⁹⁷(98-digit number)
13305641104398942844…60862823747575603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.661 × 10⁹⁷(98-digit number)
26611282208797885689…21725647495151206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.322 × 10⁹⁷(98-digit number)
53222564417595771378…43451294990302412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.064 × 10⁹⁸(99-digit number)
10644512883519154275…86902589980604825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.128 × 10⁹⁸(99-digit number)
21289025767038308551…73805179961209651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.257 × 10⁹⁸(99-digit number)
42578051534076617102…47610359922419302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.515 × 10⁹⁸(99-digit number)
85156103068153234205…95220719844838604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.703 × 10⁹⁹(100-digit number)
17031220613630646841…90441439689677209599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,721,272 XPM·at block #6,809,648 · 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.

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