Block #2,697,947

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/9/2018, 8:08:17 AM · Difficulty 11.6501 · 4,135,035 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
18a05c5c56e1839375b7300a4315a5e4603ac92d306a9d36c27f9ba708ae1c88

Height

#2,697,947

Difficulty

11.650090

Transactions

5

Size

1.22 KB

Version

2

Bits

0ba66c50

Nonce

187,883,606

Timestamp

6/9/2018, 8:08:17 AM

Confirmations

4,135,035

Merkle Root

6c35949d54008ac13c16b99a624e42335f72ef4ce94b15e924e2b482b0fbd6aa
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.135 × 10⁹⁶(97-digit number)
11353648326421376535…09533269644815667199
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.135 × 10⁹⁶(97-digit number)
11353648326421376535…09533269644815667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.270 × 10⁹⁶(97-digit number)
22707296652842753070…19066539289631334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.541 × 10⁹⁶(97-digit number)
45414593305685506141…38133078579262668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.082 × 10⁹⁶(97-digit number)
90829186611371012282…76266157158525337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.816 × 10⁹⁷(98-digit number)
18165837322274202456…52532314317050675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.633 × 10⁹⁷(98-digit number)
36331674644548404912…05064628634101350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.266 × 10⁹⁷(98-digit number)
72663349289096809825…10129257268202700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.453 × 10⁹⁸(99-digit number)
14532669857819361965…20258514536405401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.906 × 10⁹⁸(99-digit number)
29065339715638723930…40517029072810803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.813 × 10⁹⁸(99-digit number)
58130679431277447860…81034058145621606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.162 × 10⁹⁹(100-digit number)
11626135886255489572…62068116291243212799
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,908,036 XPM·at block #6,832,981 · 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