Block #3,013,351

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2019, 10:53:16 AM · Difficulty 11.1794 · 3,829,394 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
775384332684dfc39b53bf73fba2028cc4aa5699928a7b30695ff5aed89abe2e

Height

#3,013,351

Difficulty

11.179364

Transactions

35

Size

11.27 KB

Version

2

Bits

0b2deacb

Nonce

226,356,701

Timestamp

1/17/2019, 10:53:16 AM

Confirmations

3,829,394

Merkle Root

2cc0edf7eb2cb7409f3566f0141d2e1d781b808caf31d26cb7c3fa2a3d253d43
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.768 × 10⁹⁴(95-digit number)
27688040401896499808…69737975343194128399
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.768 × 10⁹⁴(95-digit number)
27688040401896499808…69737975343194128399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.537 × 10⁹⁴(95-digit number)
55376080803792999616…39475950686388256799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.107 × 10⁹⁵(96-digit number)
11075216160758599923…78951901372776513599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.215 × 10⁹⁵(96-digit number)
22150432321517199846…57903802745553027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.430 × 10⁹⁵(96-digit number)
44300864643034399693…15807605491106054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.860 × 10⁹⁵(96-digit number)
88601729286068799386…31615210982212108799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.772 × 10⁹⁶(97-digit number)
17720345857213759877…63230421964424217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.544 × 10⁹⁶(97-digit number)
35440691714427519754…26460843928848435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.088 × 10⁹⁶(97-digit number)
70881383428855039509…52921687857696870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.417 × 10⁹⁷(98-digit number)
14176276685771007901…05843375715393740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.835 × 10⁹⁷(98-digit number)
28352553371542015803…11686751430787481599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,986,296 XPM·at block #6,842,744 · 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