Block #1,574,855

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2016, 12:05:08 PM · Difficulty 10.6982 · 5,242,312 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4928447b5787c350028bea73e490de69dbc56f56c9784083b3b15b062049a9f5

Height

#1,574,855

Difficulty

10.698218

Transactions

2

Size

1.18 KB

Version

2

Bits

0ab2be63

Nonce

115,234,529

Timestamp

5/7/2016, 12:05:08 PM

Confirmations

5,242,312

Merkle Root

4074a8e0d03d027e2877a02fcb590c3b65c70741ba71955d33854595f575b4a5
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.487 × 10⁹⁴(95-digit number)
24873138662994430070…22851009296196997059
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.487 × 10⁹⁴(95-digit number)
24873138662994430070…22851009296196997059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.974 × 10⁹⁴(95-digit number)
49746277325988860141…45702018592393994119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.949 × 10⁹⁴(95-digit number)
99492554651977720282…91404037184787988239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.989 × 10⁹⁵(96-digit number)
19898510930395544056…82808074369575976479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.979 × 10⁹⁵(96-digit number)
39797021860791088113…65616148739151952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.959 × 10⁹⁵(96-digit number)
79594043721582176226…31232297478303905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.591 × 10⁹⁶(97-digit number)
15918808744316435245…62464594956607811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.183 × 10⁹⁶(97-digit number)
31837617488632870490…24929189913215623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.367 × 10⁹⁶(97-digit number)
63675234977265740981…49858379826431247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.273 × 10⁹⁷(98-digit number)
12735046995453148196…99716759652862494719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,781,370 XPM·at block #6,817,166 · 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