Block #347,488

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 5:51:09 AM · Difficulty 10.2372 · 6,468,776 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e1cab9b727d667ff13b63fa5359f68f661743f07b7cc17069110281e10774aa

Height

#347,488

Difficulty

10.237177

Transactions

8

Size

2.67 KB

Version

2

Bits

0a3cb7a6

Nonce

74,995

Timestamp

1/7/2014, 5:51:09 AM

Confirmations

6,468,776

Merkle Root

6de3cc598a42d8c7160888332c6ef58b4cf61eda9d8be9ba54115d221b54dedc
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.

2.049 × 10⁹⁷(98-digit number)
20494711405592457854…57854753051930947521
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
2.049 × 10⁹⁷(98-digit number)
20494711405592457854…57854753051930947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.098 × 10⁹⁷(98-digit number)
40989422811184915708…15709506103861895041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.197 × 10⁹⁷(98-digit number)
81978845622369831417…31419012207723790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.639 × 10⁹⁸(99-digit number)
16395769124473966283…62838024415447580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.279 × 10⁹⁸(99-digit number)
32791538248947932566…25676048830895160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.558 × 10⁹⁸(99-digit number)
65583076497895865133…51352097661790320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.311 × 10⁹⁹(100-digit number)
13116615299579173026…02704195323580641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.623 × 10⁹⁹(100-digit number)
26233230599158346053…05408390647161282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.246 × 10⁹⁹(100-digit number)
52466461198316692106…10816781294322565121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.049 × 10¹⁰⁰(101-digit number)
10493292239663338421…21633562588645130241
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,774,225 XPM·at block #6,816,263 · 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