Block #315,228

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 9:56:48 AM · Difficulty 10.0905 · 6,492,739 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b360bc51af0d9c874a3026c6df29a49d36867322642d5179491ca1587aa38d88

Height

#315,228

Difficulty

10.090537

Transactions

5

Size

1.68 KB

Version

2

Bits

0a172d68

Nonce

153,409

Timestamp

12/16/2013, 9:56:48 AM

Confirmations

6,492,739

Merkle Root

6a89f6f243830f27eed52e73969a22625d7df789fca54fbd14c0ff739bfa981f
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.

4.779 × 10¹⁰³(104-digit number)
47790000334658527060…30095676548740324899
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
4.779 × 10¹⁰³(104-digit number)
47790000334658527060…30095676548740324899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.558 × 10¹⁰³(104-digit number)
95580000669317054121…60191353097480649799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.911 × 10¹⁰⁴(105-digit number)
19116000133863410824…20382706194961299599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.823 × 10¹⁰⁴(105-digit number)
38232000267726821648…40765412389922599199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.646 × 10¹⁰⁴(105-digit number)
76464000535453643297…81530824779845198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.529 × 10¹⁰⁵(106-digit number)
15292800107090728659…63061649559690396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.058 × 10¹⁰⁵(106-digit number)
30585600214181457318…26123299119380793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.117 × 10¹⁰⁵(106-digit number)
61171200428362914637…52246598238761587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.223 × 10¹⁰⁶(107-digit number)
12234240085672582927…04493196477523174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.446 × 10¹⁰⁶(107-digit number)
24468480171345165855…08986392955046348799
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,707,779 XPM·at block #6,807,966 · 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