Block #3,050,708

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2019, 5:47:34 AM · Difficulty 10.9961 · 3,787,526 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8072008a4c4ac49182bee04bbd5bf195c2067b2f4e55dbd8d135662153b2d769

Height

#3,050,708

Difficulty

10.996062

Transactions

2

Size

721 B

Version

2

Bits

0afefde3

Nonce

209,874,682

Timestamp

2/13/2019, 5:47:34 AM

Confirmations

3,787,526

Merkle Root

c6e31a6ce20ed35932b4d682b07edc46678cd84804a7e5e32d2a75c853b527fd
Transactions (2)
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.107 × 10⁹⁶(97-digit number)
31070350302655161535…38051012537396469761
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.107 × 10⁹⁶(97-digit number)
31070350302655161535…38051012537396469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.214 × 10⁹⁶(97-digit number)
62140700605310323070…76102025074792939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.242 × 10⁹⁷(98-digit number)
12428140121062064614…52204050149585879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.485 × 10⁹⁷(98-digit number)
24856280242124129228…04408100299171758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.971 × 10⁹⁷(98-digit number)
49712560484248258456…08816200598343516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.942 × 10⁹⁷(98-digit number)
99425120968496516913…17632401196687032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.988 × 10⁹⁸(99-digit number)
19885024193699303382…35264802393374064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.977 × 10⁹⁸(99-digit number)
39770048387398606765…70529604786748129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.954 × 10⁹⁸(99-digit number)
79540096774797213530…41059209573496258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.590 × 10⁹⁹(100-digit number)
15908019354959442706…82118419146992517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.181 × 10⁹⁹(100-digit number)
31816038709918885412…64236838293985034241
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,950,147 XPM·at block #6,838,233 · 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