Block #327,065

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/24/2013, 7:10:04 AM · Difficulty 10.1774 · 6,487,772 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03491a6a87e2648ed39cfe88d6b8bea9b714198e1fc756f28a626a6379b38850

Height

#327,065

Difficulty

10.177386

Transactions

9

Size

2.07 KB

Version

2

Bits

0a2d6923

Nonce

62,511

Timestamp

12/24/2013, 7:10:04 AM

Confirmations

6,487,772

Merkle Root

181f7fe3975eb2c0e70f39649354347e6a9aefa5893f79b64da41c749a5685eb
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.

1.259 × 10¹⁰²(103-digit number)
12599989693575642709…95574319801345179279
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
1.259 × 10¹⁰²(103-digit number)
12599989693575642709…95574319801345179279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.519 × 10¹⁰²(103-digit number)
25199979387151285418…91148639602690358559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.039 × 10¹⁰²(103-digit number)
50399958774302570837…82297279205380717119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.007 × 10¹⁰³(104-digit number)
10079991754860514167…64594558410761434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.015 × 10¹⁰³(104-digit number)
20159983509721028334…29189116821522868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.031 × 10¹⁰³(104-digit number)
40319967019442056669…58378233643045736959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.063 × 10¹⁰³(104-digit number)
80639934038884113339…16756467286091473919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.612 × 10¹⁰⁴(105-digit number)
16127986807776822667…33512934572182947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.225 × 10¹⁰⁴(105-digit number)
32255973615553645335…67025869144365895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.451 × 10¹⁰⁴(105-digit number)
64511947231107290671…34051738288731791359
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,762,786 XPM·at block #6,814,836 · 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.
Privacy Policy·

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