Block #137,238

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2013, 4:56:47 PM · Difficulty 9.8200 · 6,670,222 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
64403be6187f9664a2ebabbdff522427a9b30547313ae1998ea36cda8a8cf691

Height

#137,238

Difficulty

9.820018

Transactions

8

Size

2.25 KB

Version

2

Bits

09d1ecb7

Nonce

0

Timestamp

8/27/2013, 4:56:47 PM

Confirmations

6,670,222

Merkle Root

e5b642ef631ece1c521ab0ca024d878841a9d3d95bf909ac61fec26f3eae4b63
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.016 × 10¹⁰⁶(107-digit number)
20160508148341685783…51113071099344654799
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.016 × 10¹⁰⁶(107-digit number)
20160508148341685783…51113071099344654799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.032 × 10¹⁰⁶(107-digit number)
40321016296683371566…02226142198689309599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.064 × 10¹⁰⁶(107-digit number)
80642032593366743133…04452284397378619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.612 × 10¹⁰⁷(108-digit number)
16128406518673348626…08904568794757238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.225 × 10¹⁰⁷(108-digit number)
32256813037346697253…17809137589514476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.451 × 10¹⁰⁷(108-digit number)
64513626074693394506…35618275179028953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.290 × 10¹⁰⁸(109-digit number)
12902725214938678901…71236550358057907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.580 × 10¹⁰⁸(109-digit number)
25805450429877357802…42473100716115814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.161 × 10¹⁰⁸(109-digit number)
51610900859754715605…84946201432231628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.032 × 10¹⁰⁹(110-digit number)
10322180171950943121…69892402864463257599
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,703,704 XPM·at block #6,807,459 · 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