Block #3,019,031

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2019, 10:19:51 AM · Difficulty 11.1717 · 3,813,949 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cba2c47e9258eed3cfa698c747daaa3f973f4428412be38773c226f19047b496

Height

#3,019,031

Difficulty

11.171678

Transactions

5

Size

2.04 KB

Version

2

Bits

0b2bf31a

Nonce

94,506,545

Timestamp

1/21/2019, 10:19:51 AM

Confirmations

3,813,949

Merkle Root

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

4.036 × 10⁹¹(92-digit number)
40369331485883270398…31817789030726264699
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
4.036 × 10⁹¹(92-digit number)
40369331485883270398…31817789030726264699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.073 × 10⁹¹(92-digit number)
80738662971766540796…63635578061452529399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.614 × 10⁹²(93-digit number)
16147732594353308159…27271156122905058799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.229 × 10⁹²(93-digit number)
32295465188706616318…54542312245810117599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.459 × 10⁹²(93-digit number)
64590930377413232637…09084624491620235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.291 × 10⁹³(94-digit number)
12918186075482646527…18169248983240470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.583 × 10⁹³(94-digit number)
25836372150965293054…36338497966480940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.167 × 10⁹³(94-digit number)
51672744301930586109…72676995932961881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.033 × 10⁹⁴(95-digit number)
10334548860386117221…45353991865923763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.066 × 10⁹⁴(95-digit number)
20669097720772234443…90707983731847526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.133 × 10⁹⁴(95-digit number)
41338195441544468887…81415967463695052799
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,908,019 XPM·at block #6,832,979 · 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