Block #830,977

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2014, 8:33:07 PM · Difficulty 10.9789 · 5,978,907 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af24aa476769b5b252f2d29f0f56350b34765c5416efcd07758c4c6a62dc2c91

Height

#830,977

Difficulty

10.978894

Transactions

6

Size

2.61 KB

Version

2

Bits

0afa98cc

Nonce

911,084,894

Timestamp

11/27/2014, 8:33:07 PM

Confirmations

5,978,907

Merkle Root

2a5e4ffaf562525cedc294c56b9671dc5f14ad11bd34d86295d6c4b3f11c8f4a
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.545 × 10⁹⁷(98-digit number)
15453015573920158253…74605420256394772479
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.545 × 10⁹⁷(98-digit number)
15453015573920158253…74605420256394772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.090 × 10⁹⁷(98-digit number)
30906031147840316506…49210840512789544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.181 × 10⁹⁷(98-digit number)
61812062295680633013…98421681025579089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.236 × 10⁹⁸(99-digit number)
12362412459136126602…96843362051158179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.472 × 10⁹⁸(99-digit number)
24724824918272253205…93686724102316359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.944 × 10⁹⁸(99-digit number)
49449649836544506410…87373448204632719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.889 × 10⁹⁸(99-digit number)
98899299673089012821…74746896409265438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.977 × 10⁹⁹(100-digit number)
19779859934617802564…49493792818530877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.955 × 10⁹⁹(100-digit number)
39559719869235605128…98987585637061754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.911 × 10⁹⁹(100-digit number)
79119439738471210256…97975171274123509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.582 × 10¹⁰⁰(101-digit number)
15823887947694242051…95950342548247019519
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,723,159 XPM·at block #6,809,883 · 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