Block #345,918

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 6:11:19 AM · Difficulty 10.2138 · 6,470,288 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bc0a0200c3e1f000e50eec048d400db664931ea04c26d18bbe3e5090df1129c5

Height

#345,918

Difficulty

10.213842

Transactions

1

Size

1.01 KB

Version

2

Bits

0a36be58

Nonce

6,067

Timestamp

1/6/2014, 6:11:19 AM

Confirmations

6,470,288

Merkle Root

787acfb507ca871b0248a42fe4e44eddcd281fbf389850dcb48742b85cefd1cd
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.034 × 10¹⁰⁰(101-digit number)
10349084874514792139…65500212682917859841
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.034 × 10¹⁰⁰(101-digit number)
10349084874514792139…65500212682917859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.069 × 10¹⁰⁰(101-digit number)
20698169749029584279…31000425365835719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.139 × 10¹⁰⁰(101-digit number)
41396339498059168559…62000850731671439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.279 × 10¹⁰⁰(101-digit number)
82792678996118337119…24001701463342878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.655 × 10¹⁰¹(102-digit number)
16558535799223667423…48003402926685757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.311 × 10¹⁰¹(102-digit number)
33117071598447334847…96006805853371514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.623 × 10¹⁰¹(102-digit number)
66234143196894669695…92013611706743029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.324 × 10¹⁰²(103-digit number)
13246828639378933939…84027223413486059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.649 × 10¹⁰²(103-digit number)
26493657278757867878…68054446826972119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.298 × 10¹⁰²(103-digit number)
52987314557515735756…36108893653944238081
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,773,775 XPM·at block #6,816,205 · 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