Block #3,003,622

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2019, 1:35:09 PM · Difficulty 11.2091 · 3,832,844 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de35a3de6669d0f751900776f1b29f0a4817a97347b3f0d477758de5f48ce087

Height

#3,003,622

Difficulty

11.209081

Transactions

3

Size

1.89 KB

Version

2

Bits

0b35865d

Nonce

199,008,396

Timestamp

1/10/2019, 1:35:09 PM

Confirmations

3,832,844

Merkle Root

abb464aa84257975d13f1d8517dddc26bbf406b541b527318fffaa5e88a6c2c1
Transactions (3)
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.

7.860 × 10⁹⁶(97-digit number)
78604128316917081773…31556088733960222721
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
7.860 × 10⁹⁶(97-digit number)
78604128316917081773…31556088733960222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.572 × 10⁹⁷(98-digit number)
15720825663383416354…63112177467920445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.144 × 10⁹⁷(98-digit number)
31441651326766832709…26224354935840890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.288 × 10⁹⁷(98-digit number)
62883302653533665418…52448709871681781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.257 × 10⁹⁸(99-digit number)
12576660530706733083…04897419743363563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.515 × 10⁹⁸(99-digit number)
25153321061413466167…09794839486727127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.030 × 10⁹⁸(99-digit number)
50306642122826932335…19589678973454254081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.006 × 10⁹⁹(100-digit number)
10061328424565386467…39179357946908508161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.012 × 10⁹⁹(100-digit number)
20122656849130772934…78358715893817016321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.024 × 10⁹⁹(100-digit number)
40245313698261545868…56717431787634032641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.049 × 10⁹⁹(100-digit number)
80490627396523091736…13434863575268065281
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,936,000 XPM·at block #6,836,465 · 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