Block #2,113,579

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 2:06:57 AM · Difficulty 10.8993 · 4,729,949 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f4c7a960007e331dfa668d7371df5524fccdb3d861e9094d57365d06793f7c78

Height

#2,113,579

Difficulty

10.899277

Transactions

7

Size

2.75 KB

Version

2

Bits

0ae6370a

Nonce

151,527,497

Timestamp

5/13/2017, 2:06:57 AM

Confirmations

4,729,949

Merkle Root

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

2.146 × 10⁹⁵(96-digit number)
21463586118408128985…15934165428681789599
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
2.146 × 10⁹⁵(96-digit number)
21463586118408128985…15934165428681789599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.292 × 10⁹⁵(96-digit number)
42927172236816257970…31868330857363579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.585 × 10⁹⁵(96-digit number)
85854344473632515940…63736661714727158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.717 × 10⁹⁶(97-digit number)
17170868894726503188…27473323429454316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.434 × 10⁹⁶(97-digit number)
34341737789453006376…54946646858908633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.868 × 10⁹⁶(97-digit number)
68683475578906012752…09893293717817267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.373 × 10⁹⁷(98-digit number)
13736695115781202550…19786587435634534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.747 × 10⁹⁷(98-digit number)
27473390231562405101…39573174871269068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.494 × 10⁹⁷(98-digit number)
54946780463124810202…79146349742538137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.098 × 10⁹⁸(99-digit number)
10989356092624962040…58292699485076275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.197 × 10⁹⁸(99-digit number)
21978712185249924080…16585398970152550399
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,992,601 XPM·at block #6,843,527 · 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