Block #2,757,261

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2018, 9:36:39 AM · Difficulty 11.6647 · 4,076,641 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f23513563a79ee2d75f93503e273a996e4bfdc85194ebad4d4183742ef1f94d

Height

#2,757,261

Difficulty

11.664749

Transactions

8

Size

2.84 KB

Version

2

Bits

0baa2d04

Nonce

1,011,343,169

Timestamp

7/20/2018, 9:36:39 AM

Confirmations

4,076,641

Merkle Root

ccc69dc839243e67d689bf9f9526fbe44a3851dae14c8ae69709a0e8e62496d9
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.147 × 10⁹⁵(96-digit number)
11476031691826278855…52596357451306586881
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.147 × 10⁹⁵(96-digit number)
11476031691826278855…52596357451306586881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.295 × 10⁹⁵(96-digit number)
22952063383652557711…05192714902613173761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.590 × 10⁹⁵(96-digit number)
45904126767305115423…10385429805226347521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.180 × 10⁹⁵(96-digit number)
91808253534610230846…20770859610452695041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.836 × 10⁹⁶(97-digit number)
18361650706922046169…41541719220905390081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.672 × 10⁹⁶(97-digit number)
36723301413844092338…83083438441810780161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.344 × 10⁹⁶(97-digit number)
73446602827688184676…66166876883621560321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.468 × 10⁹⁷(98-digit number)
14689320565537636935…32333753767243120641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.937 × 10⁹⁷(98-digit number)
29378641131075273870…64667507534486241281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.875 × 10⁹⁷(98-digit number)
58757282262150547741…29335015068972482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.175 × 10⁹⁸(99-digit number)
11751456452430109548…58670030137944965121
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,915,442 XPM·at block #6,833,901 · 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