Block #285,397

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 11:48:27 AM · Difficulty 9.9842 · 6,520,913 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ddf039422ac9249faae20c639a469d5234d9c2446dd17568c8d7c8e8c8cb638

Height

#285,397

Difficulty

9.984205

Transactions

2

Size

1.61 KB

Version

2

Bits

09fbf4d8

Nonce

30,354

Timestamp

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

Confirmations

6,520,913

Merkle Root

05431b4d7b0ebe763e39f9bd86bb429e353dd6436dc50de1ceb2b0cb8b05d54c
Transactions (2)
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.064 × 10¹⁰³(104-digit number)
40642958448514447080…45134075322546105849
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.064 × 10¹⁰³(104-digit number)
40642958448514447080…45134075322546105849
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.128 × 10¹⁰³(104-digit number)
81285916897028894161…90268150645092211699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.625 × 10¹⁰⁴(105-digit number)
16257183379405778832…80536301290184423399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.251 × 10¹⁰⁴(105-digit number)
32514366758811557664…61072602580368846799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.502 × 10¹⁰⁴(105-digit number)
65028733517623115329…22145205160737693599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.300 × 10¹⁰⁵(106-digit number)
13005746703524623065…44290410321475387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.601 × 10¹⁰⁵(106-digit number)
26011493407049246131…88580820642950774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.202 × 10¹⁰⁵(106-digit number)
52022986814098492263…77161641285901548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.040 × 10¹⁰⁶(107-digit number)
10404597362819698452…54323282571803097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.080 × 10¹⁰⁶(107-digit number)
20809194725639396905…08646565143606195199
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,694,568 XPM·at block #6,806,309 · 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