Block #437,664

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 11:13:56 AM · Difficulty 10.3581 · 6,372,275 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad72b668916636866e35b3f1e67437e0f9d355d40e9790284219fc2b1c3ac43d

Height

#437,664

Difficulty

10.358056

Transactions

1

Size

937 B

Version

2

Bits

0a5ba993

Nonce

5,868

Timestamp

3/10/2014, 11:13:56 AM

Confirmations

6,372,275

Merkle Root

9156da759c32e93588d7265f751c4ba8eb9abe3605af8d5c3383208c17834c0b
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.

8.027 × 10⁹⁸(99-digit number)
80277215398301300289…34127059165524655681
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
8.027 × 10⁹⁸(99-digit number)
80277215398301300289…34127059165524655681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.605 × 10⁹⁹(100-digit number)
16055443079660260057…68254118331049311361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.211 × 10⁹⁹(100-digit number)
32110886159320520115…36508236662098622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.422 × 10⁹⁹(100-digit number)
64221772318641040231…73016473324197245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.284 × 10¹⁰⁰(101-digit number)
12844354463728208046…46032946648394490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.568 × 10¹⁰⁰(101-digit number)
25688708927456416092…92065893296788981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.137 × 10¹⁰⁰(101-digit number)
51377417854912832185…84131786593577963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.027 × 10¹⁰¹(102-digit number)
10275483570982566437…68263573187155927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.055 × 10¹⁰¹(102-digit number)
20550967141965132874…36527146374311854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.110 × 10¹⁰¹(102-digit number)
41101934283930265748…73054292748623708161
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,723,600 XPM·at block #6,809,938 · 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