Block #2,759,377

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2018, 9:28:54 PM · Difficulty 11.6623 · 4,085,770 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
20230436affefd110af4888b45f2d26d75a20c5ecd58724e8b9848b05d733705

Height

#2,759,377

Difficulty

11.662279

Transactions

15

Size

4.45 KB

Version

2

Bits

0ba98b1d

Nonce

1,655,980,869

Timestamp

7/21/2018, 9:28:54 PM

Confirmations

4,085,770

Merkle Root

35d634810eaff11965b053d81d104e149a011018e1b3b57dd643e0b3c50868bf
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.997 × 10⁹⁴(95-digit number)
29972119190910553841…68819229117220464961
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.997 × 10⁹⁴(95-digit number)
29972119190910553841…68819229117220464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.994 × 10⁹⁴(95-digit number)
59944238381821107682…37638458234440929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.198 × 10⁹⁵(96-digit number)
11988847676364221536…75276916468881859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.397 × 10⁹⁵(96-digit number)
23977695352728443073…50553832937763719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.795 × 10⁹⁵(96-digit number)
47955390705456886146…01107665875527439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.591 × 10⁹⁵(96-digit number)
95910781410913772292…02215331751054878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.918 × 10⁹⁶(97-digit number)
19182156282182754458…04430663502109757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.836 × 10⁹⁶(97-digit number)
38364312564365508917…08861327004219514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.672 × 10⁹⁶(97-digit number)
76728625128731017834…17722654008439029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.534 × 10⁹⁷(98-digit number)
15345725025746203566…35445308016878059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.069 × 10⁹⁷(98-digit number)
30691450051492407133…70890616033756119041
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:58,005,602 XPM·at block #6,845,146 · 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