Block #480,320

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 5:54:01 AM · Difficulty 10.5155 · 6,337,427 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
036f0bd14641003f67582176909ba35c04caba31576eb7c45298c0c3589bf60c

Height

#480,320

Difficulty

10.515456

Transactions

6

Size

2.27 KB

Version

2

Bits

0a83f4e8

Nonce

12,479

Timestamp

4/8/2014, 5:54:01 AM

Confirmations

6,337,427

Merkle Root

7f36264c710a894b2bb91f5609eb9a52991554b174d2004e6b7e72419ec709f1
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.854 × 10¹⁰⁰(101-digit number)
18542131361888570860…55023635158776585399
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.854 × 10¹⁰⁰(101-digit number)
18542131361888570860…55023635158776585399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.708 × 10¹⁰⁰(101-digit number)
37084262723777141720…10047270317553170799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.416 × 10¹⁰⁰(101-digit number)
74168525447554283440…20094540635106341599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.483 × 10¹⁰¹(102-digit number)
14833705089510856688…40189081270212683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.966 × 10¹⁰¹(102-digit number)
29667410179021713376…80378162540425366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.933 × 10¹⁰¹(102-digit number)
59334820358043426752…60756325080850732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.186 × 10¹⁰²(103-digit number)
11866964071608685350…21512650161701465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.373 × 10¹⁰²(103-digit number)
23733928143217370700…43025300323402931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.746 × 10¹⁰²(103-digit number)
47467856286434741401…86050600646805862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.493 × 10¹⁰²(103-digit number)
94935712572869482803…72101201293611724799
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,786,029 XPM·at block #6,817,746 · 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