Block #321,660

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 11:21:07 AM · Difficulty 10.1929 · 6,492,643 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
520a3b7a5fc46d10bb03c1cb69def049486ffeac0d8786d85b573cd72339cba5

Height

#321,660

Difficulty

10.192941

Transactions

1

Size

1.14 KB

Version

2

Bits

0a31648f

Nonce

240,800

Timestamp

12/20/2013, 11:21:07 AM

Confirmations

6,492,643

Merkle Root

eb04ff2689e1f3aa1b2dc13e90ff16d3072fe4e2c07eb7e63d1bfc935a96f2ed
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.220 × 10⁹²(93-digit number)
42202985820484154899…57292376360920599679
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.220 × 10⁹²(93-digit number)
42202985820484154899…57292376360920599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.440 × 10⁹²(93-digit number)
84405971640968309799…14584752721841199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.688 × 10⁹³(94-digit number)
16881194328193661959…29169505443682398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.376 × 10⁹³(94-digit number)
33762388656387323919…58339010887364797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.752 × 10⁹³(94-digit number)
67524777312774647839…16678021774729594879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.350 × 10⁹⁴(95-digit number)
13504955462554929567…33356043549459189759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.700 × 10⁹⁴(95-digit number)
27009910925109859135…66712087098918379519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.401 × 10⁹⁴(95-digit number)
54019821850219718271…33424174197836759039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.080 × 10⁹⁵(96-digit number)
10803964370043943654…66848348395673518079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.160 × 10⁹⁵(96-digit number)
21607928740087887308…33696696791347036159
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,758,487 XPM·at block #6,814,302 · 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