Block #3,005,985

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2019, 6:22:35 AM · Difficulty 11.1960 · 3,810,044 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ad42f7653b9f559f0eddcae192685f33dc3fc55f4bf423a7884d01cac50f707

Height

#3,005,985

Difficulty

11.195968

Transactions

9

Size

3.08 KB

Version

2

Bits

0b322af9

Nonce

2,583,651

Timestamp

1/12/2019, 6:22:35 AM

Confirmations

3,810,044

Merkle Root

96e4a6bfb0372c9bb0adcbb7e7eaa73de68d35ffebb2f8ef5198d7ad32e2ce68
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.

3.963 × 10⁹³(94-digit number)
39634657329035261693…63604381551974883559
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
3.963 × 10⁹³(94-digit number)
39634657329035261693…63604381551974883559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.926 × 10⁹³(94-digit number)
79269314658070523386…27208763103949767119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.585 × 10⁹⁴(95-digit number)
15853862931614104677…54417526207899534239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.170 × 10⁹⁴(95-digit number)
31707725863228209354…08835052415799068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.341 × 10⁹⁴(95-digit number)
63415451726456418708…17670104831598136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.268 × 10⁹⁵(96-digit number)
12683090345291283741…35340209663196273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.536 × 10⁹⁵(96-digit number)
25366180690582567483…70680419326392547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.073 × 10⁹⁵(96-digit number)
50732361381165134967…41360838652785095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.014 × 10⁹⁶(97-digit number)
10146472276233026993…82721677305570191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.029 × 10⁹⁶(97-digit number)
20292944552466053986…65443354611140382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.058 × 10⁹⁶(97-digit number)
40585889104932107973…30886709222280765439
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,772,345 XPM·at block #6,816,028 · 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