Block #126,585

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/20/2013, 11:43:08 PM · Difficulty 9.7811 · 6,687,436 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb8088a61da136e6baf5c0a575d97b3052ad41ca14fbf3a3b410fe1e9e9b39a3

Height

#126,585

Difficulty

9.781091

Transactions

5

Size

1.40 KB

Version

2

Bits

09c7f593

Nonce

564,064

Timestamp

8/20/2013, 11:43:08 PM

Confirmations

6,687,436

Merkle Root

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

9.114 × 10⁹⁴(95-digit number)
91144047205118148976…38258143170713051229
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
9.114 × 10⁹⁴(95-digit number)
91144047205118148976…38258143170713051229
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.822 × 10⁹⁵(96-digit number)
18228809441023629795…76516286341426102459
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.645 × 10⁹⁵(96-digit number)
36457618882047259590…53032572682852204919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.291 × 10⁹⁵(96-digit number)
72915237764094519180…06065145365704409839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.458 × 10⁹⁶(97-digit number)
14583047552818903836…12130290731408819679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.916 × 10⁹⁶(97-digit number)
29166095105637807672…24260581462817639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.833 × 10⁹⁶(97-digit number)
58332190211275615344…48521162925635278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.166 × 10⁹⁷(98-digit number)
11666438042255123068…97042325851270557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.333 × 10⁹⁷(98-digit number)
23332876084510246137…94084651702541114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.666 × 10⁹⁷(98-digit number)
46665752169020492275…88169303405082229759
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,252 XPM·at block #6,814,020 · 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