Block #3,005,062

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2019, 2:27:32 PM · Difficulty 11.2007 · 3,833,983 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72959ec105b7ed94f9ac1cada230af148e6752a5e28c8dc4e8af9e07c98d9103

Height

#3,005,062

Difficulty

11.200689

Transactions

9

Size

2.20 KB

Version

2

Bits

0b336057

Nonce

55,269,899

Timestamp

1/11/2019, 2:27:32 PM

Confirmations

3,833,983

Merkle Root

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

7.484 × 10⁹⁴(95-digit number)
74848030610852348902…29616055868835212399
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
7.484 × 10⁹⁴(95-digit number)
74848030610852348902…29616055868835212399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.496 × 10⁹⁵(96-digit number)
14969606122170469780…59232111737670424799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.993 × 10⁹⁵(96-digit number)
29939212244340939560…18464223475340849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.987 × 10⁹⁵(96-digit number)
59878424488681879121…36928446950681699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.197 × 10⁹⁶(97-digit number)
11975684897736375824…73856893901363398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.395 × 10⁹⁶(97-digit number)
23951369795472751648…47713787802726796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.790 × 10⁹⁶(97-digit number)
47902739590945503297…95427575605453593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.580 × 10⁹⁶(97-digit number)
95805479181891006595…90855151210907187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.916 × 10⁹⁷(98-digit number)
19161095836378201319…81710302421814374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.832 × 10⁹⁷(98-digit number)
38322191672756402638…63420604843628748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.664 × 10⁹⁷(98-digit number)
76644383345512805276…26841209687257497599
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