Block #336,661

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 2:59:22 AM · Difficulty 10.1421 · 6,470,520 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c0757bea22c6f1691db3808ed8fce9e8a13ba40ba837fbffaeae6f5ab6339a9

Height

#336,661

Difficulty

10.142114

Transactions

8

Size

1.89 KB

Version

2

Bits

0a246190

Nonce

266,240

Timestamp

12/31/2013, 2:59:22 AM

Confirmations

6,470,520

Merkle Root

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

9.799 × 10⁹⁷(98-digit number)
97990836480772011582…43306934157418732481
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
9.799 × 10⁹⁷(98-digit number)
97990836480772011582…43306934157418732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.959 × 10⁹⁸(99-digit number)
19598167296154402316…86613868314837464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.919 × 10⁹⁸(99-digit number)
39196334592308804633…73227736629674929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.839 × 10⁹⁸(99-digit number)
78392669184617609266…46455473259349859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.567 × 10⁹⁹(100-digit number)
15678533836923521853…92910946518699719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.135 × 10⁹⁹(100-digit number)
31357067673847043706…85821893037399439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.271 × 10⁹⁹(100-digit number)
62714135347694087412…71643786074798878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.254 × 10¹⁰⁰(101-digit number)
12542827069538817482…43287572149597757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.508 × 10¹⁰⁰(101-digit number)
25085654139077634965…86575144299195514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.017 × 10¹⁰⁰(101-digit number)
50171308278155269930…73150288598391029761
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,701,459 XPM·at block #6,807,180 · 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