Block #281,909

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 4:59:08 AM · Difficulty 9.9780 · 6,534,040 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
336c356c4230d42d09af1a4b3bf6c8188bbd7ebde3bbc15b00fcd04f4df2d44c

Height

#281,909

Difficulty

9.978006

Transactions

1

Size

1.18 KB

Version

2

Bits

09fa5e92

Nonce

49,553

Timestamp

11/29/2013, 4:59:08 AM

Confirmations

6,534,040

Merkle Root

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

2.657 × 10⁸⁹(90-digit number)
26575884335575622306…12225468070275763199
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
2.657 × 10⁸⁹(90-digit number)
26575884335575622306…12225468070275763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.315 × 10⁸⁹(90-digit number)
53151768671151244612…24450936140551526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.063 × 10⁹⁰(91-digit number)
10630353734230248922…48901872281103052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.126 × 10⁹⁰(91-digit number)
21260707468460497844…97803744562206105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.252 × 10⁹⁰(91-digit number)
42521414936920995689…95607489124412211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.504 × 10⁹⁰(91-digit number)
85042829873841991379…91214978248824422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.700 × 10⁹¹(92-digit number)
17008565974768398275…82429956497648844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.401 × 10⁹¹(92-digit number)
34017131949536796551…64859912995297689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.803 × 10⁹¹(92-digit number)
68034263899073593103…29719825990595379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.360 × 10⁹²(93-digit number)
13606852779814718620…59439651981190758399
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,771,707 XPM·at block #6,815,948 · 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