Block #781,453

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/24/2014, 5:41:40 PM · Difficulty 10.9756 · 6,028,039 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
10e862b5737f4ab627f4c0827c1e4be8439ff08de2055024b034bb1a8569bf9b

Height

#781,453

Difficulty

10.975631

Transactions

7

Size

1.81 KB

Version

2

Bits

0af9c2f0

Nonce

385,298,375

Timestamp

10/24/2014, 5:41:40 PM

Confirmations

6,028,039

Merkle Root

178eabdf711443fee89b86750bcc9ae8a1ae80ac8db68c8d31b439ab902cc7a7
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.631 × 10⁹⁷(98-digit number)
16313639777881407781…63134627632775999999
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.631 × 10⁹⁷(98-digit number)
16313639777881407781…63134627632775999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.262 × 10⁹⁷(98-digit number)
32627279555762815563…26269255265551999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.525 × 10⁹⁷(98-digit number)
65254559111525631127…52538510531103999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.305 × 10⁹⁸(99-digit number)
13050911822305126225…05077021062207999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.610 × 10⁹⁸(99-digit number)
26101823644610252451…10154042124415999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.220 × 10⁹⁸(99-digit number)
52203647289220504902…20308084248831999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.044 × 10⁹⁹(100-digit number)
10440729457844100980…40616168497663999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.088 × 10⁹⁹(100-digit number)
20881458915688201960…81232336995327999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.176 × 10⁹⁹(100-digit number)
41762917831376403921…62464673990655999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.352 × 10⁹⁹(100-digit number)
83525835662752807843…24929347981311999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.670 × 10¹⁰⁰(101-digit number)
16705167132550561568…49858695962623999999
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,720,009 XPM·at block #6,809,491 · 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