Block #359,337

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 5:08:00 PM · Difficulty 10.3893 · 6,452,931 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76a4d92bac1330aaa75f9896c959587e9ad7a4307f03996b982a2b5114607922

Height

#359,337

Difficulty

10.389300

Transactions

6

Size

4.49 KB

Version

2

Bits

0a63a927

Nonce

61,691

Timestamp

1/14/2014, 5:08:00 PM

Confirmations

6,452,931

Merkle Root

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

5.006 × 10⁹⁷(98-digit number)
50068878174408276332…91846966169693912421
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
5.006 × 10⁹⁷(98-digit number)
50068878174408276332…91846966169693912421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.001 × 10⁹⁸(99-digit number)
10013775634881655266…83693932339387824841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.002 × 10⁹⁸(99-digit number)
20027551269763310533…67387864678775649681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.005 × 10⁹⁸(99-digit number)
40055102539526621066…34775729357551299361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.011 × 10⁹⁸(99-digit number)
80110205079053242132…69551458715102598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.602 × 10⁹⁹(100-digit number)
16022041015810648426…39102917430205197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.204 × 10⁹⁹(100-digit number)
32044082031621296852…78205834860410394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.408 × 10⁹⁹(100-digit number)
64088164063242593705…56411669720820789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.281 × 10¹⁰⁰(101-digit number)
12817632812648518741…12823339441641579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.563 × 10¹⁰⁰(101-digit number)
25635265625297037482…25646678883283159041
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,742,161 XPM·at block #6,812,267 · 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