Block #358,514

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 3:51:20 AM · Difficulty 10.3858 · 6,448,056 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f22be35627552a5d24272d69eafaa3d67b29a701e1aa8491458fe39b2c52e13f

Height

#358,514

Difficulty

10.385839

Transactions

2

Size

1.14 KB

Version

2

Bits

0a62c65d

Nonce

209,698

Timestamp

1/14/2014, 3:51:20 AM

Confirmations

6,448,056

Merkle Root

ee578ee0af4c8fde6857e5e19f877d550f5847b7247849aba165354b3a9c434b
Transactions (2)
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.321 × 10⁹⁶(97-digit number)
33210107088696795375…71704038862810742179
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.321 × 10⁹⁶(97-digit number)
33210107088696795375…71704038862810742179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.642 × 10⁹⁶(97-digit number)
66420214177393590751…43408077725621484359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.328 × 10⁹⁷(98-digit number)
13284042835478718150…86816155451242968719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.656 × 10⁹⁷(98-digit number)
26568085670957436300…73632310902485937439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.313 × 10⁹⁷(98-digit number)
53136171341914872600…47264621804971874879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.062 × 10⁹⁸(99-digit number)
10627234268382974520…94529243609943749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.125 × 10⁹⁸(99-digit number)
21254468536765949040…89058487219887499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.250 × 10⁹⁸(99-digit number)
42508937073531898080…78116974439774999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.501 × 10⁹⁸(99-digit number)
85017874147063796161…56233948879549998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.700 × 10⁹⁹(100-digit number)
17003574829412759232…12467897759099996159
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,696,657 XPM·at block #6,806,569 · 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