Block #437,567

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 9:39:26 AM · Difficulty 10.3576 · 6,387,734 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7a4ba33ffec3b6d15b1ad14b7b80a4dc32459c8cdfb0a3f9e0acb2ef0fc1c0ab

Height

#437,567

Difficulty

10.357588

Transactions

2

Size

1.10 KB

Version

2

Bits

0a5b8ae2

Nonce

887

Timestamp

3/10/2014, 9:39:26 AM

Confirmations

6,387,734

Merkle Root

5c7672e5e9179cb2cf73261c0f5c307c8735512b29197530e77fbaaa3f5a1d23
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.809 × 10⁹⁷(98-digit number)
48095602713452213538…81002425598634626881
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.809 × 10⁹⁷(98-digit number)
48095602713452213538…81002425598634626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.619 × 10⁹⁷(98-digit number)
96191205426904427076…62004851197269253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.923 × 10⁹⁸(99-digit number)
19238241085380885415…24009702394538507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.847 × 10⁹⁸(99-digit number)
38476482170761770830…48019404789077015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.695 × 10⁹⁸(99-digit number)
76952964341523541661…96038809578154030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.539 × 10⁹⁹(100-digit number)
15390592868304708332…92077619156308060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.078 × 10⁹⁹(100-digit number)
30781185736609416664…84155238312616120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.156 × 10⁹⁹(100-digit number)
61562371473218833329…68310476625232240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.231 × 10¹⁰⁰(101-digit number)
12312474294643766665…36620953250464481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.462 × 10¹⁰⁰(101-digit number)
24624948589287533331…73241906500928962561
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,846,509 XPM·at block #6,825,300 · 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