Block #486,433

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 2:25:59 PM · Difficulty 10.6258 · 6,340,675 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b789d4795eed9712bb8332bdfd1678e764ff0a0e9d139bfed1696af16310648a

Height

#486,433

Difficulty

10.625808

Transactions

2

Size

728 B

Version

2

Bits

0aa034f3

Nonce

103,842

Timestamp

4/11/2014, 2:25:59 PM

Confirmations

6,340,675

Merkle Root

38d12c03ebbf83b086b4102a42c9d9c4b380871f81b44acf94001dc9dfe6724a
Transactions (2)
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.037 × 10⁹⁴(95-digit number)
20371107773488055164…65576291786569875199
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.037 × 10⁹⁴(95-digit number)
20371107773488055164…65576291786569875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.074 × 10⁹⁴(95-digit number)
40742215546976110328…31152583573139750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.148 × 10⁹⁴(95-digit number)
81484431093952220656…62305167146279500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.629 × 10⁹⁵(96-digit number)
16296886218790444131…24610334292559001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.259 × 10⁹⁵(96-digit number)
32593772437580888262…49220668585118003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.518 × 10⁹⁵(96-digit number)
65187544875161776525…98441337170236006399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.303 × 10⁹⁶(97-digit number)
13037508975032355305…96882674340472012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.607 × 10⁹⁶(97-digit number)
26075017950064710610…93765348680944025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.215 × 10⁹⁶(97-digit number)
52150035900129421220…87530697361888051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.043 × 10⁹⁷(98-digit number)
10430007180025884244…75061394723776102399
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,861,042 XPM·at block #6,827,107 · 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