Block #2,634,517

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 10:30:13 PM · Difficulty 11.2494 · 4,198,948 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
58101c34ebc2fdd3ee5138437800e19c3c5689040b0bf954a753e46e0fc86fe1

Height

#2,634,517

Difficulty

11.249427

Transactions

2

Size

574 B

Version

2

Bits

0b3fda6c

Nonce

282,061,869

Timestamp

4/28/2018, 10:30:13 PM

Confirmations

4,198,948

Merkle Root

c728c7ce95b96448b0c74f0acf93fd07ed3925aa1770b185a6cc93bdd9900a7a
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.124 × 10⁹⁴(95-digit number)
11248246653222856150…43220595248777305601
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.124 × 10⁹⁴(95-digit number)
11248246653222856150…43220595248777305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.249 × 10⁹⁴(95-digit number)
22496493306445712300…86441190497554611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.499 × 10⁹⁴(95-digit number)
44992986612891424601…72882380995109222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.998 × 10⁹⁴(95-digit number)
89985973225782849203…45764761990218444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.799 × 10⁹⁵(96-digit number)
17997194645156569840…91529523980436889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.599 × 10⁹⁵(96-digit number)
35994389290313139681…83059047960873779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.198 × 10⁹⁵(96-digit number)
71988778580626279362…66118095921747558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.439 × 10⁹⁶(97-digit number)
14397755716125255872…32236191843495116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.879 × 10⁹⁶(97-digit number)
28795511432250511745…64472383686990233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.759 × 10⁹⁶(97-digit number)
57591022864501023490…28944767373980467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.151 × 10⁹⁷(98-digit number)
11518204572900204698…57889534747960934401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,911,921 XPM·at block #6,833,464 · 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