Block #303,044

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 3:54:59 AM · Difficulty 9.9929 · 6,507,003 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1baaf4ed7d989129bf73feecd4a0e1a6886a942d1b256defac89069e4f2b4c5e

Height

#303,044

Difficulty

9.992900

Transactions

4

Size

3.75 KB

Version

2

Bits

09fe2eaa

Nonce

323,217

Timestamp

12/10/2013, 3:54:59 AM

Confirmations

6,507,003

Merkle Root

4e8ab06a0b1a171f2914dc7a80e5c25960956b6e1dc8121406184b02ee614b6b
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.817 × 10⁹⁵(96-digit number)
18176673858141998181…33880769450826656201
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.817 × 10⁹⁵(96-digit number)
18176673858141998181…33880769450826656201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.635 × 10⁹⁵(96-digit number)
36353347716283996362…67761538901653312401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.270 × 10⁹⁵(96-digit number)
72706695432567992724…35523077803306624801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.454 × 10⁹⁶(97-digit number)
14541339086513598544…71046155606613249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.908 × 10⁹⁶(97-digit number)
29082678173027197089…42092311213226499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.816 × 10⁹⁶(97-digit number)
58165356346054394179…84184622426452998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.163 × 10⁹⁷(98-digit number)
11633071269210878835…68369244852905996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.326 × 10⁹⁷(98-digit number)
23266142538421757671…36738489705811993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.653 × 10⁹⁷(98-digit number)
46532285076843515343…73476979411623987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.306 × 10⁹⁷(98-digit number)
93064570153687030687…46953958823247974401
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,724,448 XPM·at block #6,810,046 · 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