Block #3,057,025

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2019, 3:56:48 PM · Difficulty 11.0087 · 3,768,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c7e77c07d912ad364debeb318ddb39ab23e89ccb8802ef7d4c8c0cb94cb902a8

Height

#3,057,025

Difficulty

11.008685

Transactions

7

Size

2.29 KB

Version

2

Bits

0b023930

Nonce

38,416,377

Timestamp

2/17/2019, 3:56:48 PM

Confirmations

3,768,276

Merkle Root

a972ea5b2a7fa4fbb30dfa6efebda87620e57a082644f8c250f3365d2b51fc50
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.197 × 10⁹⁴(95-digit number)
71972243940782805689…89945486653178737401
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.197 × 10⁹⁴(95-digit number)
71972243940782805689…89945486653178737401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.439 × 10⁹⁵(96-digit number)
14394448788156561137…79890973306357474801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.878 × 10⁹⁵(96-digit number)
28788897576313122275…59781946612714949601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.757 × 10⁹⁵(96-digit number)
57577795152626244551…19563893225429899201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.151 × 10⁹⁶(97-digit number)
11515559030525248910…39127786450859798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.303 × 10⁹⁶(97-digit number)
23031118061050497820…78255572901719596801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.606 × 10⁹⁶(97-digit number)
46062236122100995641…56511145803439193601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.212 × 10⁹⁶(97-digit number)
92124472244201991283…13022291606878387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.842 × 10⁹⁷(98-digit number)
18424894448840398256…26044583213756774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.684 × 10⁹⁷(98-digit number)
36849788897680796513…52089166427513548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.369 × 10⁹⁷(98-digit number)
73699577795361593026…04178332855027097601
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,846,509 XPM·at block #6,825,300 · 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