Block #354,686

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 4:46:23 PM · Difficulty 10.3485 · 6,470,985 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
23b85eee7c09574c0534d61190406a71ffb90f2de6b472b7524926077b661c3e

Height

#354,686

Difficulty

10.348502

Transactions

24

Size

6.25 KB

Version

2

Bits

0a59376c

Nonce

18,881

Timestamp

1/11/2014, 4:46:23 PM

Confirmations

6,470,985

Merkle Root

4fe564bc7f39f9d2c5f10fe62b47ddaab9fc4878048d211915ab8b56f0bd1330
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.617 × 10¹⁰⁰(101-digit number)
56170132946191243417…06212363563077305599
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.617 × 10¹⁰⁰(101-digit number)
56170132946191243417…06212363563077305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.123 × 10¹⁰¹(102-digit number)
11234026589238248683…12424727126154611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.246 × 10¹⁰¹(102-digit number)
22468053178476497366…24849454252309222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.493 × 10¹⁰¹(102-digit number)
44936106356952994733…49698908504618444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.987 × 10¹⁰¹(102-digit number)
89872212713905989467…99397817009236889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.797 × 10¹⁰²(103-digit number)
17974442542781197893…98795634018473779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.594 × 10¹⁰²(103-digit number)
35948885085562395787…97591268036947558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.189 × 10¹⁰²(103-digit number)
71897770171124791574…95182536073895116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.437 × 10¹⁰³(104-digit number)
14379554034224958314…90365072147790233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.875 × 10¹⁰³(104-digit number)
28759108068449916629…80730144295580467199
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,849,477 XPM·at block #6,825,670 · 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