Block #348,814

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 12:46:43 AM · Difficulty 10.2656 · 6,475,818 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92dc164c302cb11aef9e3946ae15e65e741211477f950ee3d1550d816d83f189

Height

#348,814

Difficulty

10.265642

Transactions

7

Size

2.36 KB

Version

2

Bits

0a440117

Nonce

27,311

Timestamp

1/8/2014, 12:46:43 AM

Confirmations

6,475,818

Merkle Root

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

6.773 × 10¹⁰¹(102-digit number)
67739968473522867345…13979440837257908051
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
6.773 × 10¹⁰¹(102-digit number)
67739968473522867345…13979440837257908051
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.354 × 10¹⁰²(103-digit number)
13547993694704573469…27958881674515816101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.709 × 10¹⁰²(103-digit number)
27095987389409146938…55917763349031632201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.419 × 10¹⁰²(103-digit number)
54191974778818293876…11835526698063264401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.083 × 10¹⁰³(104-digit number)
10838394955763658775…23671053396126528801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.167 × 10¹⁰³(104-digit number)
21676789911527317550…47342106792253057601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.335 × 10¹⁰³(104-digit number)
43353579823054635101…94684213584506115201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.670 × 10¹⁰³(104-digit number)
86707159646109270202…89368427169012230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.734 × 10¹⁰⁴(105-digit number)
17341431929221854040…78736854338024460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.468 × 10¹⁰⁴(105-digit number)
34682863858443708080…57473708676048921601
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,841,119 XPM·at block #6,824,631 · 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