Block #320,794

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 9:37:56 PM · Difficulty 10.1859 · 6,504,899 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5e6b1e85afb492af43e03ef0783b4c6171257d163f59d5c5951587f17ff09fb3

Height

#320,794

Difficulty

10.185925

Transactions

1

Size

1.05 KB

Version

2

Bits

0a2f98c4

Nonce

6,622

Timestamp

12/19/2013, 9:37:56 PM

Confirmations

6,504,899

Merkle Root

13a4f15d736bbc6624d9d8e101104bc69d3f0df00ba2b8c1b05c9e86ff3c7647
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.958 × 10¹⁰²(103-digit number)
29586453234462733213…48269475435300726519
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.958 × 10¹⁰²(103-digit number)
29586453234462733213…48269475435300726519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.917 × 10¹⁰²(103-digit number)
59172906468925466427…96538950870601453039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.183 × 10¹⁰³(104-digit number)
11834581293785093285…93077901741202906079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.366 × 10¹⁰³(104-digit number)
23669162587570186571…86155803482405812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.733 × 10¹⁰³(104-digit number)
47338325175140373142…72311606964811624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.467 × 10¹⁰³(104-digit number)
94676650350280746284…44623213929623248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.893 × 10¹⁰⁴(105-digit number)
18935330070056149256…89246427859246497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.787 × 10¹⁰⁴(105-digit number)
37870660140112298513…78492855718492994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.574 × 10¹⁰⁴(105-digit number)
75741320280224597027…56985711436985989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.514 × 10¹⁰⁵(106-digit number)
15148264056044919405…13971422873971978239
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,849,656 XPM·at block #6,825,692 · 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