Block #346,962

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 9:06:35 PM · Difficulty 10.2371 · 6,462,745 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5474f11dd38cf9d680968ae5d973e4126b80579d5220687c5c2e12e30887f397

Height

#346,962

Difficulty

10.237135

Transactions

14

Size

6.54 KB

Version

2

Bits

0a3cb4df

Nonce

60,520

Timestamp

1/6/2014, 9:06:35 PM

Confirmations

6,462,745

Merkle Root

c42a73458ee016b8b752a9fe4a9d7e6a7a69dec4484191e45cb4d446c32f4466
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.703 × 10¹⁰²(103-digit number)
17039274827146201537…13899714573331368959
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.703 × 10¹⁰²(103-digit number)
17039274827146201537…13899714573331368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.407 × 10¹⁰²(103-digit number)
34078549654292403075…27799429146662737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.815 × 10¹⁰²(103-digit number)
68157099308584806150…55598858293325475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.363 × 10¹⁰³(104-digit number)
13631419861716961230…11197716586650951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.726 × 10¹⁰³(104-digit number)
27262839723433922460…22395433173301903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.452 × 10¹⁰³(104-digit number)
54525679446867844920…44790866346603806719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.090 × 10¹⁰⁴(105-digit number)
10905135889373568984…89581732693207613439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.181 × 10¹⁰⁴(105-digit number)
21810271778747137968…79163465386415226879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.362 × 10¹⁰⁴(105-digit number)
43620543557494275936…58326930772830453759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.724 × 10¹⁰⁴(105-digit number)
87241087114988551872…16653861545660907519
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,721,735 XPM·at block #6,809,706 · 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