Block #280,821

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 7:35:54 PM · Difficulty 9.9756 · 6,529,751 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ff5778cf288d9ea14e8468687baf270ed951c1bb9bb06797ef8db3200724032

Height

#280,821

Difficulty

9.975556

Transactions

1

Size

1.11 KB

Version

2

Bits

09f9be02

Nonce

20,411

Timestamp

11/28/2013, 7:35:54 PM

Confirmations

6,529,751

Merkle Root

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

3.475 × 10⁹⁸(99-digit number)
34752393099162466629…84618984766587223039
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
3.475 × 10⁹⁸(99-digit number)
34752393099162466629…84618984766587223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.950 × 10⁹⁸(99-digit number)
69504786198324933258…69237969533174446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.390 × 10⁹⁹(100-digit number)
13900957239664986651…38475939066348892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.780 × 10⁹⁹(100-digit number)
27801914479329973303…76951878132697784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.560 × 10⁹⁹(100-digit number)
55603828958659946606…53903756265395568639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.112 × 10¹⁰⁰(101-digit number)
11120765791731989321…07807512530791137279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.224 × 10¹⁰⁰(101-digit number)
22241531583463978642…15615025061582274559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.448 × 10¹⁰⁰(101-digit number)
44483063166927957285…31230050123164549119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.896 × 10¹⁰⁰(101-digit number)
88966126333855914570…62460100246329098239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.779 × 10¹⁰¹(102-digit number)
17793225266771182914…24920200492658196479
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,728,668 XPM·at block #6,810,571 · 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