Block #366,304

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2014, 8:04:30 AM · Difficulty 10.4287 · 6,442,810 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fe6e8950aad8f3ac0eaa31256b0efaaf67cbe7e3df182d291b14d0d2a0391f51

Height

#366,304

Difficulty

10.428708

Transactions

10

Size

9.13 KB

Version

2

Bits

0a6dbfd7

Nonce

9,866

Timestamp

1/19/2014, 8:04:30 AM

Confirmations

6,442,810

Merkle Root

41a064be40b67b6a29a864a05faee573680ffeb6b76bc5223717b236986b7fa7
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.

2.116 × 10⁹⁶(97-digit number)
21169427818313728998…32911612076934296801
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
2.116 × 10⁹⁶(97-digit number)
21169427818313728998…32911612076934296801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.233 × 10⁹⁶(97-digit number)
42338855636627457997…65823224153868593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.467 × 10⁹⁶(97-digit number)
84677711273254915995…31646448307737187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.693 × 10⁹⁷(98-digit number)
16935542254650983199…63292896615474374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.387 × 10⁹⁷(98-digit number)
33871084509301966398…26585793230948748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.774 × 10⁹⁷(98-digit number)
67742169018603932796…53171586461897497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.354 × 10⁹⁸(99-digit number)
13548433803720786559…06343172923794995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.709 × 10⁹⁸(99-digit number)
27096867607441573118…12686345847589990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.419 × 10⁹⁸(99-digit number)
54193735214883146237…25372691695179980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.083 × 10⁹⁹(100-digit number)
10838747042976629247…50745383390359961601
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,716,969 XPM·at block #6,809,113 · 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