Block #2,637,735

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 12:57:18 AM · Difficulty 11.4570 · 4,194,325 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f75a650077cb4bae69318941b533efa1f8da3c77621d939ca056da25cc715e5a

Height

#2,637,735

Difficulty

11.457005

Transactions

5

Size

1.73 KB

Version

2

Bits

0b74fe4d

Nonce

960,408,715

Timestamp

4/30/2018, 12:57:18 AM

Confirmations

4,194,325

Merkle Root

5f5401df7b3e57107fe54e73302eb018d9c39acd863b7c7543af73d20ae5d72c
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.

8.869 × 10⁹⁴(95-digit number)
88691425705696158679…01927205369153077119
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
8.869 × 10⁹⁴(95-digit number)
88691425705696158679…01927205369153077119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.773 × 10⁹⁵(96-digit number)
17738285141139231735…03854410738306154239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.547 × 10⁹⁵(96-digit number)
35476570282278463471…07708821476612308479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.095 × 10⁹⁵(96-digit number)
70953140564556926943…15417642953224616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.419 × 10⁹⁶(97-digit number)
14190628112911385388…30835285906449233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.838 × 10⁹⁶(97-digit number)
28381256225822770777…61670571812898467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.676 × 10⁹⁶(97-digit number)
56762512451645541554…23341143625796935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.135 × 10⁹⁷(98-digit number)
11352502490329108310…46682287251593871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.270 × 10⁹⁷(98-digit number)
22705004980658216621…93364574503187742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.541 × 10⁹⁷(98-digit number)
45410009961316433243…86729149006375485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.082 × 10⁹⁷(98-digit number)
90820019922632866487…73458298012750970879
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,900,612 XPM·at block #6,832,059 · 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