Block #276,278

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 2:47:38 AM · Difficulty 9.9628 · 6,532,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eefa88bea3dccb807ca67bfe049bad360e34e67b6c3bec60713236b067bc4507

Height

#276,278

Difficulty

9.962773

Transactions

1

Size

1.14 KB

Version

2

Bits

09f67849

Nonce

155,685

Timestamp

11/27/2013, 2:47:38 AM

Confirmations

6,532,574

Merkle Root

d71aca07dc193e1dd1d6b700618ba8b3a43eb4ac20cd3229ee84b2f0f749df47
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.

9.395 × 10⁹²(93-digit number)
93952629283120591130…54472975792977386501
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
9.395 × 10⁹²(93-digit number)
93952629283120591130…54472975792977386501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.879 × 10⁹³(94-digit number)
18790525856624118226…08945951585954773001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.758 × 10⁹³(94-digit number)
37581051713248236452…17891903171909546001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.516 × 10⁹³(94-digit number)
75162103426496472904…35783806343819092001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.503 × 10⁹⁴(95-digit number)
15032420685299294580…71567612687638184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.006 × 10⁹⁴(95-digit number)
30064841370598589161…43135225375276368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.012 × 10⁹⁴(95-digit number)
60129682741197178323…86270450750552736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.202 × 10⁹⁵(96-digit number)
12025936548239435664…72540901501105472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.405 × 10⁹⁵(96-digit number)
24051873096478871329…45081803002210944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.810 × 10⁹⁵(96-digit number)
48103746192957742658…90163606004421888001
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,714,865 XPM·at block #6,808,851 · 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