Block #2,717,641

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/23/2018, 8:04:10 AM · Difficulty 11.6173 · 4,120,594 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
792ecac08f37455c1d3187e956f40c150ee42ba05d3f5c335946a411fada4929

Height

#2,717,641

Difficulty

11.617274

Transactions

2

Size

723 B

Version

2

Bits

0b9e05a9

Nonce

1,172,580,370

Timestamp

6/23/2018, 8:04:10 AM

Confirmations

4,120,594

Merkle Root

7be6f8d1d95278735a0392340a56fb92a72f918fb2465ea7833e05a6cca05811
Transactions (2)
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.877 × 10⁹⁷(98-digit number)
18776092607838366095…59806986695010524159
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.877 × 10⁹⁷(98-digit number)
18776092607838366095…59806986695010524159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.755 × 10⁹⁷(98-digit number)
37552185215676732191…19613973390021048319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.510 × 10⁹⁷(98-digit number)
75104370431353464383…39227946780042096639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.502 × 10⁹⁸(99-digit number)
15020874086270692876…78455893560084193279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.004 × 10⁹⁸(99-digit number)
30041748172541385753…56911787120168386559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.008 × 10⁹⁸(99-digit number)
60083496345082771506…13823574240336773119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.201 × 10⁹⁹(100-digit number)
12016699269016554301…27647148480673546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.403 × 10⁹⁹(100-digit number)
24033398538033108602…55294296961347092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.806 × 10⁹⁹(100-digit number)
48066797076066217205…10588593922694184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.613 × 10⁹⁹(100-digit number)
96133594152132434410…21177187845388369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.922 × 10¹⁰⁰(101-digit number)
19226718830426486882…42354375690776739839
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,950,155 XPM·at block #6,838,234 · 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