Block #354,178

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 9:41:51 AM · Difficulty 10.3375 · 6,458,683 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
448bb161c9c619a34a06245bc2a267e0a3ad05351bb1c14c1822ddb6b952e5d2

Height

#354,178

Difficulty

10.337487

Transactions

1

Size

869 B

Version

2

Bits

0a56658f

Nonce

6,748

Timestamp

1/11/2014, 9:41:51 AM

Confirmations

6,458,683

Merkle Root

c7f1c0335765181d3c8606659cc20e58955fd6a7a79fe79f0fc0af12a644a2ff
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.858 × 10⁹⁸(99-digit number)
78586820063302881739…24042972201779124481
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.858 × 10⁹⁸(99-digit number)
78586820063302881739…24042972201779124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.571 × 10⁹⁹(100-digit number)
15717364012660576347…48085944403558248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.143 × 10⁹⁹(100-digit number)
31434728025321152695…96171888807116497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.286 × 10⁹⁹(100-digit number)
62869456050642305391…92343777614232995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.257 × 10¹⁰⁰(101-digit number)
12573891210128461078…84687555228465991681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.514 × 10¹⁰⁰(101-digit number)
25147782420256922156…69375110456931983361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.029 × 10¹⁰⁰(101-digit number)
50295564840513844313…38750220913863966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.005 × 10¹⁰¹(102-digit number)
10059112968102768862…77500441827727933441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.011 × 10¹⁰¹(102-digit number)
20118225936205537725…55000883655455866881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.023 × 10¹⁰¹(102-digit number)
40236451872411075450…10001767310911733761
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,746,925 XPM·at block #6,812,860 · 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