Block #287,698

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2013, 10:36:55 AM · Difficulty 9.9869 · 6,521,924 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e25df5f590b054bb87c4167bcc137de2466e68c1ebfed3b2459ec68bd979aed

Height

#287,698

Difficulty

9.986937

Transactions

16

Size

6.68 KB

Version

2

Bits

09fca7ea

Nonce

18,920

Timestamp

12/1/2013, 10:36:55 AM

Confirmations

6,521,924

Merkle Root

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

8.006 × 10¹⁰⁵(106-digit number)
80061679491197364404…71405452704421939199
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
8.006 × 10¹⁰⁵(106-digit number)
80061679491197364404…71405452704421939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.601 × 10¹⁰⁶(107-digit number)
16012335898239472880…42810905408843878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.202 × 10¹⁰⁶(107-digit number)
32024671796478945761…85621810817687756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.404 × 10¹⁰⁶(107-digit number)
64049343592957891523…71243621635375513599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.280 × 10¹⁰⁷(108-digit number)
12809868718591578304…42487243270751027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.561 × 10¹⁰⁷(108-digit number)
25619737437183156609…84974486541502054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.123 × 10¹⁰⁷(108-digit number)
51239474874366313218…69948973083004108799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.024 × 10¹⁰⁸(109-digit number)
10247894974873262643…39897946166008217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.049 × 10¹⁰⁸(109-digit number)
20495789949746525287…79795892332016435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.099 × 10¹⁰⁸(109-digit number)
40991579899493050574…59591784664032870399
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,721,054 XPM·at block #6,809,621 · 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