Block #2,795,059

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/15/2018, 12:30:24 PM · Difficulty 11.6779 · 4,047,647 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6c7db1e63c4139173f18627ee53e813fcace44730df299960c3f94ae63677eb

Height

#2,795,059

Difficulty

11.677920

Transactions

7

Size

2.68 KB

Version

2

Bits

0bad8c28

Nonce

568,515,538

Timestamp

8/15/2018, 12:30:24 PM

Confirmations

4,047,647

Merkle Root

ac905cec720d96fc35a2c7f49bd272cd7c83a239c7af9c29ec4c8681ef6d29cc
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.189 × 10⁹⁵(96-digit number)
11891111910044972063…11596276265304259519
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.189 × 10⁹⁵(96-digit number)
11891111910044972063…11596276265304259519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.378 × 10⁹⁵(96-digit number)
23782223820089944127…23192552530608519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.756 × 10⁹⁵(96-digit number)
47564447640179888254…46385105061217038079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.512 × 10⁹⁵(96-digit number)
95128895280359776508…92770210122434076159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.902 × 10⁹⁶(97-digit number)
19025779056071955301…85540420244868152319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.805 × 10⁹⁶(97-digit number)
38051558112143910603…71080840489736304639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.610 × 10⁹⁶(97-digit number)
76103116224287821207…42161680979472609279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.522 × 10⁹⁷(98-digit number)
15220623244857564241…84323361958945218559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.044 × 10⁹⁷(98-digit number)
30441246489715128482…68646723917890437119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.088 × 10⁹⁷(98-digit number)
60882492979430256965…37293447835780874239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.217 × 10⁹⁸(99-digit number)
12176498595886051393…74586895671561748479
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,985,998 XPM·at block #6,842,705 · 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