Block #1,509,608

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2016, 12:44:09 AM · Difficulty 10.6133 · 5,300,305 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f42acac1697cd212509ca5c40c0403825f2e80340e5da33ed18bff4b8abaa609

Height

#1,509,608

Difficulty

10.613300

Transactions

9

Size

163.48 KB

Version

2

Bits

0a9d0135

Nonce

1,186,954,975

Timestamp

3/24/2016, 12:44:09 AM

Confirmations

5,300,305

Merkle Root

77827322737962079c1dd2c65b32590483409f6fe57496dbd0097ba6c5d96fd4
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.818 × 10⁹⁵(96-digit number)
18186056909343471226…72676062577113219839
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.818 × 10⁹⁵(96-digit number)
18186056909343471226…72676062577113219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.637 × 10⁹⁵(96-digit number)
36372113818686942453…45352125154226439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.274 × 10⁹⁵(96-digit number)
72744227637373884907…90704250308452879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.454 × 10⁹⁶(97-digit number)
14548845527474776981…81408500616905758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.909 × 10⁹⁶(97-digit number)
29097691054949553962…62817001233811517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.819 × 10⁹⁶(97-digit number)
58195382109899107925…25634002467623034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.163 × 10⁹⁷(98-digit number)
11639076421979821585…51268004935246069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.327 × 10⁹⁷(98-digit number)
23278152843959643170…02536009870492139519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.655 × 10⁹⁷(98-digit number)
46556305687919286340…05072019740984279039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.311 × 10⁹⁷(98-digit number)
93112611375838572681…10144039481968558079
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,723,388 XPM·at block #6,809,912 · 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.

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