Block #280,959

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 8:53:27 PM · Difficulty 9.9759 · 6,545,614 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
63d67b38083a89d2cbb5f7a79f4ce72d67e624913bd002f6e4ebfac3105bb6fb

Height

#280,959

Difficulty

9.975854

Transactions

4

Size

1.62 KB

Version

2

Bits

09f9d18c

Nonce

21,949

Timestamp

11/28/2013, 8:53:27 PM

Confirmations

6,545,614

Merkle Root

3139a3b5581749508d0ccf0c2a805eecd512b007286a564ca15a0bddd7f35457
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.

4.404 × 10⁹³(94-digit number)
44041225899980184069…12527340762385529599
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
4.404 × 10⁹³(94-digit number)
44041225899980184069…12527340762385529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.808 × 10⁹³(94-digit number)
88082451799960368138…25054681524771059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.761 × 10⁹⁴(95-digit number)
17616490359992073627…50109363049542118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.523 × 10⁹⁴(95-digit number)
35232980719984147255…00218726099084236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.046 × 10⁹⁴(95-digit number)
70465961439968294510…00437452198168473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.409 × 10⁹⁵(96-digit number)
14093192287993658902…00874904396336947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.818 × 10⁹⁵(96-digit number)
28186384575987317804…01749808792673894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.637 × 10⁹⁵(96-digit number)
56372769151974635608…03499617585347788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.127 × 10⁹⁶(97-digit number)
11274553830394927121…06999235170695577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.254 × 10⁹⁶(97-digit number)
22549107660789854243…13998470341391155199
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,856,733 XPM·at block #6,826,572 · 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