Block #285,396

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 11:48:28 AM · Difficulty 9.9842 · 6,521,103 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d8a53db161d07fdf139231dcd353b4bed18656a8f5809d71661095d0b2c7c68

Height

#285,396

Difficulty

9.984205

Transactions

1

Size

1.12 KB

Version

2

Bits

09fbf4dc

Nonce

185,843

Timestamp

11/30/2013, 11:48:28 AM

Confirmations

6,521,103

Merkle Root

225f47a7bde0b514203c6e533b503c7c47129933fcdcf421d0b9d3d0ddc0ed6b
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.367 × 10¹⁰⁴(105-digit number)
13679294560970298009…60425170575422279999
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.367 × 10¹⁰⁴(105-digit number)
13679294560970298009…60425170575422279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.735 × 10¹⁰⁴(105-digit number)
27358589121940596019…20850341150844559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.471 × 10¹⁰⁴(105-digit number)
54717178243881192038…41700682301689119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.094 × 10¹⁰⁵(106-digit number)
10943435648776238407…83401364603378239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.188 × 10¹⁰⁵(106-digit number)
21886871297552476815…66802729206756479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.377 × 10¹⁰⁵(106-digit number)
43773742595104953631…33605458413512959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.754 × 10¹⁰⁵(106-digit number)
87547485190209907262…67210916827025919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.750 × 10¹⁰⁶(107-digit number)
17509497038041981452…34421833654051839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.501 × 10¹⁰⁶(107-digit number)
35018994076083962904…68843667308103679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.003 × 10¹⁰⁶(107-digit number)
70037988152167925809…37687334616207359999
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,696,087 XPM·at block #6,806,498 · 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