Block #320,658

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 7:32:10 PM · Difficulty 10.1838 · 6,505,829 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
670a456d6b69b60ff6d5fb8f880f55c0f0544c7aca7bbad87cbe19bfb153bac0

Height

#320,658

Difficulty

10.183768

Transactions

1

Size

1004 B

Version

2

Bits

0a2f0b68

Nonce

5,480

Timestamp

12/19/2013, 7:32:10 PM

Confirmations

6,505,829

Merkle Root

617e5f6cf61f91972cfc5b52fbd9ce5b4e055446818af4080ce1b3febae8d962
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.020 × 10⁹⁸(99-digit number)
10205855521663135849…56244552272205042799
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.020 × 10⁹⁸(99-digit number)
10205855521663135849…56244552272205042799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.041 × 10⁹⁸(99-digit number)
20411711043326271698…12489104544410085599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.082 × 10⁹⁸(99-digit number)
40823422086652543397…24978209088820171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.164 × 10⁹⁸(99-digit number)
81646844173305086795…49956418177640342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.632 × 10⁹⁹(100-digit number)
16329368834661017359…99912836355280684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.265 × 10⁹⁹(100-digit number)
32658737669322034718…99825672710561369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.531 × 10⁹⁹(100-digit number)
65317475338644069436…99651345421122739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.306 × 10¹⁰⁰(101-digit number)
13063495067728813887…99302690842245478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.612 × 10¹⁰⁰(101-digit number)
26126990135457627774…98605381684490956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.225 × 10¹⁰⁰(101-digit number)
52253980270915255548…97210763368981913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.045 × 10¹⁰¹(102-digit number)
10450796054183051109…94421526737963827199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,856,036 XPM·at block #6,826,486 · 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