Block #279,293

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 7:26:50 AM · Difficulty 9.9713 · 6,562,872 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9ecce6bda11749ce82844208e83714c9b164037fc49cf11c5976e6844e690183

Height

#279,293

Difficulty

9.971313

Transactions

2

Size

4.74 KB

Version

2

Bits

09f8a7f2

Nonce

66,718

Timestamp

11/28/2013, 7:26:50 AM

Confirmations

6,562,872

Merkle Root

7b64f9bdff6731af9834e29c9bc4503565d12cad0003b8aed014828cf5c31b4e
Transactions (2)
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.

1.552 × 10⁹⁶(97-digit number)
15529013695905946004…46624635894065469439
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
1.552 × 10⁹⁶(97-digit number)
15529013695905946004…46624635894065469439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.105 × 10⁹⁶(97-digit number)
31058027391811892008…93249271788130938879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.211 × 10⁹⁶(97-digit number)
62116054783623784016…86498543576261877759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.242 × 10⁹⁷(98-digit number)
12423210956724756803…72997087152523755519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.484 × 10⁹⁷(98-digit number)
24846421913449513606…45994174305047511039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.969 × 10⁹⁷(98-digit number)
49692843826899027213…91988348610095022079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.938 × 10⁹⁷(98-digit number)
99385687653798054426…83976697220190044159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.987 × 10⁹⁸(99-digit number)
19877137530759610885…67953394440380088319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.975 × 10⁹⁸(99-digit number)
39754275061519221770…35906788880760176639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.950 × 10⁹⁸(99-digit number)
79508550123038443541…71813577761520353279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,981,711 XPM·at block #6,842,164 · 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