Block #354,906

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 7:55:04 PM · Difficulty 10.3525 · 6,461,921 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e5b85a17e8f12a0c704ae08b35ac961199fdd837b3ede4468ea18b18bcf1d50e

Height

#354,906

Difficulty

10.352488

Transactions

8

Size

3.19 KB

Version

2

Bits

0a5a3ca1

Nonce

7,977

Timestamp

1/11/2014, 7:55:04 PM

Confirmations

6,461,921

Merkle Root

09c79b15355aed967853ba930702caca368d598f2197127d132ffef9b47c54d7
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.

1.214 × 10¹⁰¹(102-digit number)
12149834737304128062…43931864780702812799
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
1.214 × 10¹⁰¹(102-digit number)
12149834737304128062…43931864780702812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.429 × 10¹⁰¹(102-digit number)
24299669474608256124…87863729561405625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.859 × 10¹⁰¹(102-digit number)
48599338949216512249…75727459122811251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.719 × 10¹⁰¹(102-digit number)
97198677898433024498…51454918245622502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.943 × 10¹⁰²(103-digit number)
19439735579686604899…02909836491245004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.887 × 10¹⁰²(103-digit number)
38879471159373209799…05819672982490009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.775 × 10¹⁰²(103-digit number)
77758942318746419598…11639345964980019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.555 × 10¹⁰³(104-digit number)
15551788463749283919…23278691929960038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.110 × 10¹⁰³(104-digit number)
31103576927498567839…46557383859920076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.220 × 10¹⁰³(104-digit number)
62207153854997135678…93114767719840153599
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,778,655 XPM·at block #6,816,826 · 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