Block #2,731,725

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2018, 12:02:55 AM · Difficulty 11.6303 · 4,100,154 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8e98f87d71171543b14c979fa7f93f25accef2a295a9b6779de838d77e682bd

Height

#2,731,725

Difficulty

11.630274

Transactions

5

Size

2.58 KB

Version

2

Bits

0ba159a4

Nonce

1,156,187,931

Timestamp

7/3/2018, 12:02:55 AM

Confirmations

4,100,154

Merkle Root

e15b1e5bea954ec176414915f9afbcaf41c127ebd42b125046c789b9bff2d61e
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.

5.969 × 10⁹²(93-digit number)
59692030729143286351…48363510298387708401
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
5.969 × 10⁹²(93-digit number)
59692030729143286351…48363510298387708401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.193 × 10⁹³(94-digit number)
11938406145828657270…96727020596775416801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.387 × 10⁹³(94-digit number)
23876812291657314540…93454041193550833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.775 × 10⁹³(94-digit number)
47753624583314629080…86908082387101667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.550 × 10⁹³(94-digit number)
95507249166629258161…73816164774203334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.910 × 10⁹⁴(95-digit number)
19101449833325851632…47632329548406668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.820 × 10⁹⁴(95-digit number)
38202899666651703264…95264659096813337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.640 × 10⁹⁴(95-digit number)
76405799333303406529…90529318193626675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.528 × 10⁹⁵(96-digit number)
15281159866660681305…81058636387253350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.056 × 10⁹⁵(96-digit number)
30562319733321362611…62117272774506700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.112 × 10⁹⁵(96-digit number)
61124639466642725223…24234545549013401601
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,899,154 XPM·at block #6,831,878 · 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