Block #347,682

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 8:45:34 AM · Difficulty 10.2401 · 6,463,477 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee103c8dd46c7fa84394761e12fbc1088f8e93858e2350a54234d53816cb7ed6

Height

#347,682

Difficulty

10.240101

Transactions

2

Size

578 B

Version

2

Bits

0a3d7743

Nonce

87,762

Timestamp

1/7/2014, 8:45:34 AM

Confirmations

6,463,477

Merkle Root

0dd2847282fe9dd349678a58d58221d056bb8d7a5761eb408e3f5db6504d08d5
Transactions (2)
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.

2.804 × 10¹⁰⁴(105-digit number)
28041165671560587902…21774763999388625601
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
2.804 × 10¹⁰⁴(105-digit number)
28041165671560587902…21774763999388625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.608 × 10¹⁰⁴(105-digit number)
56082331343121175804…43549527998777251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.121 × 10¹⁰⁵(106-digit number)
11216466268624235160…87099055997554502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.243 × 10¹⁰⁵(106-digit number)
22432932537248470321…74198111995109004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.486 × 10¹⁰⁵(106-digit number)
44865865074496940643…48396223990218009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.973 × 10¹⁰⁵(106-digit number)
89731730148993881287…96792447980436019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.794 × 10¹⁰⁶(107-digit number)
17946346029798776257…93584895960872038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.589 × 10¹⁰⁶(107-digit number)
35892692059597552515…87169791921744076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.178 × 10¹⁰⁶(107-digit number)
71785384119195105030…74339583843488153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.435 × 10¹⁰⁷(108-digit number)
14357076823839021006…48679167686976307201
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,733,383 XPM·at block #6,811,158 · 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