Block #118,612

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/15/2013, 9:30:23 PM · Difficulty 9.7511 · 6,697,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f96afac6de5602a88764e2ffd86f6097d01bf19adc30ec2eb40404a6125ffceb

Height

#118,612

Difficulty

9.751074

Transactions

8

Size

2.07 KB

Version

2

Bits

09c0466a

Nonce

89,516

Timestamp

8/15/2013, 9:30:23 PM

Confirmations

6,697,734

Merkle Root

8bdf95809e548e39fd5f0041e6cd31b91892db5dcce1858408fe9686533e88db
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.203 × 10⁹⁵(96-digit number)
32036875242116183581…63545036252620135059
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.203 × 10⁹⁵(96-digit number)
32036875242116183581…63545036252620135059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.407 × 10⁹⁵(96-digit number)
64073750484232367163…27090072505240270119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.281 × 10⁹⁶(97-digit number)
12814750096846473432…54180145010480540239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.562 × 10⁹⁶(97-digit number)
25629500193692946865…08360290020961080479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.125 × 10⁹⁶(97-digit number)
51259000387385893730…16720580041922160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.025 × 10⁹⁷(98-digit number)
10251800077477178746…33441160083844321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.050 × 10⁹⁷(98-digit number)
20503600154954357492…66882320167688643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.100 × 10⁹⁷(98-digit number)
41007200309908714984…33764640335377287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.201 × 10⁹⁷(98-digit number)
82014400619817429969…67529280670754575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.640 × 10⁹⁸(99-digit number)
16402880123963485993…35058561341509150719
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,774,892 XPM·at block #6,816,345 · 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