Block #335,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2013, 1:05:29 AM · Difficulty 10.1546 · 6,474,669 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd3bedcbc845301f216423e61ea7816e6309799569a721892515ff94468423f2

Height

#335,185

Difficulty

10.154634

Transactions

10

Size

2.44 KB

Version

2

Bits

0a27961e

Nonce

161,721

Timestamp

12/30/2013, 1:05:29 AM

Confirmations

6,474,669

Merkle Root

2755e16b7e5d1692d2d7cd579070102ff1e96e4d2907fb2f6dda39e11cd1d6a5
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.146 × 10⁹⁷(98-digit number)
31467726520508620495…57105205002199519281
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.146 × 10⁹⁷(98-digit number)
31467726520508620495…57105205002199519281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.293 × 10⁹⁷(98-digit number)
62935453041017240991…14210410004399038561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.258 × 10⁹⁸(99-digit number)
12587090608203448198…28420820008798077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.517 × 10⁹⁸(99-digit number)
25174181216406896396…56841640017596154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.034 × 10⁹⁸(99-digit number)
50348362432813792792…13683280035192308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.006 × 10⁹⁹(100-digit number)
10069672486562758558…27366560070384616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.013 × 10⁹⁹(100-digit number)
20139344973125517117…54733120140769233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.027 × 10⁹⁹(100-digit number)
40278689946251034234…09466240281538467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.055 × 10⁹⁹(100-digit number)
80557379892502068468…18932480563076935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.611 × 10¹⁰⁰(101-digit number)
16111475978500413693…37864961126153871361
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,722,919 XPM·at block #6,809,853 · 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