Block #278,012

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 7:44:29 PM · Difficulty 9.9678 · 6,528,714 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
86fa122976a6fcf1967f3e0ad00ca3f942ea597a91dd5b4a81686be679193fef

Height

#278,012

Difficulty

9.967778

Transactions

10

Size

2.65 KB

Version

2

Bits

09f7c04c

Nonce

1,046

Timestamp

11/27/2013, 7:44:29 PM

Confirmations

6,528,714

Merkle Root

b7b64d830c00592976f5cf48e9db0bde57c71df0c297ad8ac411ce98520d8abc
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.540 × 10¹⁰²(103-digit number)
25401921510854143097…90996712571202194401
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.540 × 10¹⁰²(103-digit number)
25401921510854143097…90996712571202194401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.080 × 10¹⁰²(103-digit number)
50803843021708286194…81993425142404388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.016 × 10¹⁰³(104-digit number)
10160768604341657238…63986850284808777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.032 × 10¹⁰³(104-digit number)
20321537208683314477…27973700569617555201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.064 × 10¹⁰³(104-digit number)
40643074417366628955…55947401139235110401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.128 × 10¹⁰³(104-digit number)
81286148834733257911…11894802278470220801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.625 × 10¹⁰⁴(105-digit number)
16257229766946651582…23789604556940441601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.251 × 10¹⁰⁴(105-digit number)
32514459533893303164…47579209113880883201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.502 × 10¹⁰⁴(105-digit number)
65028919067786606328…95158418227761766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.300 × 10¹⁰⁵(106-digit number)
13005783813557321265…90316836455523532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.601 × 10¹⁰⁵(106-digit number)
26011567627114642531…80633672911047065601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,697,905 XPM·at block #6,806,725 · 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