Block #348,053

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 2:02:24 PM · Difficulty 10.2482 · 6,459,974 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
48529ef7087dd83e7c82de59e920b3072e5bad0ef5d42f082d31eeb83478beee

Height

#348,053

Difficulty

10.248220

Transactions

7

Size

1.81 KB

Version

2

Bits

0a3f8b52

Nonce

80,000

Timestamp

1/7/2014, 2:02:24 PM

Confirmations

6,459,974

Merkle Root

17190013bf6922e8c1fd39acfdc731f94d545f73059497d1c33edd657fd33e77
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.713 × 10¹⁰⁰(101-digit number)
17135897270586781449…40914695502491272961
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.713 × 10¹⁰⁰(101-digit number)
17135897270586781449…40914695502491272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.427 × 10¹⁰⁰(101-digit number)
34271794541173562898…81829391004982545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.854 × 10¹⁰⁰(101-digit number)
68543589082347125796…63658782009965091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.370 × 10¹⁰¹(102-digit number)
13708717816469425159…27317564019930183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.741 × 10¹⁰¹(102-digit number)
27417435632938850318…54635128039860367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.483 × 10¹⁰¹(102-digit number)
54834871265877700637…09270256079720734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.096 × 10¹⁰²(103-digit number)
10966974253175540127…18540512159441469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.193 × 10¹⁰²(103-digit number)
21933948506351080254…37081024318882938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.386 × 10¹⁰²(103-digit number)
43867897012702160509…74162048637765877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.773 × 10¹⁰²(103-digit number)
87735794025404321019…48324097275531755521
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,708,260 XPM·at block #6,808,026 · 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