Block #343,579

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 6:41:22 PM · Difficulty 10.1804 · 6,481,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
328e78252e4cfacd974315190543714e5357701deaea83ded5321967defd8e3f

Height

#343,579

Difficulty

10.180359

Transactions

8

Size

3.77 KB

Version

2

Bits

0a2e2c02

Nonce

10,718

Timestamp

1/4/2014, 6:41:22 PM

Confirmations

6,481,009

Merkle Root

46491f12866892ddf3146940fc2d7ff95329432e5a4234b88fc7148094059e4f
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.

3.578 × 10⁹³(94-digit number)
35781576046944902795…46543385149435561921
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
3.578 × 10⁹³(94-digit number)
35781576046944902795…46543385149435561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.156 × 10⁹³(94-digit number)
71563152093889805591…93086770298871123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.431 × 10⁹⁴(95-digit number)
14312630418777961118…86173540597742247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.862 × 10⁹⁴(95-digit number)
28625260837555922236…72347081195484495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.725 × 10⁹⁴(95-digit number)
57250521675111844473…44694162390968990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.145 × 10⁹⁵(96-digit number)
11450104335022368894…89388324781937981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.290 × 10⁹⁵(96-digit number)
22900208670044737789…78776649563875962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.580 × 10⁹⁵(96-digit number)
45800417340089475578…57553299127751925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.160 × 10⁹⁵(96-digit number)
91600834680178951157…15106598255503851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.832 × 10⁹⁶(97-digit number)
18320166936035790231…30213196511007703041
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,840,771 XPM·at block #6,824,587 · 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