Granted Patent B1

US 12,502,242 · App. 18/442,211 · Granted Dec 23, 2025

Inventors: Andy Staats (Issaquah, WA); Brian MacLachlan (Norton Shores, MI); Grant Westphal (Delton, MI); Stephen J. Reasoner (Kalamazoo, MI)

Assignee: Stryker Corporation

A61B50/30G06F8/53G06F21/31G06F21/562G06F21/563G06F21/6245A61M1/64A61M1/79G06F21/51G06F21/70

Abstract

Claims (35)

1 . A method of manufacturing a surgical waste collection manifold with a volume collected datum and a rover type to ensure compatibility with a surgical waste collection rover, the surgical waste collection rover including a vacuum pump and a receiver defining an opening, the method including:

obtaining a used first manifold comprising a first housing defining a surface, the first housing defining a first manifold volume and a first outlet opening in fluid communication with the first manifold volume, a first circuit coupled to the surface of the first housing and being used, the circuit comprising a first memory device including a first memory bank and a second memory bank, the first memory bank of the first circuit including a first memory field including a first hash digest, the second memory bank including a second memory field including a second hash digest, the first circuit coupled to the surface of the manifold, the used first manifold including a contaminant in the first manifold volume and a time stamp field indicating a time of first use and a contamination bit indicative of prior vacuum;

programming the first memory field of the used first manifold with a third hash digest, the third hash digest different from the first hash digest;

programming the second memory field of the used first manifold with a fourth hash digest, the fourth hash digest different from the second hash digest;

programming a time stamp field on the first memory device indicating that no first use has occurred;

and

removing the contaminant from the first manifold volume of the used first manifold to yield a cleaned first manifold.

2 . The method of claim 1 , wherein the used first manifold was obtained from a first procedure room having a first surgical waste collection rover, the method further comprising:

shipping the cleaned first manifold to a second procedure room having a second surgical waste collection rover, the second surgical waste collection rover having a different memory contents than the first surgical waste collection rover;

obtaining a third manifold, the third manifold having a third housing defining a surface, the third housing defining a third manifold volume and a third outlet opening in fluid communication with the third manifold volume;

coupling a third circuit to the surface of the third manifold; and

shipping the third manifold to a third procedure room at a third medical facility having a third surgical waste collection rover, where the second procedure room is located in a different location than the third procedure room.

3 . The method of claim 1 , wherein the step of programming the first memory field of the used first manifold with the third hash digest is further defined as programming the first memory field of the used first manifold with an encrypted third hash digest, and wherein the step of programming the second memory field of the used first manifold with a fourth hash digest is further defined as programming the second memory field of the used first manifold with an encrypted fourth hash digest.

4 . A method of manufacturing a surgical waste collection manifold with a volume collected datum and a rover type to ensure compatibility with a surgical waste collection rover based on a first manifold having a first circuit, the first circuit including a first memory device including a first memory bank and a second memory bank, the first memory bank including a first memory field, and the second memory bank including a second memory field, the first memory field being programmed with an encrypted first hash digest and the second memory field being programmed with an encrypted second hash digest, said method including:

coupling a second circuit to a second manifold, the second circuit comprising a second memory device including a third memory bank and fourth memory bank, the third memory bank including a third memory field, and the fourth memory bank including a fourth memory field;

reading the encrypted first hash digest and the encrypted second hash digest from the first circuit;

programming the third memory field based on the reading of the encrypted first hash digest; and

programming the fourth memory field based on the reading of the encrypted second hash digest.

5 . The method of claim 4 , further comprising injection-molding the second manifold, positioning a filter element within the second manifold, and inserting a drip stop seal into the manifold.

6 . The method of claim 4 , further comprising the steps of:

shipping the second manifold to a first procedure room at a first healthcare facility having a surgical waste collection rover;

obtaining a third manifold, the third manifold having a third housing defining a surface, the third housing defining a third manifold volume and a third outlet opening in fluid communication with the third manifold volume;

coupling a third circuit to the surface of the third manifold, the third circuit comprising a third memory device including a fifth memory bank and a sixth memory bank, the fifth memory bank including a seventh memory field including the encrypted first hash digest, the sixth memory bank including an eighth memory field including the encrypted second hash digest; and

shipping the third manifold to a second procedure room at a second medical facility having a second surgical waste collection rover, where the first healthcare facility is located in a different location than the second medical facility.

7 . The method of claim 4 , wherein the encrypted first hash digest is different from the encrypted second hash digest.

8 . The method of claim 7 , wherein the first hash digest is encrypted with a first key, and the second hash digest is encrypted with a second key.

9 . The method of claim 8 , wherein the first key is different from the second key.

10 . The method of claim 9 , wherein the first key is asymmetric and the second key is symmetric.

11 . The method of claim 8 , wherein the second circuit further comprises an identifier and a randomized data set, the first key based on at least one datum of the randomized data set.

12 . The method of claim 11 , wherein the second key is based on a second randomized data set, wherein the randomized data set that the first key is based on is different from the second randomized data set.

13 . The method of claim 12 , wherein the randomized data set that the first key is based on is stored in a different memory bank of the second memory device than the third memory bank, and the encrypted second hash digest is further based on the second randomized data set.

14 . The method of claim 11 , wherein the first key is further based on a static key.

15 . The method of claim 14 , wherein the static key is stored at a location other than the third memory bank and the fourth memory bank of the second circuit.

16 . The method of claim 4 , wherein the second circuit includes a second identifier and a second randomized data set, and wherein the third circuit includes a third identifier and a third randomized data set, where the second identifier is the same as the third identifier and at least one datum of the second randomized data set of the second circuit is the same as at least one datum of the third randomized data set.

17 . The method of claim 14 , wherein the second circuit is configured to produce a contamination signal in response to receipt of a contamination status command signal.

Assignments (2)

Continuity (1)

References Cited (186)