Block #284,749

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 5:58:08 AM · Difficulty 9.9832 · 6,521,639 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d6331343724f3b072d5a9a27a343c33016e1af159e7d4e5dc2b336843f1d23f

Height

#284,749

Difficulty

9.983224

Transactions

5

Size

1.22 KB

Version

2

Bits

09fbb494

Nonce

3,781

Timestamp

11/30/2013, 5:58:08 AM

Confirmations

6,521,639

Merkle Root

ecb688010eecfb41294958e3488f58e57a23160c8485d5eb43fd2ce6968cf324
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.179 × 10¹⁰⁵(106-digit number)
11796366077723296097…81093872943001084499
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.179 × 10¹⁰⁵(106-digit number)
11796366077723296097…81093872943001084499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.359 × 10¹⁰⁵(106-digit number)
23592732155446592195…62187745886002168999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.718 × 10¹⁰⁵(106-digit number)
47185464310893184390…24375491772004337999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.437 × 10¹⁰⁵(106-digit number)
94370928621786368780…48750983544008675999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.887 × 10¹⁰⁶(107-digit number)
18874185724357273756…97501967088017351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.774 × 10¹⁰⁶(107-digit number)
37748371448714547512…95003934176034703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.549 × 10¹⁰⁶(107-digit number)
75496742897429095024…90007868352069407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.509 × 10¹⁰⁷(108-digit number)
15099348579485819004…80015736704138815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.019 × 10¹⁰⁷(108-digit number)
30198697158971638009…60031473408277631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.039 × 10¹⁰⁷(108-digit number)
60397394317943276019…20062946816555263999
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,695,194 XPM·at block #6,806,387 · 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