1461097805-cd9cb49b-1c13-491a-b0b1-9fbe560c76d6

1. A method to represent transactional value (currency, money) as a bit string where the size of the string (bit count) rather than the bit identity (0 or 1) determines the value of a string; thereby allowing a digital \u201cmint\u201d to issue 2n distinct \u201cdigital coins\u201d of the same denomination where n is the bit size of the string; such string will be associated with a header string containing meta information about the string that together with the value string will comprise a digital coin; allowing for a do-it-yourself coin split, by simply breaking off a substring thereto where the size of the substring (bit count) will reflect the split-off value; each coin may be purchased from a coin issuer (mint) who might collect US$ for the coin, or give it out as a gift, or loyalty points, and where the redemption of the coin against goods or US$ will be carried out by the mint after validating the coin for (i) being a valid coin, namely a coin for which the bit identities is the same as one that was issued by the mint, and (2) that the redeemed coin has not been redeemed before.
(1.1) A method as in (1) where the coin validation process is carried out through a delegated authentication hierarchy where only the mint (the top validation source) knows the identity of all the bits that comprise the coin, while lower nodes in the authentication hierarchy know only a portion of the coins bits, thereby a node is being prevented from defrauding an upper node, which by structure knows more bits from each coin than the lower node, and where the size of the coin is sufficiently high to eliminate the practical risk of guessing the identity of the coin bits, and where each minted coin will be found in one and only one node of the same level in the hierarchy such that a coin holder will not be able to validate his or her coin twice or more with sibling authentication nodes, this method of delegation of authentication also incorporating a send-up updates from each node in the hierarchy to its parent node, informing upward that a coin was redeemed; as well as send-down update from each node to its child node; such procedure alleviates the burden on the single validation source and distributes it to as many as desired lower level hierarchy authentication nodes, making the implementation of such a platform more practical and resistant to unexpected network failures.
(1.2) A method as in (1) whereby the currency transaction is carried out via software to software negotiations by preset rules, and whereby software packets carry digital coins as in (1), and split them off to express a given transaction; such method being used to effect a peer-to-peer (P2P) efficiency by requiring any sending node to pay up (with digital coins), for the service, and they do so by splitting their attached coin to pay servicing nodes of the P2P network along its path; and by modifying the \u201cKasaa-like\u201d distribution method by allowing each source of a digital file to charge for copying it, any declared sale price, and by redeeming the digital coin from its issuer (the mint) after deduction of service fee to the mint, and royalties to the digital rights holder, thereby turning each node to be a distribution agent on behalf of the digital rights owner.
(1.3) A method as in (1) allowing a user to open a payment string to an online vendor charging micropayments by chopping off appropriate number of bits from the presented digital coin, since the bit count represent value, such \u201cchopping\u201d can be done at any minute resolution (e.g. 1 cent) as desired.
(1.4) A method as in (1) whereby the digital coin is used as an encryption key to decrypt digital goods bought with that coin, using, for example, an encryption method as in U.S. Pat. No. 6,823,068, where the key can be of any size, thereby rendering it unnecessary to send the coin contents over the Internet; instead, the seller sends the digital goods to the Mint with the header identification of the coin held by the buyer, allowing the mint to encrypt the digital goods with the contents of that coin, requiring the buyer to own the coin in order to make use of the purchased digital file.
2. A method to enable two online strangers to exchange goods and payment by creating a temporary secret between them, sufficient for the payment to be made securely; the method involves the payer preparing a list of n cryptographic keys K1, K2, . . . Kn and a corresponding list of n computational tasks: T1, T2, . . . Tn all made available to the payee online, such that the payee will be able to randomly select task Ti to be computed, and then sending the result of such computation, Ri to the payer, allowing the payer to immediately recognize the value of i because the payer has a prepared list of the n results: R1, R2 . . . Ri . . . Rn, which instantly makes key Ki a temporary shared secret between payer and payee because a third party will be unaware of the value of i, and will have to compute all the results R1, R2, . . . Ri . . . , Rn to find the value of i, but even if the third party has a much faster computer than the payee, the value of n may be adjusted to create sufficient time delay for the shared secret to be useful, as the case is when the payer is using Ki to encrypt an address and an access code for a record in a generally accessible database, allowing the payee to decrypt the sent message using the same Ki, and then use the decrypted access code to read the contents of said record, which will contain the digital coin the payer has put there for payment; once accessed, the coin will be erased so that when the third party is finally catching up with the value of Ki and trying to access the same record, there would be no coin there to steal, thus making the short lived secret between payer and payee sufficient for the safe transfer of value between payer and payee despite the fact that the two are complete strangers to each other.
(2.1) The method in (2) where the manager of the said records database will suspend all transactions in the case where two or more online users are attempting to access the same record, within a short interval of time.
(2.2) The method in (2) where the record database will contain a durable encryption key to be shared by payer and payee to subsequently accomplish the private transfer of digital currency.
3. A method to allow an online account holder, who was given a PIN offline to authenticate himself to get access to his account, to so do without allowing visibility of the PIN itself to the online community, rather proving to the account custodian who needs to verify and authenticate the account holder that the PIN is in the possession of the claimant account holder, and doing so by using the Master One Way function published by the inventor November 2007 (http:eprint.iacr.org2007412) that will transform the PIN combined with a random session string that is communicated in the open, to an output string that can be verified by the account custodian to be generated with the PIN, but since the output string was generated by the Master One-Way function, it is as difficult as desired for a third party to reverse compute the PIN from the output string, because the Master One-Way function allows its user to control the input size (PIN plus random session string), and the output size (to prevent guessing, but allow for convenience of short output string), and thereby protect the PIN and account holder from online theft of his PIN.
(3.1) The method in (3) where the user receives two PINs, one as described in (3), and the other, a \u201cdistress PIN\u201d that when used, will signal to the account custodian that the PIN holder is coerced, and acting under distress, so that the account custodian will behave as if the right PIN was submitted but execute a policy procedure to account for the distress.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method for facilitating synchronization in a data transmitting system, comprising:
receiving data into a queue, where the received data is to be transmitted;
determining whether the queue is empty;
forwarding data from the queue when it is determined that the queue is not empty; and
forwarding idle time synchronization information when it is determined that the queue is empty, where the idle time synchronization information comprises a predetermined number of inter-frame time fill bytes followed by a runt abort packet having less than six bytes.
2. The method of claim 1, where the runt abort packet includes an abort byte indicator at an end of the runt abort packet.
3. The method of claim 1, where the idle time synchronization information comprises an alternating sequence of runt abort packets and inter-frame time fill bytes.
4. The method of claim 1, where the runt abort packet is generated using a random number generator.
5. The method of claim 2, further comprising:
scrambling the runt abort packet and the data;
appending the abort byte indicator to the scrambled runt abort packet; and
forwarding the scrambled runt abort packet and data to an outgoing processing element.
6. A device, comprising:
a first outgoing element configured to forward idle time synchronization information when it is determined that data is not available for forwarding and further configured to forward the data when data is available for forwarding,
where the idle time synchronization information comprises a predetermined number of inter-frame time fill bytes followed by at least one runt abort packet having less than a predetermined number of bytes and an abort packet identifier; and
a second outgoing processing element configured to receive the data and the idle time synchronization information from the first outgoing processing element and further configured to generate packet information by processing the data and the idle time synchronization information in accordance with a packet protocol.
7. The device of claim 6, where the second outgoing processing element is further configured to scramble the data and the at least one runt abort packet.
8. The device of claim 6, where the at least one runt abort packet is less than six bytes.
9. The device of claim 6, where the idle time synchronization information comprises an alternating sequence of inter-frame time fill bytes and runt abort packets.
10. The device of claim 6, where the second outgoing processing element is further configured to not scramble the at least one inter-frame time fill byte.
11. A method, comprising:
receiving, via a data receiving system, a data stream from a data transmitting system;
identifying idle time synchronization information in the received data stream, the synchronization information comprising a predetermined number of inter-frame time fill bytes followed by a runt abort packet;
determining whether the idle time synchronization information includes the runt abort packet in the received data stream;
discarding the idle time synchronization information when the idle time synchronization information includes the runt abort packet; and
synchronizing the data receiving system with the data transmitting system by resetting an idle state of the data receiving system upon receipt of the idle time synchronization information including the runt abort packet.
12. The method of claim 11, where the identifying idle time synchronization information further comprises:
identifying an abort byte sequence appended to the runt abort packet.
13. The method of claim 11, where the idle time synchronization information includes an alternating sequence of inter-frame time fill bytes and runt abort packets.
14. A system, comprising:
an outgoing device configured to insert idle time synchronization information into a data stream,
where the idle time synchronization information includes a predetermined number of inter-frame time fill bytes followed by at least a runt abort packet; and
a receiving device configured to receive the data stream and to identify the runt abort packet in the idle time synchronization information,
where the receiving device is further configured to synchronize with the outgoing device by resetting an idle state of the receiving device upon identification of the runt abort packet.
15. The system of claim 14, where the idle time synchronization information comprises an alternating sequence of inter-frame time fill bytes and runt abort packets.