Block #2,165,055

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2017, 10:28:12 PM · Difficulty 10.8980 · 4,677,160 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e219d4c08cf8f3ab69273ee4e1a2b8fbb7784cdb65acd9ac11cdb0b19a326926

Height

#2,165,055

Difficulty

10.898016

Transactions

2

Size

870 B

Version

2

Bits

0ae5e466

Nonce

333,724,719

Timestamp

6/17/2017, 10:28:12 PM

Confirmations

4,677,160

Merkle Root

6f716425f538da5c7641e387bf83233bac1b21d7b332a4cc9664daf98db9c3d6
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.

3.508 × 10⁹⁵(96-digit number)
35089074194738635524…25354588301901840639
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
3.508 × 10⁹⁵(96-digit number)
35089074194738635524…25354588301901840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.017 × 10⁹⁵(96-digit number)
70178148389477271049…50709176603803681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.403 × 10⁹⁶(97-digit number)
14035629677895454209…01418353207607362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.807 × 10⁹⁶(97-digit number)
28071259355790908419…02836706415214725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.614 × 10⁹⁶(97-digit number)
56142518711581816839…05673412830429450239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.122 × 10⁹⁷(98-digit number)
11228503742316363367…11346825660858900479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.245 × 10⁹⁷(98-digit number)
22457007484632726735…22693651321717800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.491 × 10⁹⁷(98-digit number)
44914014969265453471…45387302643435601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.982 × 10⁹⁷(98-digit number)
89828029938530906943…90774605286871203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.796 × 10⁹⁸(99-digit number)
17965605987706181388…81549210573742407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.593 × 10⁹⁸(99-digit number)
35931211975412362777…63098421147484815359
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,982,117 XPM·at block #6,842,214 · 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