Block #2,821,546

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2018, 3:22:00 PM · Difficulty 11.7031 · 4,020,665 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db3c5e520350704b8861644046c3126b5158331927e8854048e08eb9f9da3982

Height

#2,821,546

Difficulty

11.703127

Transactions

11

Size

4.34 KB

Version

2

Bits

0bb4001c

Nonce

647,608,403

Timestamp

9/2/2018, 3:22:00 PM

Confirmations

4,020,665

Merkle Root

6f718f3f75020f474713296e357fb711a1eec593a29610d103c1d1ca89f22b10
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.

6.731 × 10⁹²(93-digit number)
67318752767081740230…78704469268129181299
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
6.731 × 10⁹²(93-digit number)
67318752767081740230…78704469268129181299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.346 × 10⁹³(94-digit number)
13463750553416348046…57408938536258362599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.692 × 10⁹³(94-digit number)
26927501106832696092…14817877072516725199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.385 × 10⁹³(94-digit number)
53855002213665392184…29635754145033450399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.077 × 10⁹⁴(95-digit number)
10771000442733078436…59271508290066900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.154 × 10⁹⁴(95-digit number)
21542000885466156873…18543016580133801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.308 × 10⁹⁴(95-digit number)
43084001770932313747…37086033160267603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.616 × 10⁹⁴(95-digit number)
86168003541864627494…74172066320535206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.723 × 10⁹⁵(96-digit number)
17233600708372925498…48344132641070412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.446 × 10⁹⁵(96-digit number)
34467201416745850997…96688265282140825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.893 × 10⁹⁵(96-digit number)
68934402833491701995…93376530564281651199
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,982,084 XPM·at block #6,842,210 · 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.
Privacy Policy·

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