Block #321,252

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 4:59:57 AM · Difficulty 10.1886 · 6,494,794 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
df54024f724b354a96feb9219149b9a1994ff367fe870cf17040b5c530a1c924

Height

#321,252

Difficulty

10.188581

Transactions

22

Size

7.00 KB

Version

2

Bits

0a3046d0

Nonce

29,509

Timestamp

12/20/2013, 4:59:57 AM

Confirmations

6,494,794

Merkle Root

b70f87947fb857adf7d287b304a29344fd5239dde22fc7b165926bcc1455c6a9
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.246 × 10⁹⁹(100-digit number)
42466950580510122589…15326756701144535999
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.246 × 10⁹⁹(100-digit number)
42466950580510122589…15326756701144535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.493 × 10⁹⁹(100-digit number)
84933901161020245179…30653513402289071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.698 × 10¹⁰⁰(101-digit number)
16986780232204049035…61307026804578143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.397 × 10¹⁰⁰(101-digit number)
33973560464408098071…22614053609156287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.794 × 10¹⁰⁰(101-digit number)
67947120928816196143…45228107218312575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.358 × 10¹⁰¹(102-digit number)
13589424185763239228…90456214436625151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.717 × 10¹⁰¹(102-digit number)
27178848371526478457…80912428873250303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.435 × 10¹⁰¹(102-digit number)
54357696743052956915…61824857746500607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.087 × 10¹⁰²(103-digit number)
10871539348610591383…23649715493001215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.174 × 10¹⁰²(103-digit number)
21743078697221182766…47299430986002431999
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,772,484 XPM·at block #6,816,045 · 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