Block #364,658

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 5:35:34 AM · Difficulty 10.4212 · 6,443,539 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
41363c776f2e7b746a22b810745eaeb4562cf2512f01aa6c7445946c4438c46e

Height

#364,658

Difficulty

10.421163

Transactions

3

Size

661 B

Version

2

Bits

0a6bd14f

Nonce

39,332

Timestamp

1/18/2014, 5:35:34 AM

Confirmations

6,443,539

Merkle Root

ffbc19d09564b7657999da69b08bee023b4b6033da9a529821e10e07eae230f6
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.044 × 10¹⁰⁰(101-digit number)
50441346952989559043…08321791827579712719
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.044 × 10¹⁰⁰(101-digit number)
50441346952989559043…08321791827579712719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.008 × 10¹⁰¹(102-digit number)
10088269390597911808…16643583655159425439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.017 × 10¹⁰¹(102-digit number)
20176538781195823617…33287167310318850879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.035 × 10¹⁰¹(102-digit number)
40353077562391647234…66574334620637701759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.070 × 10¹⁰¹(102-digit number)
80706155124783294469…33148669241275403519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.614 × 10¹⁰²(103-digit number)
16141231024956658893…66297338482550807039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.228 × 10¹⁰²(103-digit number)
32282462049913317787…32594676965101614079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.456 × 10¹⁰²(103-digit number)
64564924099826635575…65189353930203228159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.291 × 10¹⁰³(104-digit number)
12912984819965327115…30378707860406456319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.582 × 10¹⁰³(104-digit number)
25825969639930654230…60757415720812912639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.165 × 10¹⁰³(104-digit number)
51651939279861308460…21514831441625825279
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,709,627 XPM·at block #6,808,196 · 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