Block #346,424

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 1:10:57 PM · Difficulty 10.2275 · 6,468,468 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
128365e115425e3b6630f51733b700f7d06de583d8ccf6142981f8f798996534

Height

#346,424

Difficulty

10.227458

Transactions

2

Size

1.64 KB

Version

2

Bits

0a3a3ab4

Nonce

105,649

Timestamp

1/6/2014, 1:10:57 PM

Confirmations

6,468,468

Merkle Root

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

3.250 × 10¹⁰²(103-digit number)
32509284943225403329…34070817579282585599
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
3.250 × 10¹⁰²(103-digit number)
32509284943225403329…34070817579282585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.501 × 10¹⁰²(103-digit number)
65018569886450806658…68141635158565171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.300 × 10¹⁰³(104-digit number)
13003713977290161331…36283270317130342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.600 × 10¹⁰³(104-digit number)
26007427954580322663…72566540634260684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.201 × 10¹⁰³(104-digit number)
52014855909160645326…45133081268521369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.040 × 10¹⁰⁴(105-digit number)
10402971181832129065…90266162537042739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.080 × 10¹⁰⁴(105-digit number)
20805942363664258130…80532325074085478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.161 × 10¹⁰⁴(105-digit number)
41611884727328516261…61064650148170956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.322 × 10¹⁰⁴(105-digit number)
83223769454657032523…22129300296341913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.664 × 10¹⁰⁵(106-digit number)
16644753890931406504…44258600592683827199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,763,224 XPM·at block #6,814,891 · 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