Block #3,052,064

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/14/2019, 4:32:45 AM · Difficulty 11.0000 · 3,786,981 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
500fa6530a7b415fd62296a2fa3a304931a501c3da9be4cfe1acc692f1eae4d7

Height

#3,052,064

Difficulty

11.000000

Transactions

5

Size

1.70 KB

Version

2

Bits

0b000000

Nonce

1,126,566,080

Timestamp

2/14/2019, 4:32:45 AM

Confirmations

3,786,981

Merkle Root

90cfe841f36e9c9638bb837837ef471e82d5bece45485006ea5cc12faf5e5902
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.

1.301 × 10⁹⁵(96-digit number)
13014901204583894472…11753310981973258239
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
1.301 × 10⁹⁵(96-digit number)
13014901204583894472…11753310981973258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.602 × 10⁹⁵(96-digit number)
26029802409167788944…23506621963946516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.205 × 10⁹⁵(96-digit number)
52059604818335577888…47013243927893032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.041 × 10⁹⁶(97-digit number)
10411920963667115577…94026487855786065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.082 × 10⁹⁶(97-digit number)
20823841927334231155…88052975711572131839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.164 × 10⁹⁶(97-digit number)
41647683854668462310…76105951423144263679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.329 × 10⁹⁶(97-digit number)
83295367709336924621…52211902846288527359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.665 × 10⁹⁷(98-digit number)
16659073541867384924…04423805692577054719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.331 × 10⁹⁷(98-digit number)
33318147083734769848…08847611385154109439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.663 × 10⁹⁷(98-digit number)
66636294167469539696…17695222770308218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.332 × 10⁹⁸(99-digit number)
13327258833493907939…35390445540616437759
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,956,629 XPM·at block #6,839,044 · 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