Block #358,716

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 7:18:38 AM · Difficulty 10.3853 · 6,450,027 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
05e0e60bee04e72f57695a3ce30d2a85de2849a4c0ad5d0eb9472416b88c749b

Height

#358,716

Difficulty

10.385316

Transactions

6

Size

1.74 KB

Version

2

Bits

0a62a40f

Nonce

95,875

Timestamp

1/14/2014, 7:18:38 AM

Confirmations

6,450,027

Merkle Root

6104519f48d220fc31b7f1ab7574ca55372edc707718c2e4239aa5ebf018bfa9
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.

2.156 × 10¹⁰⁰(101-digit number)
21568263464758980721…92124682798969341519
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
2.156 × 10¹⁰⁰(101-digit number)
21568263464758980721…92124682798969341519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.313 × 10¹⁰⁰(101-digit number)
43136526929517961443…84249365597938683039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.627 × 10¹⁰⁰(101-digit number)
86273053859035922886…68498731195877366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.725 × 10¹⁰¹(102-digit number)
17254610771807184577…36997462391754732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.450 × 10¹⁰¹(102-digit number)
34509221543614369154…73994924783509464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.901 × 10¹⁰¹(102-digit number)
69018443087228738308…47989849567018928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.380 × 10¹⁰²(103-digit number)
13803688617445747661…95979699134037857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.760 × 10¹⁰²(103-digit number)
27607377234891495323…91959398268075714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.521 × 10¹⁰²(103-digit number)
55214754469782990647…83918796536151429119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.104 × 10¹⁰³(104-digit number)
11042950893956598129…67837593072302858239
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,713,991 XPM·at block #6,808,742 · 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