Block #1,575,450

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2016, 11:11:27 PM · Difficulty 10.6939 · 5,242,055 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12dc08db4e7073b819b7162e764236827002032151a23e9ff023099fc57d44b6

Height

#1,575,450

Difficulty

10.693925

Transactions

2

Size

833 B

Version

2

Bits

0ab1a50d

Nonce

787,302,178

Timestamp

5/7/2016, 11:11:27 PM

Confirmations

5,242,055

Merkle Root

fd94fe9d530296c0cb11eee565eaf804aa5a2390354794537425bd2833855757
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.561 × 10⁹⁶(97-digit number)
15610617718913563744…87244926534545986559
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.561 × 10⁹⁶(97-digit number)
15610617718913563744…87244926534545986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.122 × 10⁹⁶(97-digit number)
31221235437827127489…74489853069091973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.244 × 10⁹⁶(97-digit number)
62442470875654254979…48979706138183946239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.248 × 10⁹⁷(98-digit number)
12488494175130850995…97959412276367892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.497 × 10⁹⁷(98-digit number)
24976988350261701991…95918824552735784959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.995 × 10⁹⁷(98-digit number)
49953976700523403983…91837649105471569919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.990 × 10⁹⁷(98-digit number)
99907953401046807967…83675298210943139839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.998 × 10⁹⁸(99-digit number)
19981590680209361593…67350596421886279679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.996 × 10⁹⁸(99-digit number)
39963181360418723186…34701192843772559359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.992 × 10⁹⁸(99-digit number)
79926362720837446373…69402385687545118719
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,784,088 XPM·at block #6,817,504 · 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