Block #278,977

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 4:48:45 AM · Difficulty 9.9704 · 6,531,120 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a6cc4981318db9d930234e57c4c3f576b4da3f34bbc970f2dfbfe34769ce1f3a

Height

#278,977

Difficulty

9.970387

Transactions

1

Size

1.04 KB

Version

2

Bits

09f86b41

Nonce

237,564

Timestamp

11/28/2013, 4:48:45 AM

Confirmations

6,531,120

Merkle Root

842ed5a27ef41f8b89a7e555ac616d8c491a2ae83b07bdf1871b316d9694d058
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.610 × 10⁹²(93-digit number)
36101891250945255912…77422569868642650541
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.610 × 10⁹²(93-digit number)
36101891250945255912…77422569868642650541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.220 × 10⁹²(93-digit number)
72203782501890511825…54845139737285301081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.444 × 10⁹³(94-digit number)
14440756500378102365…09690279474570602161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.888 × 10⁹³(94-digit number)
28881513000756204730…19380558949141204321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.776 × 10⁹³(94-digit number)
57763026001512409460…38761117898282408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.155 × 10⁹⁴(95-digit number)
11552605200302481892…77522235796564817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.310 × 10⁹⁴(95-digit number)
23105210400604963784…55044471593129634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.621 × 10⁹⁴(95-digit number)
46210420801209927568…10088943186259269121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.242 × 10⁹⁴(95-digit number)
92420841602419855136…20177886372518538241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.848 × 10⁹⁵(96-digit number)
18484168320483971027…40355772745037076481
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,724,851 XPM·at block #6,810,096 · 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