Block #902,034

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2015, 1:08:34 AM · Difficulty 10.9406 · 5,904,526 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6fa6380e30d183ff26f18ad48b1c2c084c787281b04a7ed62c49b393582f5d43

Height

#902,034

Difficulty

10.940590

Transactions

3

Size

658 B

Version

2

Bits

0af0ca81

Nonce

60,654,627

Timestamp

1/20/2015, 1:08:34 AM

Confirmations

5,904,526

Merkle Root

2e6a52231c6d648779718f712589211b8a6429fa6df585768905812cd8480c9d
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.

5.181 × 10⁹⁴(95-digit number)
51815256443467829412…99895008697959462249
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
5.181 × 10⁹⁴(95-digit number)
51815256443467829412…99895008697959462249
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.036 × 10⁹⁵(96-digit number)
10363051288693565882…99790017395918924499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.072 × 10⁹⁵(96-digit number)
20726102577387131765…99580034791837848999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.145 × 10⁹⁵(96-digit number)
41452205154774263530…99160069583675697999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.290 × 10⁹⁵(96-digit number)
82904410309548527060…98320139167351395999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.658 × 10⁹⁶(97-digit number)
16580882061909705412…96640278334702791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.316 × 10⁹⁶(97-digit number)
33161764123819410824…93280556669405583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.632 × 10⁹⁶(97-digit number)
66323528247638821648…86561113338811167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.326 × 10⁹⁷(98-digit number)
13264705649527764329…73122226677622335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.652 × 10⁹⁷(98-digit number)
26529411299055528659…46244453355244671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.305 × 10⁹⁷(98-digit number)
53058822598111057318…92488906710489343999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,576 XPM·at block #6,806,559 · 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