Block #359,962

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 3:48:15 AM · Difficulty 10.3878 · 6,450,205 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ecc894ff46767bedfc9f4ec5f171c7711db18fe5c8369b92c0840bfc79feaa0e

Height

#359,962

Difficulty

10.387791

Transactions

4

Size

1.64 KB

Version

2

Bits

0a63463e

Nonce

26,867

Timestamp

1/15/2014, 3:48:15 AM

Confirmations

6,450,205

Merkle Root

8449ff46c9ee6add5450701e6ca5732bf2b3001ae3c264e8096caf9f7e80fcda
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.559 × 10¹⁰⁰(101-digit number)
55596037442450834475…38930225343028771519
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.559 × 10¹⁰⁰(101-digit number)
55596037442450834475…38930225343028771519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.111 × 10¹⁰¹(102-digit number)
11119207488490166895…77860450686057543039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.223 × 10¹⁰¹(102-digit number)
22238414976980333790…55720901372115086079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.447 × 10¹⁰¹(102-digit number)
44476829953960667580…11441802744230172159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.895 × 10¹⁰¹(102-digit number)
88953659907921335161…22883605488460344319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.779 × 10¹⁰²(103-digit number)
17790731981584267032…45767210976920688639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.558 × 10¹⁰²(103-digit number)
35581463963168534064…91534421953841377279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.116 × 10¹⁰²(103-digit number)
71162927926337068129…83068843907682754559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.423 × 10¹⁰³(104-digit number)
14232585585267413625…66137687815365509119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.846 × 10¹⁰³(104-digit number)
28465171170534827251…32275375630731018239
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,725,403 XPM·at block #6,810,166 · 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