Block #348,651

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 10:17:23 PM · Difficulty 10.2636 · 6,461,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6eebb9c355d4bc01066d52151159504b1898807887096a97c97b04a84bd89189

Height

#348,651

Difficulty

10.263597

Transactions

13

Size

6.70 KB

Version

2

Bits

0a437b1e

Nonce

23,565

Timestamp

1/7/2014, 10:17:23 PM

Confirmations

6,461,501

Merkle Root

60b617d67355fd560dce4aae8561e40054fa73c5dedc8c4de25ad51c6570cde6
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.063 × 10⁹⁶(97-digit number)
10635509496766562849…66748310360593292801
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.063 × 10⁹⁶(97-digit number)
10635509496766562849…66748310360593292801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.127 × 10⁹⁶(97-digit number)
21271018993533125698…33496620721186585601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.254 × 10⁹⁶(97-digit number)
42542037987066251397…66993241442373171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.508 × 10⁹⁶(97-digit number)
85084075974132502794…33986482884746342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.701 × 10⁹⁷(98-digit number)
17016815194826500558…67972965769492684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.403 × 10⁹⁷(98-digit number)
34033630389653001117…35945931538985369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.806 × 10⁹⁷(98-digit number)
68067260779306002235…71891863077970739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.361 × 10⁹⁸(99-digit number)
13613452155861200447…43783726155941478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.722 × 10⁹⁸(99-digit number)
27226904311722400894…87567452311882956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.445 × 10⁹⁸(99-digit number)
54453808623444801788…75134904623765913601
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,725,281 XPM·at block #6,810,151 · 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