Block #485,774

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 6:15:38 AM · Difficulty 10.6130 · 6,323,621 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
421d7433454fc5693958d8473e82555e3c51d512250197b8b01ed6df457a4a39

Height

#485,774

Difficulty

10.613046

Transactions

7

Size

2.16 KB

Version

2

Bits

0a9cf096

Nonce

11,254,905

Timestamp

4/11/2014, 6:15:38 AM

Confirmations

6,323,621

Merkle Root

a2e2b6ec056e8b9b993e30604ce59fa4d7a961a680c6b9325444437255367dcf
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.338 × 10⁹⁵(96-digit number)
13384626966265288136…94131389017385485699
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.338 × 10⁹⁵(96-digit number)
13384626966265288136…94131389017385485699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.676 × 10⁹⁵(96-digit number)
26769253932530576272…88262778034770971399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.353 × 10⁹⁵(96-digit number)
53538507865061152545…76525556069541942799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.070 × 10⁹⁶(97-digit number)
10707701573012230509…53051112139083885599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.141 × 10⁹⁶(97-digit number)
21415403146024461018…06102224278167771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.283 × 10⁹⁶(97-digit number)
42830806292048922036…12204448556335542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.566 × 10⁹⁶(97-digit number)
85661612584097844072…24408897112671084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.713 × 10⁹⁷(98-digit number)
17132322516819568814…48817794225342169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.426 × 10⁹⁷(98-digit number)
34264645033639137628…97635588450684339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.852 × 10⁹⁷(98-digit number)
68529290067278275257…95271176901368678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.370 × 10⁹⁸(99-digit number)
13705858013455655051…90542353802737356799
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,719,233 XPM·at block #6,809,394 · 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.

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