Block #343,212

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 1:13:50 PM · Difficulty 10.1710 · 6,463,111 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
169f6e8ba0ea3e31844d7614336e2535ad203a8f7f0dfe2e2ab330ce41ed6821

Height

#343,212

Difficulty

10.171042

Transactions

16

Size

25.66 KB

Version

2

Bits

0a2bc96a

Nonce

44,948

Timestamp

1/4/2014, 1:13:50 PM

Confirmations

6,463,111

Merkle Root

bdca163ad68c37a76389a8c943b0bca6324e6deb93591f05c5e70ba4129e61f8
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.299 × 10⁹⁰(91-digit number)
12993000567256661469…71413868178322524001
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.299 × 10⁹⁰(91-digit number)
12993000567256661469…71413868178322524001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.598 × 10⁹⁰(91-digit number)
25986001134513322938…42827736356645048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.197 × 10⁹⁰(91-digit number)
51972002269026645877…85655472713290096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.039 × 10⁹¹(92-digit number)
10394400453805329175…71310945426580192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.078 × 10⁹¹(92-digit number)
20788800907610658351…42621890853160384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.157 × 10⁹¹(92-digit number)
41577601815221316702…85243781706320768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.315 × 10⁹¹(92-digit number)
83155203630442633404…70487563412641536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.663 × 10⁹²(93-digit number)
16631040726088526680…40975126825283072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.326 × 10⁹²(93-digit number)
33262081452177053361…81950253650566144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.652 × 10⁹²(93-digit number)
66524162904354106723…63900507301132288001
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,694,666 XPM·at block #6,806,322 · 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