Block #355,817

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2014, 9:39:00 AM · Difficulty 10.3647 · 6,471,169 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd085c1fef059b2bc243b5a438c139069c1bce02e2e74ef6a65d09a2f09ca857

Height

#355,817

Difficulty

10.364666

Transactions

1

Size

870 B

Version

2

Bits

0a5d5abe

Nonce

212,287

Timestamp

1/12/2014, 9:39:00 AM

Confirmations

6,471,169

Merkle Root

dfcba077979550c578ca5af8f9f0c05ebb37657786744e2d44611268aed89916
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.992 × 10¹⁰¹(102-digit number)
69923193608321835698…96981241902835731661
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.992 × 10¹⁰¹(102-digit number)
69923193608321835698…96981241902835731661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.398 × 10¹⁰²(103-digit number)
13984638721664367139…93962483805671463321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.796 × 10¹⁰²(103-digit number)
27969277443328734279…87924967611342926641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.593 × 10¹⁰²(103-digit number)
55938554886657468558…75849935222685853281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.118 × 10¹⁰³(104-digit number)
11187710977331493711…51699870445371706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.237 × 10¹⁰³(104-digit number)
22375421954662987423…03399740890743413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.475 × 10¹⁰³(104-digit number)
44750843909325974846…06799481781486826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.950 × 10¹⁰³(104-digit number)
89501687818651949693…13598963562973652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.790 × 10¹⁰⁴(105-digit number)
17900337563730389938…27197927125947304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.580 × 10¹⁰⁴(105-digit number)
35800675127460779877…54395854251894609921
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,860,063 XPM·at block #6,826,985 · 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