Block #2,640,960

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 4:46:03 AM · Difficulty 11.6014 · 4,190,177 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
42e43de280df21237d0fb9993e2ccd4eb74064a77bb4536681569602c4f5a9a7

Height

#2,640,960

Difficulty

11.601356

Transactions

7

Size

1.49 KB

Version

2

Bits

0b99f27d

Nonce

1,061,000,772

Timestamp

5/1/2018, 4:46:03 AM

Confirmations

4,190,177

Merkle Root

6d1bc592266f4072d85159c3d29b71e0d0b715149fbc809fb7c23489e308da21
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.406 × 10⁹⁴(95-digit number)
24061656680831016603…33759333938920810241
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.406 × 10⁹⁴(95-digit number)
24061656680831016603…33759333938920810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.812 × 10⁹⁴(95-digit number)
48123313361662033207…67518667877841620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.624 × 10⁹⁴(95-digit number)
96246626723324066414…35037335755683240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.924 × 10⁹⁵(96-digit number)
19249325344664813282…70074671511366481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.849 × 10⁹⁵(96-digit number)
38498650689329626565…40149343022732963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.699 × 10⁹⁵(96-digit number)
76997301378659253131…80298686045465927681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.539 × 10⁹⁶(97-digit number)
15399460275731850626…60597372090931855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.079 × 10⁹⁶(97-digit number)
30798920551463701252…21194744181863710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.159 × 10⁹⁶(97-digit number)
61597841102927402505…42389488363727421441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.231 × 10⁹⁷(98-digit number)
12319568220585480501…84778976727454842881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.463 × 10⁹⁷(98-digit number)
24639136441170961002…69557953454909685761
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,893,243 XPM·at block #6,831,136 · 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