Block #2,676,168

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2018, 4:19:29 PM · Difficulty 11.6989 · 4,165,339 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8bd078ad08f0c429a2c417f18cbefeb72508b07d401af2fcc80ad1694220d6e6

Height

#2,676,168

Difficulty

11.698921

Transactions

16

Size

6.24 KB

Version

2

Bits

0bb2ec7e

Nonce

394,747,064

Timestamp

5/24/2018, 4:19:29 PM

Confirmations

4,165,339

Merkle Root

bc95d195b7594ed8074a42dbbc0f2e10a91275afa57c441f85884c6eb526c299
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.511 × 10⁹⁶(97-digit number)
65118287791614970014…07361851361756149759
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.511 × 10⁹⁶(97-digit number)
65118287791614970014…07361851361756149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.302 × 10⁹⁷(98-digit number)
13023657558322994002…14723702723512299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.604 × 10⁹⁷(98-digit number)
26047315116645988005…29447405447024599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.209 × 10⁹⁷(98-digit number)
52094630233291976011…58894810894049198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.041 × 10⁹⁸(99-digit number)
10418926046658395202…17789621788098396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.083 × 10⁹⁸(99-digit number)
20837852093316790404…35579243576196792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.167 × 10⁹⁸(99-digit number)
41675704186633580809…71158487152393584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.335 × 10⁹⁸(99-digit number)
83351408373267161619…42316974304787169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.667 × 10⁹⁹(100-digit number)
16670281674653432323…84633948609574338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.334 × 10⁹⁹(100-digit number)
33340563349306864647…69267897219148677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.668 × 10⁹⁹(100-digit number)
66681126698613729295…38535794438297354239
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,976,435 XPM·at block #6,841,506 · 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