Block #316,044

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 8:29:07 PM · Difficulty 10.1234 · 6,494,235 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
89902a7b11a3e05286355b731319e64ae45f7bd1b17141902827fda6c24a5bb5

Height

#316,044

Difficulty

10.123406

Transactions

16

Size

5.79 KB

Version

2

Bits

0a1f9788

Nonce

148,548

Timestamp

12/16/2013, 8:29:07 PM

Confirmations

6,494,235

Merkle Root

8ba263886d520aea6e61893df3e7e997b11bd3ea3081505bc66c5e2b24e4b23b
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.184 × 10⁹⁹(100-digit number)
11842219283960701870…66242245657663134721
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.184 × 10⁹⁹(100-digit number)
11842219283960701870…66242245657663134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.368 × 10⁹⁹(100-digit number)
23684438567921403740…32484491315326269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.736 × 10⁹⁹(100-digit number)
47368877135842807481…64968982630652538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.473 × 10⁹⁹(100-digit number)
94737754271685614962…29937965261305077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.894 × 10¹⁰⁰(101-digit number)
18947550854337122992…59875930522610155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.789 × 10¹⁰⁰(101-digit number)
37895101708674245984…19751861045220311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.579 × 10¹⁰⁰(101-digit number)
75790203417348491969…39503722090440622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.515 × 10¹⁰¹(102-digit number)
15158040683469698393…79007444180881244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.031 × 10¹⁰¹(102-digit number)
30316081366939396787…58014888361762488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.063 × 10¹⁰¹(102-digit number)
60632162733878793575…16029776723524976641
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,726,306 XPM·at block #6,810,278 · 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