Block #347,683

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 8:47:12 AM · Difficulty 10.2402 · 6,467,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5f08248843a49778cb74ce1a4e27b9a2165ea47c32a2e36b24fafedfcf71622

Height

#347,683

Difficulty

10.240187

Transactions

6

Size

33.83 KB

Version

2

Bits

0a3d7cdd

Nonce

389,756

Timestamp

1/7/2014, 8:47:12 AM

Confirmations

6,467,266

Merkle Root

a5902b12e51eec92cbf2e54d796d76773dbe4e8de12d6e013f2e90f1e0b9065a
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.941 × 10¹⁰⁰(101-digit number)
19411401436178239115…93278064619371824241
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.941 × 10¹⁰⁰(101-digit number)
19411401436178239115…93278064619371824241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.882 × 10¹⁰⁰(101-digit number)
38822802872356478231…86556129238743648481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.764 × 10¹⁰⁰(101-digit number)
77645605744712956462…73112258477487296961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.552 × 10¹⁰¹(102-digit number)
15529121148942591292…46224516954974593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.105 × 10¹⁰¹(102-digit number)
31058242297885182584…92449033909949187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.211 × 10¹⁰¹(102-digit number)
62116484595770365169…84898067819898375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.242 × 10¹⁰²(103-digit number)
12423296919154073033…69796135639796751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.484 × 10¹⁰²(103-digit number)
24846593838308146067…39592271279593502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.969 × 10¹⁰²(103-digit number)
49693187676616292135…79184542559187005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.938 × 10¹⁰²(103-digit number)
99386375353232584271…58369085118374010881
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,763,689 XPM·at block #6,814,948 · 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