Block #313,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 1:23:45 PM · Difficulty 10.0141 · 6,500,623 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8fd15b8213ed08fedcea2800ab67601168ce55f5e3d62d72a474a926e8242cd9

Height

#313,589

Difficulty

10.014065

Transactions

1

Size

1.11 KB

Version

2

Bits

0a0399bc

Nonce

276,645

Timestamp

12/15/2013, 1:23:45 PM

Confirmations

6,500,623

Merkle Root

9a1e28315f2e50731d29f0b5ffce4ec019e3133780d08a69a9cc0f3fc9e98627
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.143 × 10⁹⁹(100-digit number)
21433164263892338831…17289681485786896639
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.143 × 10⁹⁹(100-digit number)
21433164263892338831…17289681485786896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.286 × 10⁹⁹(100-digit number)
42866328527784677662…34579362971573793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.573 × 10⁹⁹(100-digit number)
85732657055569355325…69158725943147586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.714 × 10¹⁰⁰(101-digit number)
17146531411113871065…38317451886295173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.429 × 10¹⁰⁰(101-digit number)
34293062822227742130…76634903772590346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.858 × 10¹⁰⁰(101-digit number)
68586125644455484260…53269807545180692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.371 × 10¹⁰¹(102-digit number)
13717225128891096852…06539615090361384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.743 × 10¹⁰¹(102-digit number)
27434450257782193704…13079230180722769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.486 × 10¹⁰¹(102-digit number)
54868900515564387408…26158460361445539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.097 × 10¹⁰²(103-digit number)
10973780103112877481…52316920722891079679
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,757,764 XPM·at block #6,814,211 · 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