Block #364,657

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 5:35:49 AM · Difficulty 10.4213 · 6,444,638 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eb4d3478572b5161c85e37e991b79551d35a9c3185d2a7ae26adc41816762175

Height

#364,657

Difficulty

10.421274

Transactions

4

Size

1.94 KB

Version

2

Bits

0a6bd895

Nonce

392,784

Timestamp

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

Confirmations

6,444,638

Merkle Root

d3970e33b234e17c7a6ac6397fcfa39db9bafb8722593cf55ee95a9825fbb120
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.

3.846 × 10⁹⁸(99-digit number)
38469362022144838731…24244990152525928959
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
3.846 × 10⁹⁸(99-digit number)
38469362022144838731…24244990152525928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.693 × 10⁹⁸(99-digit number)
76938724044289677463…48489980305051857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.538 × 10⁹⁹(100-digit number)
15387744808857935492…96979960610103715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.077 × 10⁹⁹(100-digit number)
30775489617715870985…93959921220207431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.155 × 10⁹⁹(100-digit number)
61550979235431741971…87919842440414863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.231 × 10¹⁰⁰(101-digit number)
12310195847086348394…75839684880829726719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.462 × 10¹⁰⁰(101-digit number)
24620391694172696788…51679369761659453439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.924 × 10¹⁰⁰(101-digit number)
49240783388345393576…03358739523318906879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.848 × 10¹⁰⁰(101-digit number)
98481566776690787153…06717479046637813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.969 × 10¹⁰¹(102-digit number)
19696313355338157430…13434958093275627519
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,718,430 XPM·at block #6,809,294 · 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