Block #353,602

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 1:13:15 AM · Difficulty 10.3286 · 6,463,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
87167ea1c4153a38486d3fb91079ef388b7799664d5fc98a4d5314d468bc288e

Height

#353,602

Difficulty

10.328595

Transactions

20

Size

11.79 KB

Version

2

Bits

0a541ecf

Nonce

152,019

Timestamp

1/11/2014, 1:13:15 AM

Confirmations

6,463,153

Merkle Root

ba4dd64a990c0b844b266a3e231c58da733df0465f8519a703c5d78ed463cc38
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.725 × 10⁹¹(92-digit number)
17258876731387210390…35496455072913954161
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.725 × 10⁹¹(92-digit number)
17258876731387210390…35496455072913954161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.451 × 10⁹¹(92-digit number)
34517753462774420780…70992910145827908321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.903 × 10⁹¹(92-digit number)
69035506925548841561…41985820291655816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.380 × 10⁹²(93-digit number)
13807101385109768312…83971640583311633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.761 × 10⁹²(93-digit number)
27614202770219536624…67943281166623266561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.522 × 10⁹²(93-digit number)
55228405540439073248…35886562333246533121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.104 × 10⁹³(94-digit number)
11045681108087814649…71773124666493066241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.209 × 10⁹³(94-digit number)
22091362216175629299…43546249332986132481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.418 × 10⁹³(94-digit number)
44182724432351258599…87092498665972264961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.836 × 10⁹³(94-digit number)
88365448864702517198…74184997331944529921
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,778,071 XPM·at block #6,816,754 · 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