Block #351,957

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 1:09:23 AM · Difficulty 10.3008 · 6,458,982 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3b54ef9392682234b4f6a91851bf12c040d100e91ae10919d34cfbd5d5a78f7a

Height

#351,957

Difficulty

10.300757

Transactions

9

Size

2.13 KB

Version

2

Bits

0a4cfe64

Nonce

122,317

Timestamp

1/10/2014, 1:09:23 AM

Confirmations

6,458,982

Merkle Root

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

5.809 × 10¹⁰¹(102-digit number)
58094614667930974262…16743015776682152959
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
5.809 × 10¹⁰¹(102-digit number)
58094614667930974262…16743015776682152959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.161 × 10¹⁰²(103-digit number)
11618922933586194852…33486031553364305919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.323 × 10¹⁰²(103-digit number)
23237845867172389705…66972063106728611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.647 × 10¹⁰²(103-digit number)
46475691734344779410…33944126213457223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.295 × 10¹⁰²(103-digit number)
92951383468689558820…67888252426914447359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.859 × 10¹⁰³(104-digit number)
18590276693737911764…35776504853828894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.718 × 10¹⁰³(104-digit number)
37180553387475823528…71553009707657789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.436 × 10¹⁰³(104-digit number)
74361106774951647056…43106019415315578879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.487 × 10¹⁰⁴(105-digit number)
14872221354990329411…86212038830631157759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.974 × 10¹⁰⁴(105-digit number)
29744442709980658822…72424077661262315519
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,731,609 XPM·at block #6,810,938 · 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