Block #187,309

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/30/2013, 11:21:48 AM · Difficulty 9.8679 · 6,626,714 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19614ca771dfc7eca1c877b2975138abf59272194ab481bc81ef11e44a4852a9

Height

#187,309

Difficulty

9.867922

Transactions

3

Size

686 B

Version

2

Bits

09de3020

Nonce

58,762

Timestamp

9/30/2013, 11:21:48 AM

Confirmations

6,626,714

Merkle Root

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

3.148 × 10⁹⁴(95-digit number)
31485060819321327020…57396300739702707199
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
3.148 × 10⁹⁴(95-digit number)
31485060819321327020…57396300739702707199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.297 × 10⁹⁴(95-digit number)
62970121638642654041…14792601479405414399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.259 × 10⁹⁵(96-digit number)
12594024327728530808…29585202958810828799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.518 × 10⁹⁵(96-digit number)
25188048655457061616…59170405917621657599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.037 × 10⁹⁵(96-digit number)
50376097310914123233…18340811835243315199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.007 × 10⁹⁶(97-digit number)
10075219462182824646…36681623670486630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.015 × 10⁹⁶(97-digit number)
20150438924365649293…73363247340973260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.030 × 10⁹⁶(97-digit number)
40300877848731298586…46726494681946521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.060 × 10⁹⁶(97-digit number)
80601755697462597173…93452989363893043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.612 × 10⁹⁷(98-digit number)
16120351139492519434…86905978727786086399
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,756,265 XPM·at block #6,814,022 · 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