Block #2,737,316

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/7/2018, 1:51:17 AM · Difficulty 11.6094 · 4,104,191 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7483d645631b863c69ea567c464947e343468fa38ad08bb263392dccc71b315a

Height

#2,737,316

Difficulty

11.609376

Transactions

12

Size

3.06 KB

Version

2

Bits

0b9c000b

Nonce

912,174,004

Timestamp

7/7/2018, 1:51:17 AM

Confirmations

4,104,191

Merkle Root

87d45149c5a56caca728427f6c8ee630b34dd927d6a17bf7db08327e593d7e6a
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.070 × 10⁹³(94-digit number)
30704439082780271007…58442032920369720481
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.070 × 10⁹³(94-digit number)
30704439082780271007…58442032920369720481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.140 × 10⁹³(94-digit number)
61408878165560542014…16884065840739440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.228 × 10⁹⁴(95-digit number)
12281775633112108402…33768131681478881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.456 × 10⁹⁴(95-digit number)
24563551266224216805…67536263362957763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.912 × 10⁹⁴(95-digit number)
49127102532448433611…35072526725915527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.825 × 10⁹⁴(95-digit number)
98254205064896867223…70145053451831055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.965 × 10⁹⁵(96-digit number)
19650841012979373444…40290106903662110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.930 × 10⁹⁵(96-digit number)
39301682025958746889…80580213807324221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.860 × 10⁹⁵(96-digit number)
78603364051917493778…61160427614648442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.572 × 10⁹⁶(97-digit number)
15720672810383498755…22320855229296885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.144 × 10⁹⁶(97-digit number)
31441345620766997511…44641710458593771521
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,976,435 XPM·at block #6,841,506 · 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