Block #277,999

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 7:34:57 PM · Difficulty 9.9678 · 6,555,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e6376e9ca3615e05e394a9e200eb1c4ed39415252518d0936222d8b193b1aa6

Height

#277,999

Difficulty

9.967760

Transactions

10

Size

2.12 KB

Version

2

Bits

09f7bf1e

Nonce

140,512

Timestamp

11/27/2013, 7:34:57 PM

Confirmations

6,555,376

Merkle Root

4a38aa71eb960ff5c4f40f4be21305df0dde319e80f04989f8dd5750bdb12ea7
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.

4.238 × 10⁹⁹(100-digit number)
42382613125433373457…18119305240988726161
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
4.238 × 10⁹⁹(100-digit number)
42382613125433373457…18119305240988726161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.476 × 10⁹⁹(100-digit number)
84765226250866746915…36238610481977452321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.695 × 10¹⁰⁰(101-digit number)
16953045250173349383…72477220963954904641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.390 × 10¹⁰⁰(101-digit number)
33906090500346698766…44954441927909809281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.781 × 10¹⁰⁰(101-digit number)
67812181000693397532…89908883855819618561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.356 × 10¹⁰¹(102-digit number)
13562436200138679506…79817767711639237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.712 × 10¹⁰¹(102-digit number)
27124872400277359013…59635535423278474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.424 × 10¹⁰¹(102-digit number)
54249744800554718026…19271070846556948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.084 × 10¹⁰²(103-digit number)
10849948960110943605…38542141693113896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.169 × 10¹⁰²(103-digit number)
21699897920221887210…77084283386227793921
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,911,197 XPM·at block #6,833,374 · 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.
Privacy Policy·

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