Block #346,056

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 8:12:44 AM · Difficulty 10.2165 · 6,461,550 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
521b837ed879da1bcfaf3e8da657fe19dd9f4327a368bd89e10947ddc6078d0a

Height

#346,056

Difficulty

10.216499

Transactions

7

Size

3.41 KB

Version

2

Bits

0a376c73

Nonce

8,988

Timestamp

1/6/2014, 8:12:44 AM

Confirmations

6,461,550

Merkle Root

7367e86f19d0b85b450c53036229852e919b80f0b0fe45b4463add962aee5d3f
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.650 × 10¹⁰⁹(110-digit number)
56501722081312317419…82462846475308267519
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.650 × 10¹⁰⁹(110-digit number)
56501722081312317419…82462846475308267519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.130 × 10¹¹⁰(111-digit number)
11300344416262463483…64925692950616535039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.260 × 10¹¹⁰(111-digit number)
22600688832524926967…29851385901233070079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.520 × 10¹¹⁰(111-digit number)
45201377665049853935…59702771802466140159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.040 × 10¹¹⁰(111-digit number)
90402755330099707870…19405543604932280319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.808 × 10¹¹¹(112-digit number)
18080551066019941574…38811087209864560639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.616 × 10¹¹¹(112-digit number)
36161102132039883148…77622174419729121279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.232 × 10¹¹¹(112-digit number)
72322204264079766296…55244348839458242559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.446 × 10¹¹²(113-digit number)
14464440852815953259…10488697678916485119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.892 × 10¹¹²(113-digit number)
28928881705631906518…20977395357832970239
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,704,878 XPM·at block #6,807,605 · 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