Block #396,470

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 10:31:17 AM · Difficulty 10.4125 · 6,413,765 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
23e8552b4c039206ae647de2179c41724b8686d716b99bf6e7243cb49618dddd

Height

#396,470

Difficulty

10.412474

Transactions

1

Size

801 B

Version

2

Bits

0a6997e2

Nonce

14,035

Timestamp

2/9/2014, 10:31:17 AM

Confirmations

6,413,765

Merkle Root

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

6.521 × 10⁹⁸(99-digit number)
65212456082895404918…92323453322052601601
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
6.521 × 10⁹⁸(99-digit number)
65212456082895404918…92323453322052601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.304 × 10⁹⁹(100-digit number)
13042491216579080983…84646906644105203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.608 × 10⁹⁹(100-digit number)
26084982433158161967…69293813288210406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.216 × 10⁹⁹(100-digit number)
52169964866316323934…38587626576420812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.043 × 10¹⁰⁰(101-digit number)
10433992973263264786…77175253152841625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.086 × 10¹⁰⁰(101-digit number)
20867985946526529573…54350506305683251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.173 × 10¹⁰⁰(101-digit number)
41735971893053059147…08701012611366502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.347 × 10¹⁰⁰(101-digit number)
83471943786106118295…17402025222733004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.669 × 10¹⁰¹(102-digit number)
16694388757221223659…34804050445466009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.338 × 10¹⁰¹(102-digit number)
33388777514442447318…69608100890932019201
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,725,957 XPM·at block #6,810,234 · 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