Block #279,557

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 9:33:50 AM · Difficulty 9.9721 · 6,531,547 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
03f88f4f5e0973c3697e6674f800a4a98e4538a5fa6ff9b7020a3fd48fafe140

Height

#279,557

Difficulty

9.972089

Transactions

11

Size

13.88 KB

Version

2

Bits

09f8dacd

Nonce

6,836

Timestamp

11/28/2013, 9:33:50 AM

Confirmations

6,531,547

Merkle Root

62ecbfbbf27ed28529f0b609002ec2ffb7696f092154904f226c0097b86e58bc
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.

6.552 × 10⁹²(93-digit number)
65525382737292725643…90809440134132858081
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
6.552 × 10⁹²(93-digit number)
65525382737292725643…90809440134132858081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.310 × 10⁹³(94-digit number)
13105076547458545128…81618880268265716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.621 × 10⁹³(94-digit number)
26210153094917090257…63237760536531432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.242 × 10⁹³(94-digit number)
52420306189834180514…26475521073062864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.048 × 10⁹⁴(95-digit number)
10484061237966836102…52951042146125729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.096 × 10⁹⁴(95-digit number)
20968122475933672205…05902084292251458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.193 × 10⁹⁴(95-digit number)
41936244951867344411…11804168584502917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.387 × 10⁹⁴(95-digit number)
83872489903734688823…23608337169005834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.677 × 10⁹⁵(96-digit number)
16774497980746937764…47216674338011668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.354 × 10⁹⁵(96-digit number)
33548995961493875529…94433348676023336961
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,732,939 XPM·at block #6,811,103 · 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