Block #349,179

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 6:24:09 AM · Difficulty 10.2698 · 6,467,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
218de99ac8c3e0f7b4330a85fdebdf5670971eed4c78ed73c47c60bf4820adf8

Height

#349,179

Difficulty

10.269790

Transactions

13

Size

8.32 KB

Version

2

Bits

0a4510ef

Nonce

105,501

Timestamp

1/8/2014, 6:24:09 AM

Confirmations

6,467,660

Merkle Root

d3e0e075af1159f32356cbf4cede69ae9bfae18e252a5b331ac6e6d763bdccc2
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.

7.054 × 10⁹³(94-digit number)
70542055518150030423…74504442563764174081
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
7.054 × 10⁹³(94-digit number)
70542055518150030423…74504442563764174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.410 × 10⁹⁴(95-digit number)
14108411103630006084…49008885127528348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.821 × 10⁹⁴(95-digit number)
28216822207260012169…98017770255056696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.643 × 10⁹⁴(95-digit number)
56433644414520024338…96035540510113392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.128 × 10⁹⁵(96-digit number)
11286728882904004867…92071081020226785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.257 × 10⁹⁵(96-digit number)
22573457765808009735…84142162040453570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.514 × 10⁹⁵(96-digit number)
45146915531616019470…68284324080907141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.029 × 10⁹⁵(96-digit number)
90293831063232038941…36568648161814282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.805 × 10⁹⁶(97-digit number)
18058766212646407788…73137296323628564481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.611 × 10⁹⁶(97-digit number)
36117532425292815576…46274592647257128961
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,778,752 XPM·at block #6,816,838 · 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