Block #358,680

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 6:51:49 AM · Difficulty 10.3841 · 6,449,386 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32b6058f20768984f86c1aedf4ab58131f40c3b0a31f7e0001c2905da826a2ab

Height

#358,680

Difficulty

10.384090

Transactions

11

Size

4.53 KB

Version

2

Bits

0a6253bf

Nonce

10,552

Timestamp

1/14/2014, 6:51:49 AM

Confirmations

6,449,386

Merkle Root

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

4.178 × 10¹⁰¹(102-digit number)
41789662981062796835…80256961767076006399
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
4.178 × 10¹⁰¹(102-digit number)
41789662981062796835…80256961767076006399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.357 × 10¹⁰¹(102-digit number)
83579325962125593671…60513923534152012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.671 × 10¹⁰²(103-digit number)
16715865192425118734…21027847068304025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.343 × 10¹⁰²(103-digit number)
33431730384850237468…42055694136608051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.686 × 10¹⁰²(103-digit number)
66863460769700474937…84111388273216102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.337 × 10¹⁰³(104-digit number)
13372692153940094987…68222776546432204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.674 × 10¹⁰³(104-digit number)
26745384307880189974…36445553092864409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.349 × 10¹⁰³(104-digit number)
53490768615760379949…72891106185728819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.069 × 10¹⁰⁴(105-digit number)
10698153723152075989…45782212371457638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.139 × 10¹⁰⁴(105-digit number)
21396307446304151979…91564424742915276799
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,708,573 XPM·at block #6,808,065 · 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