Block #280,844

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 7:52:43 PM · Difficulty 9.9756 · 6,558,988 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aab1b84061b566f406ac020a9e03d86fbe55af486c501baae01275d52cafdd7

Height

#280,844

Difficulty

9.975587

Transactions

4

Size

1.34 KB

Version

2

Bits

09f9c018

Nonce

44,695

Timestamp

11/28/2013, 7:52:43 PM

Confirmations

6,558,988

Merkle Root

baa59c7de3675e312742ec2794ee703891fc3f1bbcfa8b19ab25bb5822511fcd
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.129 × 10⁹⁶(97-digit number)
11295569846524502773…40935903533772024319
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.129 × 10⁹⁶(97-digit number)
11295569846524502773…40935903533772024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.259 × 10⁹⁶(97-digit number)
22591139693049005546…81871807067544048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.518 × 10⁹⁶(97-digit number)
45182279386098011093…63743614135088097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.036 × 10⁹⁶(97-digit number)
90364558772196022186…27487228270176194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.807 × 10⁹⁷(98-digit number)
18072911754439204437…54974456540352389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.614 × 10⁹⁷(98-digit number)
36145823508878408874…09948913080704778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.229 × 10⁹⁷(98-digit number)
72291647017756817749…19897826161409556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.445 × 10⁹⁸(99-digit number)
14458329403551363549…39795652322819112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.891 × 10⁹⁸(99-digit number)
28916658807102727099…79591304645638225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.783 × 10⁹⁸(99-digit number)
57833317614205454199…59182609291276451839
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,962,953 XPM·at block #6,839,831 · 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