Block #3,015,702

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2019, 2:24:57 AM · Difficulty 11.1758 · 3,801,045 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5182752d8ac0ba2c4a95dd2549d0b9c40a14b57a363d4c9926190974e83d7a8d

Height

#3,015,702

Difficulty

11.175782

Transactions

7

Size

2.59 KB

Version

2

Bits

0b2d000a

Nonce

1,543,202,713

Timestamp

1/19/2019, 2:24:57 AM

Confirmations

3,801,045

Merkle Root

9efd7728bf44cb1418584262a8ba0982517f249627b3b82991ea411f877a06b6
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.638 × 10⁹³(94-digit number)
26389133189360051989…29308891395161252799
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.638 × 10⁹³(94-digit number)
26389133189360051989…29308891395161252799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.277 × 10⁹³(94-digit number)
52778266378720103979…58617782790322505599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.055 × 10⁹⁴(95-digit number)
10555653275744020795…17235565580645011199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.111 × 10⁹⁴(95-digit number)
21111306551488041591…34471131161290022399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.222 × 10⁹⁴(95-digit number)
42222613102976083183…68942262322580044799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.444 × 10⁹⁴(95-digit number)
84445226205952166366…37884524645160089599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.688 × 10⁹⁵(96-digit number)
16889045241190433273…75769049290320179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.377 × 10⁹⁵(96-digit number)
33778090482380866546…51538098580640358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.755 × 10⁹⁵(96-digit number)
67556180964761733093…03076197161280716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.351 × 10⁹⁶(97-digit number)
13511236192952346618…06152394322561433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.702 × 10⁹⁶(97-digit number)
27022472385904693237…12304788645122867199
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,013 XPM·at block #6,816,746 · 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