Block #3,011,642

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2019, 6:30:39 AM · Difficulty 11.1783 · 3,828,493 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d3f51fea1780d6aec8bb722e6dbfebfe114039ee839b85c7e8c50e28854aab3d

Height

#3,011,642

Difficulty

11.178258

Transactions

3

Size

1.15 KB

Version

2

Bits

0b2da24e

Nonce

850,589,864

Timestamp

1/16/2019, 6:30:39 AM

Confirmations

3,828,493

Merkle Root

d341b07c8ffc1abe37b926dd16503c3771d969ae8294ea6262c1765a94176ed7
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.819 × 10⁹⁴(95-digit number)
78190457861990543246…08021686653283877119
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.819 × 10⁹⁴(95-digit number)
78190457861990543246…08021686653283877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.563 × 10⁹⁵(96-digit number)
15638091572398108649…16043373306567754239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.127 × 10⁹⁵(96-digit number)
31276183144796217298…32086746613135508479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.255 × 10⁹⁵(96-digit number)
62552366289592434597…64173493226271016959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.251 × 10⁹⁶(97-digit number)
12510473257918486919…28346986452542033919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.502 × 10⁹⁶(97-digit number)
25020946515836973838…56693972905084067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.004 × 10⁹⁶(97-digit number)
50041893031673947677…13387945810168135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.000 × 10⁹⁷(98-digit number)
10008378606334789535…26775891620336271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.001 × 10⁹⁷(98-digit number)
20016757212669579071…53551783240672542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.003 × 10⁹⁷(98-digit number)
40033514425339158142…07103566481345085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.006 × 10⁹⁷(98-digit number)
80067028850678316284…14207132962690170879
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,965,395 XPM·at block #6,840,134 · 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