Block #3,225,065

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2019, 3:27:14 PM · Difficulty 11.0030 · 3,606,377 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a418e3ff7aff3ef4e701afc2a52f5a85e655ee438567f8501a00287a0b395a2f

Height

#3,225,065

Difficulty

11.002988

Transactions

20

Size

4.63 KB

Version

2

Bits

0b00c3d6

Nonce

157,419,234

Timestamp

6/14/2019, 3:27:14 PM

Confirmations

3,606,377

Merkle Root

dea59c4d2f611d2a6339476df925c7819e13717bd62d27caa775914f7c1449d8
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.344 × 10⁹³(94-digit number)
23445057278938226127…60822133991617316299
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.344 × 10⁹³(94-digit number)
23445057278938226127…60822133991617316299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.689 × 10⁹³(94-digit number)
46890114557876452254…21644267983234632599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.378 × 10⁹³(94-digit number)
93780229115752904508…43288535966469265199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.875 × 10⁹⁴(95-digit number)
18756045823150580901…86577071932938530399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.751 × 10⁹⁴(95-digit number)
37512091646301161803…73154143865877060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.502 × 10⁹⁴(95-digit number)
75024183292602323607…46308287731754121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.500 × 10⁹⁵(96-digit number)
15004836658520464721…92616575463508243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.000 × 10⁹⁵(96-digit number)
30009673317040929442…85233150927016486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.001 × 10⁹⁵(96-digit number)
60019346634081858885…70466301854032972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.200 × 10⁹⁶(97-digit number)
12003869326816371777…40932603708065945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.400 × 10⁹⁶(97-digit number)
24007738653632743554…81865207416131891199
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,895,700 XPM·at block #6,831,441 · 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