Block #137,370

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/27/2013, 6:47:29 PM · Difficulty 9.8209 · 6,679,674 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c454bd120dbc63a474de3f514e8d33e51aa2556fcb3f459dcf73cb84721367b

Height

#137,370

Difficulty

9.820912

Transactions

4

Size

777 B

Version

2

Bits

09d2274a

Nonce

115,464

Timestamp

8/27/2013, 6:47:29 PM

Confirmations

6,679,674

Merkle Root

8a31f61ad21ba633a77cd1ba8458242c47ee3830a5e74186fbe44e8a5717392b
Transactions (4)
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.447 × 10⁹⁵(96-digit number)
14471406420332308775…54597134592266414081
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.447 × 10⁹⁵(96-digit number)
14471406420332308775…54597134592266414081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.894 × 10⁹⁵(96-digit number)
28942812840664617550…09194269184532828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.788 × 10⁹⁵(96-digit number)
57885625681329235101…18388538369065656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.157 × 10⁹⁶(97-digit number)
11577125136265847020…36777076738131312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.315 × 10⁹⁶(97-digit number)
23154250272531694040…73554153476262625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.630 × 10⁹⁶(97-digit number)
46308500545063388080…47108306952525250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.261 × 10⁹⁶(97-digit number)
92617001090126776161…94216613905050501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.852 × 10⁹⁷(98-digit number)
18523400218025355232…88433227810101002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.704 × 10⁹⁷(98-digit number)
37046800436050710464…76866455620202004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.409 × 10⁹⁷(98-digit number)
74093600872101420929…53732911240404008961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,780,384 XPM·at block #6,817,043 · 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