Block #3,083,673

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2019, 7:56:20 AM · Difficulty 11.0306 · 3,755,079 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b038bfee9caaf0f7640a0e5425cbac664d0f1fc89d49a2f03614d94e2bafcd98

Height

#3,083,673

Difficulty

11.030554

Transactions

3

Size

1.31 KB

Version

2

Bits

0b07d25f

Nonce

1,423,583,650

Timestamp

3/8/2019, 7:56:20 AM

Confirmations

3,755,079

Merkle Root

c202339534353c2aafc5a8d3fcc10b14b27000bf8256f4bb30f32e1c63c461a0
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.

9.552 × 10⁹³(94-digit number)
95527456290898696564…77982613312547410481
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
9.552 × 10⁹³(94-digit number)
95527456290898696564…77982613312547410481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.910 × 10⁹⁴(95-digit number)
19105491258179739312…55965226625094820961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.821 × 10⁹⁴(95-digit number)
38210982516359478625…11930453250189641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.642 × 10⁹⁴(95-digit number)
76421965032718957251…23860906500379283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.528 × 10⁹⁵(96-digit number)
15284393006543791450…47721813000758567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.056 × 10⁹⁵(96-digit number)
30568786013087582900…95443626001517135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.113 × 10⁹⁵(96-digit number)
61137572026175165801…90887252003034270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.222 × 10⁹⁶(97-digit number)
12227514405235033160…81774504006068541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.445 × 10⁹⁶(97-digit number)
24455028810470066320…63549008012137082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.891 × 10⁹⁶(97-digit number)
48910057620940132640…27098016024274165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.782 × 10⁹⁶(97-digit number)
97820115241880265281…54196032048548331521
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,954,274 XPM·at block #6,838,751 · 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