Block #3,015,889

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2019, 5:41:30 AM · Difficulty 11.1742 · 3,800,951 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1cb2a0b7df5483e1873e3d3eebadfb386d96cd1acca9699327d8b94b03ee2281

Height

#3,015,889

Difficulty

11.174205

Transactions

4

Size

1.33 KB

Version

2

Bits

0b2c98b2

Nonce

223,363,210

Timestamp

1/19/2019, 5:41:30 AM

Confirmations

3,800,951

Merkle Root

9d0e8bbea852002adeea30d649feb0676adbdb26a65afd43b3a68bf719cff5af
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.

6.718 × 10⁹⁴(95-digit number)
67180175815939297779…19291326085972067839
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
6.718 × 10⁹⁴(95-digit number)
67180175815939297779…19291326085972067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.343 × 10⁹⁵(96-digit number)
13436035163187859555…38582652171944135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.687 × 10⁹⁵(96-digit number)
26872070326375719111…77165304343888271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.374 × 10⁹⁵(96-digit number)
53744140652751438223…54330608687776542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.074 × 10⁹⁶(97-digit number)
10748828130550287644…08661217375553085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.149 × 10⁹⁶(97-digit number)
21497656261100575289…17322434751106170879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.299 × 10⁹⁶(97-digit number)
42995312522201150579…34644869502212341759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.599 × 10⁹⁶(97-digit number)
85990625044402301158…69289739004424683519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.719 × 10⁹⁷(98-digit number)
17198125008880460231…38579478008849367039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.439 × 10⁹⁷(98-digit number)
34396250017760920463…77158956017698734079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.879 × 10⁹⁷(98-digit number)
68792500035521840926…54317912035397468159
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,778,760 XPM·at block #6,816,839 · 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