Block #338,495

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 11:36:05 AM · Difficulty 10.1221 · 6,471,055 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5fe0883c3832edd631a26218435364e01426feb777b475b3e681bfa68862b840

Height

#338,495

Difficulty

10.122050

Transactions

1

Size

1.04 KB

Version

2

Bits

0a1f3eae

Nonce

160,026

Timestamp

1/1/2014, 11:36:05 AM

Confirmations

6,471,055

Merkle Root

96784ff673f76136b3f8e8d5b00a733d4f42e46091921eac05553d40a33cd3cb
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.

7.954 × 10⁹⁰(91-digit number)
79548473925595012644…42116579424685157601
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
7.954 × 10⁹⁰(91-digit number)
79548473925595012644…42116579424685157601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.590 × 10⁹¹(92-digit number)
15909694785119002528…84233158849370315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.181 × 10⁹¹(92-digit number)
31819389570238005057…68466317698740630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.363 × 10⁹¹(92-digit number)
63638779140476010115…36932635397481260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.272 × 10⁹²(93-digit number)
12727755828095202023…73865270794962521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.545 × 10⁹²(93-digit number)
25455511656190404046…47730541589925043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.091 × 10⁹²(93-digit number)
50911023312380808092…95461083179850086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.018 × 10⁹³(94-digit number)
10182204662476161618…90922166359700172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.036 × 10⁹³(94-digit number)
20364409324952323237…81844332719400345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.072 × 10⁹³(94-digit number)
40728818649904646474…63688665438800691201
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,720,473 XPM·at block #6,809,549 · 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