Block #339,580

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2014, 5:20:48 AM · Difficulty 10.1254 · 6,491,015 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
876f52cd0259731ae2746135d83f48df74a3479ec964e6fe0726e9421d07a1e0

Height

#339,580

Difficulty

10.125448

Transactions

17

Size

11.61 KB

Version

2

Bits

0a201d60

Nonce

102,284

Timestamp

1/2/2014, 5:20:48 AM

Confirmations

6,491,015

Merkle Root

da966aa5000d73c3b6f2c3c46f4ce1b91fc1f588c3d2d4191ad109a868168f02
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.670 × 10⁹²(93-digit number)
76703156663551695596…92660132528871436159
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.670 × 10⁹²(93-digit number)
76703156663551695596…92660132528871436159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.534 × 10⁹³(94-digit number)
15340631332710339119…85320265057742872319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.068 × 10⁹³(94-digit number)
30681262665420678238…70640530115485744639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.136 × 10⁹³(94-digit number)
61362525330841356477…41281060230971489279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.227 × 10⁹⁴(95-digit number)
12272505066168271295…82562120461942978559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.454 × 10⁹⁴(95-digit number)
24545010132336542590…65124240923885957119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.909 × 10⁹⁴(95-digit number)
49090020264673085181…30248481847771914239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.818 × 10⁹⁴(95-digit number)
98180040529346170363…60496963695543828479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.963 × 10⁹⁵(96-digit number)
19636008105869234072…20993927391087656959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.927 × 10⁹⁵(96-digit number)
39272016211738468145…41987854782175313919
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,888,881 XPM·at block #6,830,594 · 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