Block #821,680

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/21/2014, 5:39:40 PM · Difficulty 10.9765 · 5,988,874 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03b80012009f77e0ef079c8653789ac7ece73a52d4ee0ebf48f2db6dadc0a171

Height

#821,680

Difficulty

10.976451

Transactions

13

Size

7.62 KB

Version

2

Bits

0af9f8ad

Nonce

1,519,803,856

Timestamp

11/21/2014, 5:39:40 PM

Confirmations

5,988,874

Merkle Root

312b52070d2934c74013319c79df6b9310c8165e97fbf0f25163dc7808c8bfbf
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.

3.982 × 10⁹⁷(98-digit number)
39820323071323313700…89766106194625198079
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
3.982 × 10⁹⁷(98-digit number)
39820323071323313700…89766106194625198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.964 × 10⁹⁷(98-digit number)
79640646142646627400…79532212389250396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.592 × 10⁹⁸(99-digit number)
15928129228529325480…59064424778500792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.185 × 10⁹⁸(99-digit number)
31856258457058650960…18128849557001584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.371 × 10⁹⁸(99-digit number)
63712516914117301920…36257699114003169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.274 × 10⁹⁹(100-digit number)
12742503382823460384…72515398228006338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.548 × 10⁹⁹(100-digit number)
25485006765646920768…45030796456012677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.097 × 10⁹⁹(100-digit number)
50970013531293841536…90061592912025354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.019 × 10¹⁰⁰(101-digit number)
10194002706258768307…80123185824050708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.038 × 10¹⁰⁰(101-digit number)
20388005412517536614…60246371648101416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.077 × 10¹⁰⁰(101-digit number)
40776010825035073229…20492743296202833919
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,728,521 XPM·at block #6,810,553 · 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