Block #352,748

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 1:05:43 PM · Difficulty 10.3113 · 6,459,829 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f7718c9840672eb1abe3d5ece23c07f45303688c6e28aeffc1b3dfb4d665f3b

Height

#352,748

Difficulty

10.311348

Transactions

4

Size

1.71 KB

Version

2

Bits

0a4fb482

Nonce

580,487

Timestamp

1/10/2014, 1:05:43 PM

Confirmations

6,459,829

Merkle Root

1abe46af27f782a4367c235f41a2abe478bc07af8067e5a27c8efb94d69a1d1c
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.298 × 10⁹⁷(98-digit number)
12982409006285522788…22457110451233842841
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.298 × 10⁹⁷(98-digit number)
12982409006285522788…22457110451233842841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.596 × 10⁹⁷(98-digit number)
25964818012571045577…44914220902467685681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.192 × 10⁹⁷(98-digit number)
51929636025142091154…89828441804935371361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.038 × 10⁹⁸(99-digit number)
10385927205028418230…79656883609870742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.077 × 10⁹⁸(99-digit number)
20771854410056836461…59313767219741485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.154 × 10⁹⁸(99-digit number)
41543708820113672923…18627534439482970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.308 × 10⁹⁸(99-digit number)
83087417640227345847…37255068878965941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.661 × 10⁹⁹(100-digit number)
16617483528045469169…74510137757931883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.323 × 10⁹⁹(100-digit number)
33234967056090938338…49020275515863767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.646 × 10⁹⁹(100-digit number)
66469934112181876677…98040551031727534081
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,744,650 XPM·at block #6,812,576 · 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